Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416300628.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is MAPK-PT-10240, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416300628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K Mar 5 18:22 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-10240-LTLFireability-00
FORMULA_NAME MAPK-PT-10240-LTLFireability-01
FORMULA_NAME MAPK-PT-10240-LTLFireability-02
FORMULA_NAME MAPK-PT-10240-LTLFireability-03
FORMULA_NAME MAPK-PT-10240-LTLFireability-04
FORMULA_NAME MAPK-PT-10240-LTLFireability-05
FORMULA_NAME MAPK-PT-10240-LTLFireability-06
FORMULA_NAME MAPK-PT-10240-LTLFireability-07
FORMULA_NAME MAPK-PT-10240-LTLFireability-08
FORMULA_NAME MAPK-PT-10240-LTLFireability-09
FORMULA_NAME MAPK-PT-10240-LTLFireability-10
FORMULA_NAME MAPK-PT-10240-LTLFireability-11
FORMULA_NAME MAPK-PT-10240-LTLFireability-12
FORMULA_NAME MAPK-PT-10240-LTLFireability-13
FORMULA_NAME MAPK-PT-10240-LTLFireability-14
FORMULA_NAME MAPK-PT-10240-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679469283830

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-10240
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 07:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:14:45] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-22 07:14:45] [INFO ] Transformed 22 places.
[2023-03-22 07:14:45] [INFO ] Transformed 30 transitions.
[2023-03-22 07:14:45] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 83 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 2 formulas.
FORMULA MAPK-PT-10240-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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
[2023-03-22 07:14:45] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-22 07:14:45] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-22 07:14:45] [INFO ] Invariant cache hit.
[2023-03-22 07:14:45] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-22 07:14:45] [INFO ] Invariant cache hit.
[2023-03-22 07:14:45] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 21 out of 22 places after structural reductions.
[2023-03-22 07:14:46] [INFO ] Flatten gal took : 16 ms
[2023-03-22 07:14:46] [INFO ] Flatten gal took : 4 ms
[2023-03-22 07:14:46] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10246 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=394 ) properties (out of 22) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :12
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 14 ms. (steps per millisecond=71 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 07:14:46] [INFO ] Invariant cache hit.
[2023-03-22 07:14:46] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 07:14:46] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 07:14:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 07:14:46] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 07:14:46] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 07:14:46] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 6 properties in 2 ms.
FORMULA MAPK-PT-10240-LTLFireability-03 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))||X(X(X(X(X(F(!p0))))))))'
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 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 07:14:46] [INFO ] Invariant cache hit.
[2023-03-22 07:14:46] [INFO ] Implicit Places using invariants in 27 ms returned [8]
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 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 31 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p1) p0), false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0), false, false, (AND (NOT p1) p0), false]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(OR p0 p1), acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(OR p0 p1), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(OR p0 p1), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(OR p0 p1), acceptance={} source=9 dest: 6}]], initial=7, aps=[p1:(AND (GEQ s6 1) (GEQ s8 1)), p0:(LT s11 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]]
Product exploration explored 100000 steps with 20000 reset in 212 ms.
Product exploration explored 100000 steps with 20000 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) p0), false, (AND (NOT p1) p0), false, false, false, false]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1280 ) properties (out of 4) seen :0
Finished Best-First random walk after 224 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) p0), false, (AND (NOT p1) p0), false, false, false, false]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p1) p0), false, (AND (NOT p1) p0), false, false, false, false]
Support contains 3 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 2 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2023-03-22 07:14:49] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 07:14:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 07:14:49] [INFO ] Invariant cache hit.
[2023-03-22 07:14:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 07:14:49] [INFO ] Invariant cache hit.
[2023-03-22 07:14:49] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 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 (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false, false, false, false]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1707 ) properties (out of 4) seen :0
Finished Best-First random walk after 775 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=193 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false, false, false, false]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false, false, false, false]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false, false, false, false]
Product exploration explored 100000 steps with 20000 reset in 82 ms.
Product exploration explored 100000 steps with 20000 reset in 74 ms.
Applying partial POR strategy [false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), false, false, false, false, false]
Support contains 3 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 6 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 0 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 16 ms. Remains 19 /21 variables (removed 2) and now considering 26/30 (removed 4) transitions.
[2023-03-22 07:14:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:14:51] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2023-03-22 07:14:51] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 07:14:51] [INFO ] Dead Transitions using invariants and state equation in 30 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 58 ms. Remains : 19/21 places, 26/30 transitions.
Support contains 3 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
[2023-03-22 07:14:51] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 07:14:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 07:14:51] [INFO ] Invariant cache hit.
[2023-03-22 07:14:51] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 07:14:51] [INFO ] Invariant cache hit.
[2023-03-22 07:14:51] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 21/21 places, 30/30 transitions.
Treatment of property MAPK-PT-10240-LTLFireability-01 finished in 4412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)&&X(p1)))||(X(!p0) U p2)))'
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
[2023-03-22 07:14:51] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-22 07:14:51] [INFO ] Implicit Places using invariants in 24 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 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 26 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (OR (NOT p2) p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LT s15 1), p2:(GEQ s10 1), p1:(OR (LT s18 1) (LT s19 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]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-10240-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-LTLFireability-02 finished in 228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (X(p1) U p2))))'
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 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 07:14:51] [INFO ] Invariant cache hit.
[2023-03-22 07:14:51] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 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 35 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s14 1) (GEQ s17 1)), p0:(OR (GEQ s10 1) (NOT (AND (GEQ s8 1) (GEQ s14 1)))), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-10240-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-LTLFireability-04 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(p2))))'
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 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 12 ms. Remains 14 /22 variables (removed 8) and now considering 20/30 (removed 10) transitions.
[2023-03-22 07:14:51] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 14 cols
[2023-03-22 07:14:51] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 07:14:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 07:14:51] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2023-03-22 07:14:51] [INFO ] Invariant cache hit.
[2023-03-22 07:14:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 07:14:51] [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.
[2023-03-22 07:14:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:14:51] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2023-03-22 07:14:51] [INFO ] Invariant cache hit.
[2023-03-22 07:14:51] [INFO ] Dead Transitions using invariants and state equation in 29 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 97 ms. Remains : 14/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s4 1), p0:(LT s12 1), p2:(AND (LT s12 1) (OR (LT s5 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-10240-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-LTLFireability-05 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X((F(p1)||X(F(p2))))))))'
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
[2023-03-22 07:14:51] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 07:14:51] [INFO ] Implicit Places using invariants in 27 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 2 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 31 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s4 1), p1:(OR (LT s7 1) (LT s13 1)), p2:(LT s11 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 827 reset in 146 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA MAPK-PT-10240-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-10240-LTLFireability-06 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(!p1)))))'
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 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 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 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 19 place count 15 transition count 21
Applied a total of 19 rules in 14 ms. Remains 15 /22 variables (removed 7) and now considering 21/30 (removed 9) transitions.
[2023-03-22 07:14:52] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 15 cols
[2023-03-22 07:14:52] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 07:14:52] [INFO ] Implicit Places using invariants in 26 ms returned [7, 8]
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.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44 ms. Remains : 13/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s6 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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-10240-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-LTLFireability-07 finished in 142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(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
Applied a total of 16 rules in 7 ms. Remains 16 /22 variables (removed 6) and now considering 23/30 (removed 7) transitions.
[2023-03-22 07:14:52] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
// Phase 1: matrix 20 rows 16 cols
[2023-03-22 07:14:52] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-22 07:14:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 07:14:52] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
[2023-03-22 07:14:52] [INFO ] Invariant cache hit.
[2023-03-22 07:14:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:14:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 07:14:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:14:52] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
[2023-03-22 07:14:52] [INFO ] Invariant cache hit.
[2023-03-22 07:14:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 23/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 16/22 places, 23/30 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s15 1)), p1:(OR (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-10240-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-LTLFireability-08 finished in 205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||(p1&&X(!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 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-22 07:14:52] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 07:14:52] [INFO ] Implicit Places using invariants in 44 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 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 47 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, 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: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1)) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=4, aps=[p0:(GEQ s16 1), p1:(LT s0 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 125 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-10240-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-LTLFireability-09 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&(G(!p2)||p1)))||(!p2 U !p0))))'
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 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 07:14:52] [INFO ] Invariant cache hit.
[2023-03-22 07:14:52] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 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 27 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (OR (NOT p0) (AND (NOT p1) p2)), (AND p0 p2), p2]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (LT s18 1) (LT s19 1)), p2:(LT s10 1), p1:(OR (LT s18 1) (LT s19 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 189 ms.
Product exploration explored 100000 steps with 0 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (OR (NOT p0) (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 725 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (AND p0 p2 (NOT p1)), p2, (AND p0 p2), (AND p0 p2 (NOT p1)), (OR (NOT p0) (AND (NOT p1) p2))]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1463 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 30 rows 20 cols
[2023-03-22 07:14:54] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 07:14:54] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 07:14:54] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-22 07:14:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 07:14:54] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-22 07:14:54] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 07:14:54] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35840 steps, including 0 resets, run visited all 2 properties in 292 ms. (steps per millisecond=122 )
Parikh walk visited 2 properties in 291 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (OR (NOT p0) (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 p1)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 p1 (NOT p2))), (F p0), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (OR (NOT p0) (AND (NOT p1) p2)))), (F (AND p0 p1 p2))]
Knowledge based reduction with 21 factoid took 862 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p1), false, (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), false, (NOT p0)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 12 edges and 20 vertex of which 8 / 20 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 13 transition count 23
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 13 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 13 transition count 19
Applied a total of 12 rules in 11 ms. Remains 13 /20 variables (removed 7) and now considering 19/30 (removed 11) transitions.
[2023-03-22 07:14:56] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 13 cols
[2023-03-22 07:14:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 07:14:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 07:14:56] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:14:56] [INFO ] Invariant cache hit.
[2023-03-22 07:14:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:14:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 07:14:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:14:56] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:14:56] [INFO ] Invariant cache hit.
[2023-03-22 07:14:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/20 places, 19/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 13/20 places, 19/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 (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 324 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p1), false, (NOT p0)]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2561 ) properties (out of 5) seen :3
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:14:56] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:14:56] [INFO ] Invariant cache hit.
[2023-03-22 07:14:56] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 07:14:56] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 07:14:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 07:14:56] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 07:14:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:14:56] [INFO ] After 2ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-22 07:14:56] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 07:14:56] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35845 steps, including 1 resets, run visited all 1 properties in 45 ms. (steps per millisecond=796 )
Parikh walk visited 1 properties in 44 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F p0), (F (AND p0 p2)), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 636 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, false, (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, false, (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, false, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 258 ms.
Product exploration explored 100000 steps with 0 reset in 243 ms.
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2023-03-22 07:14:58] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:14:58] [INFO ] Invariant cache hit.
[2023-03-22 07:14:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 07:14:58] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:14:58] [INFO ] Invariant cache hit.
[2023-03-22 07:14:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:14:58] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-22 07:14:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:14:58] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:14:58] [INFO ] Invariant cache hit.
[2023-03-22 07:14:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 13/13 places, 19/19 transitions.
Treatment of property MAPK-PT-10240-LTLFireability-10 finished in 5573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 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 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-22 07:14:58] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 07:14:58] [INFO ] Implicit Places using invariants in 20 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 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 1 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 22 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s10 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 17 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-10240-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-LTLFireability-12 finished in 138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X(X((p1||G(F(!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 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 07:14:58] [INFO ] Invariant cache hit.
[2023-03-22 07:14:58] [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 5 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 37 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 602 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2)]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 13}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}, { cond=(AND p0 p2), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={} source=6 dest: 9}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 10}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 3}, { cond=p0, acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 11}, { cond=(AND p0 p2), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=9 dest: 6}, { cond=(AND p0 p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=10 dest: 11}, { cond=(AND p0 p2), acceptance={} source=10 dest: 12}, { cond=(AND p0 p2), acceptance={0} source=10 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=11 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=11 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=12 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=12 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=13 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=13 dest: 12}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=13 dest: 13}]], initial=0, aps=[p0:(GEQ s12 1), p1:(GEQ s1 1), p2:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 733 reset in 115 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA MAPK-PT-10240-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-10240-LTLFireability-13 finished in 785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(!p0)&&G(!p1)))))'
Support contains 2 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 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 07:14:59] [INFO ] Invariant cache hit.
[2023-03-22 07:14:59] [INFO ] Implicit Places using invariants in 34 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 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 37 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR p0 p1), (OR p0 p1), p0, p1]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s15 1), p0:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 643 reset in 116 ms.
Stack based approach found an accepted trace after 43 steps with 1 reset with depth 15 and stack size 15 in 0 ms.
FORMULA MAPK-PT-10240-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-10240-LTLFireability-14 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (!p1||F((!p2&&F(p3))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 15 transition count 24
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 15 transition count 22
Applied a total of 15 rules in 5 ms. Remains 15 /22 variables (removed 7) and now considering 22/30 (removed 8) transitions.
[2023-03-22 07:14:59] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 15 cols
[2023-03-22 07:14:59] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-22 07:14:59] [INFO ] Implicit Places using invariants in 26 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 22/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 14 transition count 21
Applied a total of 1 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 21/22 (removed 1) transitions.
[2023-03-22 07:14:59] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2023-03-22 07:14:59] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 07:14:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 07:14:59] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-22 07:14:59] [INFO ] Invariant cache hit.
[2023-03-22 07:14:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:14:59] [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.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/22 places, 21/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 14/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p3), (OR (NOT p3) p2), (OR (AND p1 (NOT p3)) (AND p1 p2)), (AND p1 (NOT p3))]
Running random walk in product with property : MAPK-PT-10240-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p3) p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p3:(GEQ s10 1), p2:(LT s11 1), p1:(LT s6 1), p0:(OR (LT s12 1) (LT s13 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 39 steps with 2 reset in 0 ms.
FORMULA MAPK-PT-10240-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-10240-LTLFireability-15 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))||X(X(X(X(X(F(!p0))))))))'
Found a Shortening insensitive property : MAPK-PT-10240-LTLFireability-01
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) p0), false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0), false, false, (AND (NOT p1) p0), false]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_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 6 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 14 transition count 25
Graph (trivial) has 8 edges and 14 vertex of which 2 / 14 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 14 place count 13 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 13 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 13 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 12 transition count 20
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 12 transition count 19
Applied a total of 23 rules in 13 ms. Remains 12 /22 variables (removed 10) and now considering 19/30 (removed 11) transitions.
[2023-03-22 07:15:00] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 12 cols
[2023-03-22 07:15:00] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 07:15:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 07:15:00] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2023-03-22 07:15:00] [INFO ] Invariant cache hit.
[2023-03-22 07:15:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:15:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 07:15:00] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2023-03-22 07:15:00] [INFO ] Invariant cache hit.
[2023-03-22 07:15:00] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/22 places, 19/30 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 86 ms. Remains : 12/22 places, 19/30 transitions.
Running random walk in product with property : MAPK-PT-10240-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(OR p0 p1), acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(OR p0 p1), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(OR p0 p1), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(OR p0 p1), acceptance={} source=9 dest: 6}]], initial=7, aps=[p1:(AND (GEQ s4 1) (GEQ s6 1)), p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 0 ms.
Treatment of property MAPK-PT-10240-LTLFireability-01 finished in 509 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&(G(!p2)||p1)))||(!p2 U !p0))))'
Found a Lengthening insensitive property : MAPK-PT-10240-LTLFireability-10
Stuttering acceptance computed with spot in 205 ms :[true, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1)), (OR (NOT p0) (AND (NOT p1) p2)), (AND p0 p2), p2]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
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 16 place count 13 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 13 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 13 transition count 21
Applied a total of 19 rules in 8 ms. Remains 13 /22 variables (removed 9) and now considering 21/30 (removed 9) transitions.
[2023-03-22 07:15:00] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
// Phase 1: matrix 16 rows 13 cols
[2023-03-22 07:15:00] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 07:15:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 07:15:00] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2023-03-22 07:15:00] [INFO ] Invariant cache hit.
[2023-03-22 07:15:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:15:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 07:15:00] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2023-03-22 07:15:00] [INFO ] Invariant cache hit.
[2023-03-22 07:15:00] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/22 places, 21/30 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 76 ms. Remains : 13/22 places, 21/30 transitions.
Running random walk in product with property : MAPK-PT-10240-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (LT s11 1) (LT s12 1)), p2:(LT s6 1), p1:(OR (LT s11 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (OR (NOT p0) (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 773 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (AND p0 p2 (NOT p1)), p2, (AND p0 p2), (AND p0 p2 (NOT p1)), (OR (NOT p0) (AND (NOT p1) p2))]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1024 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 07:15:02] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2023-03-22 07:15:02] [INFO ] Invariant cache hit.
[2023-03-22 07:15:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 07:15:02] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-22 07:15:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 07:15:02] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-22 07:15:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:15:02] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-22 07:15:02] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 07:15:02] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 251 ms.
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 21/21 transitions.
Graph (complete) has 24 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 10 transition count 11
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 1 with 2 rules applied. Total rules applied 9 place count 9 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 9 transition count 9
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 7 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 7 transition count 7
Applied a total of 14 rules in 4 ms. Remains 7 /13 variables (removed 6) and now considering 7/21 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 7/13 places, 7/21 transitions.
Incomplete random walk after 10246 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1159925 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :{}
Probabilistic random walk after 1159925 steps, saw 477355 distinct states, run finished after 3003 ms. (steps per millisecond=386 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 7 cols
[2023-03-22 07:15:05] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 07:15:05] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 07:15:05] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:15:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 07:15:05] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:15:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:15:05] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 07:15:05] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 07:15:05] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23041 steps, including 0 resets, run visited all 2 properties in 132 ms. (steps per millisecond=174 )
Parikh walk visited 2 properties in 131 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (OR (NOT p0) (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p2 p1)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 p1 (NOT p2))), (F p0), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (OR (NOT p0) (AND (NOT p1) p2)))), (F (AND p0 p1 p2))]
Knowledge based reduction with 21 factoid took 1016 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p1), false, (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) p1), false, (NOT p0)]
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 21/21 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 19
Applied a total of 2 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 19/21 (removed 2) transitions.
[2023-03-22 07:15:07] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 13 cols
[2023-03-22 07:15:07] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 07:15:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 07:15:07] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:15:07] [INFO ] Invariant cache hit.
[2023-03-22 07:15:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:15:07] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-22 07:15:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 07:15:07] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:15:07] [INFO ] Invariant cache hit.
[2023-03-22 07:15:07] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/13 places, 19/21 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 13/13 places, 19/21 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 (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 423 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) p1), false, (NOT p0)]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2049 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:15:07] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:15:07] [INFO ] Invariant cache hit.
[2023-03-22 07:15:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 07:15:07] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 07:15:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 07:15:07] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 07:15:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:15:07] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-22 07:15:07] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 07:15:07] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13/13 places, 19/19 transitions.
Graph (complete) has 23 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 10 transition count 10
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 1 with 2 rules applied. Total rules applied 8 place count 9 transition count 9
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 7 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 7 transition count 7
Applied a total of 12 rules in 2 ms. Remains 7 /13 variables (removed 6) and now considering 7/19 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 7/13 places, 7/19 transitions.
Incomplete random walk after 10246 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3659300 steps, run timeout after 3001 ms. (steps per millisecond=1219 ) properties seen :{}
Probabilistic random walk after 3659300 steps, saw 1501749 distinct states, run finished after 3001 ms. (steps per millisecond=1219 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 7 cols
[2023-03-22 07:15:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 07:15:10] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 07:15:10] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:15:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 07:15:10] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:15:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:15:10] [INFO ] After 1ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:15:10] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 07:15:10] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 23041 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=921 )
Parikh walk visited 1 properties in 25 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F p0), (F (AND p0 p2)), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 440 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, false, (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, false, (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, false, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Support contains 3 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2023-03-22 07:15:11] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 13 cols
[2023-03-22 07:15:11] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 07:15:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-22 07:15:11] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:15:11] [INFO ] Invariant cache hit.
[2023-03-22 07:15:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 07:15:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-22 07:15:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 07:15:11] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-22 07:15:11] [INFO ] Invariant cache hit.
[2023-03-22 07:15:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 13/13 places, 19/19 transitions.
Treatment of property MAPK-PT-10240-LTLFireability-10 finished in 11529 ms.
[2023-03-22 07:15:12] [INFO ] Flatten gal took : 3 ms
[2023-03-22 07:15:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 07:15:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 1 ms.
Total runtime 26796 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MAPK-PT-10240
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/364
LTLFireability

FORMULA MAPK-PT-10240-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679469333084

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/364/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/364/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/364/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 MAPK-PT-10240-LTLFireability-01
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MAPK-PT-10240-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
MAPK-PT-10240-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1799 13/32 MAPK-PT-10240-LTLFireability-01 1904967 m, 380993 m/sec, 7555315 t fired, .

Time elapsed: 6 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MAPK-PT-10240-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
MAPK-PT-10240-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1799 22/32 MAPK-PT-10240-LTLFireability-01 3328740 m, 284754 m/sec, 14115496 t fired, .

Time elapsed: 11 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MAPK-PT-10240-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
MAPK-PT-10240-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1799 31/32 MAPK-PT-10240-LTLFireability-01 4642484 m, 262748 m/sec, 20381437 t fired, .

Time elapsed: 16 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for MAPK-PT-10240-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MAPK-PT-10240-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
MAPK-PT-10240-LTLFireability-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 21 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 MAPK-PT-10240-LTLFireability-10
lola: time limit : 3579 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for MAPK-PT-10240-LTLFireability-10
lola: result : false
lola: markings : 20495
lola: fired transitions : 20495
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MAPK-PT-10240-LTLFireability-01: LTL unknown AGGR
MAPK-PT-10240-LTLFireability-10: LTL false LTL model checker


Time elapsed: 21 secs. Pages in use: 32

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-10240"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is MAPK-PT-10240, 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 r231-tall-167856416300628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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