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.r241-tall-171649628600293.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 MAPK-PT-01280, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628600293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 13 07:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 07:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 07:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MAPK-PT-01280-LTLFireability-00
FORMULA_NAME MAPK-PT-01280-LTLFireability-01
FORMULA_NAME MAPK-PT-01280-LTLFireability-02
FORMULA_NAME MAPK-PT-01280-LTLFireability-03
FORMULA_NAME MAPK-PT-01280-LTLFireability-04
FORMULA_NAME MAPK-PT-01280-LTLFireability-05
FORMULA_NAME MAPK-PT-01280-LTLFireability-06
FORMULA_NAME MAPK-PT-01280-LTLFireability-07
FORMULA_NAME MAPK-PT-01280-LTLFireability-08
FORMULA_NAME MAPK-PT-01280-LTLFireability-09
FORMULA_NAME MAPK-PT-01280-LTLFireability-10
FORMULA_NAME MAPK-PT-01280-LTLFireability-11
FORMULA_NAME MAPK-PT-01280-LTLFireability-12
FORMULA_NAME MAPK-PT-01280-LTLFireability-13
FORMULA_NAME MAPK-PT-01280-LTLFireability-14
FORMULA_NAME MAPK-PT-01280-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716565026060

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=MAPK-PT-01280
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 15:37: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-24 15:37:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:37:07] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2024-05-24 15:37:07] [INFO ] Transformed 22 places.
[2024-05-24 15:37:07] [INFO ] Transformed 30 transitions.
[2024-05-24 15:37:07] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MAPK-PT-01280-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 15:37:07] [INFO ] Computed 7 invariants in 7 ms
[2024-05-24 15:37:08] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-24 15:37:08] [INFO ] Invariant cache hit.
[2024-05-24 15:37:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-24 15:37:08] [INFO ] Invariant cache hit.
[2024-05-24 15:37:08] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 18 out of 22 places after structural reductions.
[2024-05-24 15:37:08] [INFO ] Flatten gal took : 16 ms
[2024-05-24 15:37:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 15:37:08] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10274 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=205 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 15:37:08] [INFO ] Invariant cache hit.
[2024-05-24 15:37:08] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 15:37:08] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-24 15:37:08] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 15:37:08] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 15:37:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2024-05-24 15:37:08] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 15:37:08] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 15:37:08] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 41 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=13 )
Parikh walk visited 5 properties in 3 ms.
FORMULA MAPK-PT-01280-LTLFireability-08 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(p0)||X((p0 U X(G(p1))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 15:37:09] [INFO ] Invariant cache hit.
[2024-05-24 15:37:09] [INFO ] Implicit Places using invariants in 30 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 20/22 places, 30/30 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 259 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s7 1) (GEQ s13 1)), p1:(AND (GEQ s2 1) (GEQ s14 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 1611 reset in 239 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA MAPK-PT-01280-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLFireability-02 finished in 592 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)||X((p1 U p2))) U X(p1))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 15:37:09] [INFO ] Invariant cache hit.
[2024-05-24 15:37:09] [INFO ] Implicit Places using invariants in 41 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (AND p0 p1), p0, p1, p1, p1, p1]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(OR (NOT (AND (GEQ s6 1) (GEQ s7 1))) (GEQ s5 1)), p1:(GEQ s11 1), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLFireability-03 finished in 390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X((p1 U p2))||p0))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 15:37:10] [INFO ] Invariant cache hit.
[2024-05-24 15:37:10] [INFO ] Implicit Places using invariants in 24 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (GEQ s11 1) (LT s6 1) (LT s8 1)), p2:(AND (NOT (AND (GEQ s6 1) (GEQ s8 1))) (GEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 111 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 p0 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10278 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1027 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1993 steps, run visited all 2 properties in 25 ms. (steps per millisecond=79 )
Probabilistic random walk after 1993 steps, saw 1169 distinct states, run finished after 26 ms. (steps per millisecond=76 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2)), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-05-24 15:37:11] [INFO ] Computed 6 invariants in 2 ms
[2024-05-24 15:37:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 15:37:11] [INFO ] Invariant cache hit.
[2024-05-24 15:37:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-24 15:37:11] [INFO ] Invariant cache hit.
[2024-05-24 15:37:11] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 21/21 places, 30/30 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 : [(AND p0 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10274 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2054 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1993 steps, run visited all 2 properties in 27 ms. (steps per millisecond=73 )
Probabilistic random walk after 1993 steps, saw 1169 distinct states, run finished after 27 ms. (steps per millisecond=73 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2)), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 67 ms.
Product exploration explored 100000 steps with 25000 reset in 69 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 19 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 19 transition count 26
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 9 rules in 15 ms. Remains 19 /21 variables (removed 2) and now considering 26/30 (removed 4) transitions.
[2024-05-24 15:37:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:37:13] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2024-05-24 15:37:13] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 15:37:13] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 26/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 19/21 places, 26/30 transitions.
Built C files in :
/tmp/ltsmin1151276436034240307
[2024-05-24 15:37:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1151276436034240307
Running compilation step : cd /tmp/ltsmin1151276436034240307;'/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 184 ms.
Running link step : cd /tmp/ltsmin1151276436034240307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1151276436034240307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14027020435021504099.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA MAPK-PT-01280-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-01280-LTLFireability-04 finished in 3414 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)) U (!p0&&(p0||F(!p1))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 15:37:13] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 15:37:13] [INFO ] Implicit Places using invariants in 27 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR p0 p1), p1, (OR p0 p1)]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s9 1)), p0:(AND (GEQ s19 1) (GEQ s20 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA MAPK-PT-01280-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLFireability-05 finished in 308 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 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
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 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 21 place count 10 transition count 21
Graph (trivial) has 8 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 8 vertex of which 3 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 28 place count 6 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 36 place count 5 transition count 10
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 5 transition count 6
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 42 place count 4 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 43 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 2 transition count 3
Applied a total of 46 rules in 29 ms. Remains 2 /22 variables (removed 20) and now considering 3/30 (removed 27) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-24 15:37:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 15:37:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 15:37:13] [INFO ] Invariant cache hit.
[2024-05-24 15:37:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 15:37:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:37:13] [INFO ] Invariant cache hit.
[2024-05-24 15:37:13] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-07 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 s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLFireability-07 finished in 149 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' '!((!p0 U (p1&&(!p2||F(!p1)))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 16 transition count 26
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 15 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 15 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 15 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 15 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 15 transition count 21
Applied a total of 18 rules in 7 ms. Remains 15 /22 variables (removed 7) and now considering 21/30 (removed 9) transitions.
[2024-05-24 15:37:13] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
// Phase 1: matrix 20 rows 15 cols
[2024-05-24 15:37:13] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 15:37:13] [INFO ] Implicit Places using invariants in 27 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 21/30 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 20
Applied a total of 1 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 20/21 (removed 1) transitions.
[2024-05-24 15:37:13] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 13 cols
[2024-05-24 15:37:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:37:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 15:37:13] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-24 15:37:13] [INFO ] Invariant cache hit.
[2024-05-24 15:37:14] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/22 places, 20/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 13/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p1) p2), p1, (AND p1 p2)]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ 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 p2 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s9 1), p0:(OR (AND (GEQ s5 1) (GEQ s11 1)) (GEQ s9 1)), p2:(GEQ s3 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, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLFireability-09 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 11 transition count 22
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 11 transition count 17
Applied a total of 24 rules in 4 ms. Remains 11 /22 variables (removed 11) and now considering 17/30 (removed 13) transitions.
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-05-24 15:37:14] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:37:14] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2024-05-24 15:37:14] [INFO ] Invariant cache hit.
[2024-05-24 15:37:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 15:37:14] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 15:37:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2024-05-24 15:37:14] [INFO ] Invariant cache hit.
[2024-05-24 15:37:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 17/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 11/22 places, 17/30 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s9 1), p0:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLFireability-10 finished in 174 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(((F(G(p0)) U p0)&&F(G((!p1 U p0))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
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 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 15 transition count 25
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 15 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 15 transition count 22
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 14 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 14 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 14 transition count 20
Applied a total of 20 rules in 9 ms. Remains 14 /22 variables (removed 8) and now considering 20/30 (removed 10) transitions.
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 14 cols
[2024-05-24 15:37:14] [INFO ] Computed 5 invariants in 0 ms
[2024-05-24 15:37:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-24 15:37:14] [INFO ] Invariant cache hit.
[2024-05-24 15:37:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 15:37:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 15:37:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-24 15:37:14] [INFO ] Invariant cache hit.
[2024-05-24 15:37:14] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 20/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 14/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1)), p1:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLFireability-11 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
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 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 22 place count 9 transition count 21
Graph (trivial) has 12 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 8 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 8 transition count 18
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 8 transition count 14
Applied a total of 30 rules in 3 ms. Remains 8 /22 variables (removed 14) and now considering 14/30 (removed 16) transitions.
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-24 15:37:14] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 15:37:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2024-05-24 15:37:14] [INFO ] Invariant cache hit.
[2024-05-24 15:37:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 15:37:14] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 15:37:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:37:14] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2024-05-24 15:37:14] [INFO ] Invariant cache hit.
[2024-05-24 15:37:14] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 14/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 8/22 places, 14/30 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLFireability-12 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((!p0&&(p1||F(G(p2))))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 15:37:14] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 15:37:14] [INFO ] Implicit Places using invariants in 31 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s0 1), p1:(LT s17 1), p2:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 87 steps with 0 reset with depth 88 and stack size 70 in 1 ms.
FORMULA MAPK-PT-01280-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLFireability-13 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(X(p1))&&p0)))||(X(X(p2)) U p3)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 15:37:15] [INFO ] Invariant cache hit.
[2024-05-24 15:37:15] [INFO ] Implicit Places using invariants in 27 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 379 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 7}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}], [{ cond=(AND p3 (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=3 dest: 5}, { cond=(AND p3 p0 p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND p3 p2 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p3 p2 p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p3 p2), acceptance={0} source=8 dest: 0}, { cond=(NOT p2), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 7}, { cond=p1, acceptance={} source=9 dest: 9}]], initial=2, aps=[p2:(AND (GEQ s9 1) (GEQ s15 1)), p3:(AND (GEQ s7 1) (GEQ s8 1)), p0:(AND (GEQ s9 1) (GEQ s15 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLFireability-14 finished in 433 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)) U G(p1)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
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 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 17 transition count 24
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 17 transition count 24
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 16 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 16 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 16 transition count 22
Applied a total of 17 rules in 9 ms. Remains 16 /22 variables (removed 6) and now considering 22/30 (removed 8) transitions.
[2024-05-24 15:37:15] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 16 cols
[2024-05-24 15:37:15] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 15:37:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 15:37:15] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2024-05-24 15:37:15] [INFO ] Invariant cache hit.
[2024-05-24 15:37:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 15:37:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 15:37:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:37:15] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2024-05-24 15:37:15] [INFO ] Invariant cache hit.
[2024-05-24 15:37:15] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 22/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 16/22 places, 22/30 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s14 1) (GEQ s15 1)), p0:(AND (GEQ s5 1) (GEQ s7 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 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 212 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 p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10594 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1513 ) properties (out of 2) seen :1
Finished Best-First random walk after 594 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=594 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 15:37:16] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2024-05-24 15:37:16] [INFO ] Invariant cache hit.
[2024-05-24 15:37:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 15:37:16] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2024-05-24 15:37:16] [INFO ] Invariant cache hit.
[2024-05-24 15:37:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 15:37:16] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-24 15:37:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:37:16] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2024-05-24 15:37:16] [INFO ] Invariant cache hit.
[2024-05-24 15:37:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 16/16 places, 22/22 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 : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10272 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2054 ) properties (out of 2) seen :1
Finished Best-First random walk after 114 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=114 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Built C files in :
/tmp/ltsmin11307038320936146460
[2024-05-24 15:37:17] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-24 15:37:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:37:17] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-24 15:37:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:37:17] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-24 15:37:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:37:17] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11307038320936146460
Running compilation step : cd /tmp/ltsmin11307038320936146460;'/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 94 ms.
Running link step : cd /tmp/ltsmin11307038320936146460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11307038320936146460;'/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/stateBased15585370888038590088.hoa' '--buchi-type=spotba'
LTSmin run took 537 ms.
FORMULA MAPK-PT-01280-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-01280-LTLFireability-15 finished in 2628 ms.
All properties solved by simple procedures.
Total runtime 10789 ms.

BK_STOP 1716565039635

--------------------
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="MAPK-PT-01280"
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 MAPK-PT-01280, 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 r241-tall-171649628600293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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