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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 28K Apr 13 05:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 05:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 13 05:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 13 05:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Apr 13 05:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K Apr 13 05:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 13 05:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 198K Apr 13 05:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 23 08:04 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 93K 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-Z2T3N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717174993579

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-Z2T3N08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 17:03:16] [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 17:03:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 17:03:16] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-31 17:03:16] [INFO ] Transformed 140 places.
[2024-05-31 17:03:16] [INFO ] Transformed 216 transitions.
[2024-05-31 17:03:16] [INFO ] Parsed PT model containing 140 places and 216 transitions and 680 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2024-05-31 17:03:16] [INFO ] Reduced 8 identical enabling conditions.
[2024-05-31 17:03:16] [INFO ] Reduced 8 identical enabling conditions.
[2024-05-31 17:03:16] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 115 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 47 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-31 17:03:17] [INFO ] Computed 19 invariants in 18 ms
[2024-05-31 17:03:17] [INFO ] Implicit Places using invariants in 406 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 469 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 522 ms. Remains : 139/140 places, 184/184 transitions.
Support contains 115 out of 139 places after structural reductions.
[2024-05-31 17:03:17] [INFO ] Flatten gal took : 83 ms
[2024-05-31 17:03:18] [INFO ] Flatten gal took : 39 ms
[2024-05-31 17:03:18] [INFO ] Input system was already deterministic with 184 transitions.
Finished random walk after 434 steps, including 0 resets, run visited all 24 properties in 108 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 1 ms.
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' '!((G(p0) U X((p1&&X(X(F(p2)))))))'
Support contains 48 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2024-05-31 17:03:18] [INFO ] Computed 18 invariants in 6 ms
[2024-05-31 17:03:19] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-31 17:03:19] [INFO ] Invariant cache hit.
[2024-05-31 17:03:19] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-05-31 17:03:19] [INFO ] Invariant cache hit.
[2024-05-31 17:03:19] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 940 ms. Remains : 139/139 places, 184/184 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 544 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s113 1) (GEQ s114 1) (GEQ s111 1) (GEQ s112 1) (GEQ s109 1) (GEQ s110 1) (GEQ s107 1) (GEQ s108 1)), p1:(OR (GEQ s100 1) (GEQ s99 1) (GEQ s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-00 finished in 1610 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 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 106 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 106 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 98 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 98 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 147 place count 73 transition count 88
Applied a total of 147 rules in 58 ms. Remains 73 /139 variables (removed 66) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 73 cols
[2024-05-31 17:03:20] [INFO ] Computed 17 invariants in 2 ms
[2024-05-31 17:03:20] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-31 17:03:20] [INFO ] Invariant cache hit.
[2024-05-31 17:03:20] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-31 17:03:20] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 17:03:20] [INFO ] Invariant cache hit.
[2024-05-31 17:03:20] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 521 ms. Remains : 73/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s50 1) (GEQ s69 1)) (AND (GEQ s53 1) (GEQ s71 1)) (AND (GEQ s48 1) (GEQ s68 1)) (AND (GEQ s45 1) (GEQ s67 1)) (AND (GEQ s43 1) (GEQ s66 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 708 ms.
Stack based approach found an accepted trace after 1289 steps with 0 reset with depth 1290 and stack size 1280 in 18 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-03 finished in 1325 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(p0))'
Support contains 19 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 83 transition count 112
Applied a total of 128 rules in 36 ms. Remains 83 /139 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 83 cols
[2024-05-31 17:03:21] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 17:03:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 17:03:21] [INFO ] Invariant cache hit.
[2024-05-31 17:03:22] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-31 17:03:22] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 17:03:22] [INFO ] Invariant cache hit.
[2024-05-31 17:03:22] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/139 places, 112/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 83/139 places, 112/184 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s10 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 40626 reset in 743 ms.
Product exploration explored 100000 steps with 40433 reset in 426 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-31 17:03:24] [INFO ] Invariant cache hit.
[2024-05-31 17:03:24] [INFO ] [Real]Absence check using 18 positive place invariants in 18 ms returned sat
[2024-05-31 17:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 17:03:24] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-31 17:03:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 17:03:24] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-31 17:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 17:03:24] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-31 17:03:24] [INFO ] Computed and/alt/rep : 88/160/88 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-31 17:03:24] [INFO ] Added : 44 causal constraints over 10 iterations in 213 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 19 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-31 17:03:24] [INFO ] Invariant cache hit.
[2024-05-31 17:03:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 17:03:25] [INFO ] Invariant cache hit.
[2024-05-31 17:03:25] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-31 17:03:25] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 17:03:25] [INFO ] Invariant cache hit.
[2024-05-31 17:03:25] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 83/83 places, 112/112 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 210 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 241 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2024-05-31 17:03:25] [INFO ] Invariant cache hit.
[2024-05-31 17:03:26] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-31 17:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 17:03:26] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-31 17:03:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 17:03:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-31 17:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 17:03:26] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-31 17:03:26] [INFO ] Computed and/alt/rep : 88/160/88 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 17:03:26] [INFO ] Added : 44 causal constraints over 10 iterations in 176 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40411 reset in 587 ms.
Product exploration explored 100000 steps with 40394 reset in 447 ms.
Built C files in :
/tmp/ltsmin12703657149763126558
[2024-05-31 17:03:27] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2024-05-31 17:03:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:27] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2024-05-31 17:03:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:27] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2024-05-31 17:03:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12703657149763126558
Running compilation step : cd /tmp/ltsmin12703657149763126558;'/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 575 ms.
Running link step : cd /tmp/ltsmin12703657149763126558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12703657149763126558;'/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/stateBased7126342261102091492.hoa' '--buchi-type=spotba'
LTSmin run took 1401 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-04 finished in 8025 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((X(G((!p0||G(p1)))) U (G(p3)||p2)))))'
Support contains 51 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Applied a total of 80 rules in 11 ms. Remains 107 /139 variables (removed 32) and now considering 136/184 (removed 48) transitions.
// Phase 1: matrix 136 rows 107 cols
[2024-05-31 17:03:29] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 17:03:29] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 17:03:29] [INFO ] Invariant cache hit.
[2024-05-31 17:03:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-31 17:03:29] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 17:03:29] [INFO ] Invariant cache hit.
[2024-05-31 17:03:30] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/139 places, 136/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 107/139 places, 136/184 transitions.
Stuttering acceptance computed with spot in 555 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0, 2, 3} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=0 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2, 3} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p2 p1) (AND p3 (NOT p0)) (AND p3 p1)), acceptance={0, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=1 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)), acceptance={1, 2} source=1 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=1 dest: 4}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={0, 3} source=1 dest: 6}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=2 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=2 dest: 3}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 2, 3} source=3 dest: 0}, { cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p2 (NOT p3) p1)), acceptance={0, 2} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=3 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=3 dest: 2}, { cond=(OR (AND p2 p3 (NOT p0)) (AND p2 p3 p1)), acceptance={2} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=3 dest: 4}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=3 dest: 5}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 3} source=3 dest: 6}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=3 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={2, 3} source=3 dest: 8}, { cond=(AND p3 p0 p1), acceptance={3} source=3 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2, 3} source=4 dest: 0}, { cond=(OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))), acceptance={0, 2} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=4 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=4 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=4 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=4 dest: 3}, { cond=(OR (AND p2 (NOT p0) p1) (AND p3 (NOT p0) p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=4 dest: 4}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={0, 3} source=4 dest: 6}, { cond=(AND (NOT p2) p3 (NOT p0) p1), acceptance={1} source=4 dest: 7}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=5 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=5 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=5 dest: 4}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=5 dest: 5}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={0, 2, 3} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=6 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=6 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=6 dest: 4}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=6 dest: 5}, { cond=p1, acceptance={0, 3} source=6 dest: 6}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=6 dest: 7}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 2, 3} source=7 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 2} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=7 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1, 2, 3} source=7 dest: 2}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={2} source=7 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={1, 2} source=7 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={1, 2, 3} source=7 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p0) p1), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=7 dest: 4}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0, 1, 3} source=7 dest: 5}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 3} source=7 dest: 6}, { cond=(AND p2 p3 (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p3 (NOT p0) p1), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p2) p3 p0 p1), acceptance={1, 3} source=7 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={2, 3} source=7 dest: 8}, { cond=(AND p3 p0 p1), acceptance={3} source=7 dest: 9}], [{ cond=(NOT p3), acceptance={0, 2, 3} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=8 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=8 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1, 2, 3} source=8 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={1, 2, 3} source=8 dest: 3}, { cond=p3, acceptance={2, 3} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0, 2, 3} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=9 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=9 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1, 2, 3} source=9 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1, 2, 3} source=9 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=9 dest: 4}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1, 3} source=9 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={0, 3} source=9 dest: 6}, { cond=(AND (NOT p2) p3 p1), acceptance={1, 3} source=9 dest: 7}, { cond=(AND p3 (NOT p1)), acceptance={2, 3} source=9 dest: 8}, { cond=(AND p3 p1), acceptance={3} source=9 dest: 9}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s18 1) (GEQ s66 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s66 1)) (AND (GEQ s1 1) (GEQ s15 1) (GEQ s66 1)) (AND (GEQ s1 1) (GEQ s13...], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1952 reset in 1767 ms.
Stack based approach found an accepted trace after 19640 steps with 398 reset with depth 35 and stack size 35 in 308 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-05 finished in 2938 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(p0))'
Support contains 16 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 96 place count 91 transition count 136
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 90 transition count 104
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 89 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 123 place count 81 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 131 place count 81 transition count 88
Applied a total of 131 rules in 32 ms. Remains 81 /139 variables (removed 58) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 81 cols
[2024-05-31 17:03:32] [INFO ] Computed 17 invariants in 1 ms
[2024-05-31 17:03:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 17:03:32] [INFO ] Invariant cache hit.
[2024-05-31 17:03:32] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-31 17:03:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 17:03:32] [INFO ] Invariant cache hit.
[2024-05-31 17:03:33] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 81/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s38 1) (GEQ s37 1) (GEQ s40 1) (GEQ s39 1) (GEQ s25 1) (GEQ s26 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7616 reset in 394 ms.
Product exploration explored 100000 steps with 7600 reset in 429 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-31 17:03:34] [INFO ] Invariant cache hit.
[2024-05-31 17:03:34] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-31 17:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 17:03:34] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 17:03:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 17:03:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-31 17:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 17:03:34] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-31 17:03:34] [INFO ] Computed and/alt/rep : 72/120/72 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-31 17:03:34] [INFO ] Added : 49 causal constraints over 10 iterations in 156 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 88/88 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-31 17:03:34] [INFO ] Invariant cache hit.
[2024-05-31 17:03:34] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-31 17:03:34] [INFO ] Invariant cache hit.
[2024-05-31 17:03:34] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-31 17:03:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 17:03:34] [INFO ] Invariant cache hit.
[2024-05-31 17:03:35] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 81/81 places, 88/88 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-31 17:03:35] [INFO ] Invariant cache hit.
[2024-05-31 17:03:35] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-31 17:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 17:03:35] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-31 17:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 17:03:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-31 17:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 17:03:35] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 17:03:35] [INFO ] Computed and/alt/rep : 72/120/72 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 17:03:35] [INFO ] Added : 49 causal constraints over 10 iterations in 107 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7641 reset in 392 ms.
Product exploration explored 100000 steps with 7652 reset in 431 ms.
Built C files in :
/tmp/ltsmin14626460882027391575
[2024-05-31 17:03:36] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-31 17:03:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:36] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-31 17:03:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:36] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-31 17:03:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:36] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14626460882027391575
Running compilation step : cd /tmp/ltsmin14626460882027391575;'/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 411 ms.
Running link step : cd /tmp/ltsmin14626460882027391575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14626460882027391575;'/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/stateBased16793091532314634956.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 16 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 88/88 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-31 17:03:52] [INFO ] Invariant cache hit.
[2024-05-31 17:03:52] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 17:03:52] [INFO ] Invariant cache hit.
[2024-05-31 17:03:52] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-31 17:03:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 17:03:52] [INFO ] Invariant cache hit.
[2024-05-31 17:03:52] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 81/81 places, 88/88 transitions.
Built C files in :
/tmp/ltsmin10222580000847292443
[2024-05-31 17:03:52] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-31 17:03:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:52] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-31 17:03:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:52] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-31 17:03:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 17:03:52] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10222580000847292443
Running compilation step : cd /tmp/ltsmin10222580000847292443;'/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 261 ms.
Running link step : cd /tmp/ltsmin10222580000847292443;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10222580000847292443;'/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/stateBased3788298248522748796.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 17:04:07] [INFO ] Flatten gal took : 13 ms
[2024-05-31 17:04:07] [INFO ] Flatten gal took : 11 ms
[2024-05-31 17:04:07] [INFO ] Time to serialize gal into /tmp/LTL9008795941735963563.gal : 4 ms
[2024-05-31 17:04:07] [INFO ] Time to serialize properties into /tmp/LTL14879134798504710585.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9008795941735963563.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6441855398891466406.hoa' '-atoms' '/tmp/LTL14879134798504710585.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14879134798504710585.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6441855398891466406.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
39 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.426893,22428,1,0,95,51578,20,20,1858,35455,193
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-06 finished in 35320 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(F((!p0&&G(!p1))))&&(!p2||X(!p2)))||G((F(!p0)&&F(G(!p1))))))))'
Support contains 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 10 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-31 17:04:08] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 17:04:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-31 17:04:08] [INFO ] Invariant cache hit.
[2024-05-31 17:04:08] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-31 17:04:08] [INFO ] Invariant cache hit.
[2024-05-31 17:04:08] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 465 ms :[(OR p1 p0), (OR p1 p0), p1, (OR p1 p0), false, p0, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s84 1) (GEQ s83 1) (GEQ s86 1) (GEQ s85 1) (GEQ s89 1) (GEQ s87 1) (GEQ s90 1) (GEQ s88 1) (GEQ s97 1) (GEQ s98 1) (GEQ s95 1) (GEQ s96 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 423 ms.
Stack based approach found an accepted trace after 2947 steps with 0 reset with depth 2948 and stack size 2948 in 24 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-07 finished in 1500 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(p0)))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 6 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-31 17:04:09] [INFO ] Invariant cache hit.
[2024-05-31 17:04:09] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-31 17:04:09] [INFO ] Invariant cache hit.
[2024-05-31 17:04:10] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-31 17:04:10] [INFO ] Invariant cache hit.
[2024-05-31 17:04:10] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 895 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-08 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=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s79 1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-08 finished in 1002 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(F(p0))&&F(p1))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 8 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-31 17:04:10] [INFO ] Invariant cache hit.
[2024-05-31 17:04:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 17:04:10] [INFO ] Invariant cache hit.
[2024-05-31 17:04:10] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-31 17:04:10] [INFO ] Invariant cache hit.
[2024-05-31 17:04:11] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-09 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 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s16 1) (GEQ s82 1)), p1:(GEQ s93 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1129 reset in 323 ms.
Stack based approach found an accepted trace after 15300 steps with 137 reset with depth 135 and stack size 135 in 45 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-09 finished in 1183 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) U p1)&&X(G(p2))))'
Support contains 7 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 2 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-31 17:04:11] [INFO ] Invariant cache hit.
[2024-05-31 17:04:11] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-31 17:04:11] [INFO ] Invariant cache hit.
[2024-05-31 17:04:11] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-31 17:04:11] [INFO ] Invariant cache hit.
[2024-05-31 17:04:12] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s92 1), p0:(OR (AND (GEQ s70 1) (GEQ s105 1)) (AND (GEQ s1 1) (GEQ s17 1) (GEQ s82 1))), p2:(AND (GEQ s1 1) (GEQ s12 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-10 finished in 676 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 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 107 transition count 120
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 90 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 90 transition count 104
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 122 place count 82 transition count 96
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 82 transition count 96
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 138 place count 74 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 74 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 66 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 66 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 170 place count 66 transition count 64
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 170 place count 66 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 186 place count 58 transition count 56
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 214 place count 44 transition count 42
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 230 place count 36 transition count 34
Applied a total of 230 rules in 58 ms. Remains 36 /139 variables (removed 103) and now considering 34/184 (removed 150) transitions.
// Phase 1: matrix 34 rows 36 cols
[2024-05-31 17:04:12] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 17:04:12] [INFO ] Implicit Places using invariants in 74 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/139 places, 34/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 35/139 places, 34/184 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s17 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 172 ms.
Stack based approach found an accepted trace after 150 steps with 0 reset with depth 151 and stack size 147 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-11 finished in 387 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)&&(G(p1) U (p2&&G(p1))))))'
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 5 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-31 17:04:12] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 17:04:12] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 17:04:12] [INFO ] Invariant cache hit.
[2024-05-31 17:04:13] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-31 17:04:13] [INFO ] Invariant cache hit.
[2024-05-31 17:04:13] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2 p1), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 2}, { cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (GEQ s0 1) (GEQ s17 1) (GEQ s82 1)), p2:(GEQ s90 1), p0:(OR (LT s71 1) (LT s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-12 finished in 679 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(p1))))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 124 transition count 169
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 124 transition count 169
Applied a total of 30 rules in 5 ms. Remains 124 /139 variables (removed 15) and now considering 169/184 (removed 15) transitions.
// Phase 1: matrix 169 rows 124 cols
[2024-05-31 17:04:13] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 17:04:13] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 17:04:13] [INFO ] Invariant cache hit.
[2024-05-31 17:04:13] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-31 17:04:13] [INFO ] Invariant cache hit.
[2024-05-31 17:04:13] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/139 places, 169/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 124/139 places, 169/184 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s63 1) (LT s102 1)), p0:(LT s46 1)], 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 159 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-13 finished in 484 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(p0) U G((!p0 U (F(p2)&&p1)))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 139 transition count 154
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 75 place count 109 transition count 139
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 75 place count 109 transition count 124
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 105 place count 94 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 93 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 93 transition count 123
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 137 place count 78 transition count 108
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 139 place count 77 transition count 107
Applied a total of 139 rules in 24 ms. Remains 77 /139 variables (removed 62) and now considering 107/184 (removed 77) transitions.
// Phase 1: matrix 107 rows 77 cols
[2024-05-31 17:04:13] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 17:04:14] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 17:04:14] [INFO ] Invariant cache hit.
[2024-05-31 17:04:14] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-31 17:04:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 17:04:14] [INFO ] Invariant cache hit.
[2024-05-31 17:04:14] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/139 places, 107/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 77/139 places, 107/184 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s44 1)), p0:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s44 1)), p2:(GEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 742 reset in 237 ms.
Stack based approach found an accepted trace after 247 steps with 1 reset with depth 102 and stack size 102 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-15 finished in 667 ms.
All properties solved by simple procedures.
Total runtime 58153 ms.

BK_STOP 1717175055831

--------------------
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-Z2T3N08"
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-Z2T3N08, 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-171701122800103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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