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.r167-tall-167838853700860.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 GPPP-PT-C0100N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853700860
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000001000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678534048967

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=GPPP-PT-C0100N0000001000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 11:27:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 11:27:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 11:27:30] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-11 11:27:30] [INFO ] Transformed 33 places.
[2023-03-11 11:27:30] [INFO ] Transformed 22 transitions.
[2023-03-11 11:27:30] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 11:27:30] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-11 11:27:30] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
[2023-03-11 11:27:30] [INFO ] Invariant cache hit.
[2023-03-11 11:27:30] [INFO ] Implicit Places using invariants in 33 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 27 out of 32 places after structural reductions.
[2023-03-11 11:27:31] [INFO ] Flatten gal took : 16 ms
[2023-03-11 11:27:31] [INFO ] Flatten gal took : 5 ms
[2023-03-11 11:27:31] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10243 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=157 ) properties (out of 23) seen :22
Finished Best-First random walk after 610 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=152 )
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' '!(((X(p0) U p1)||G((X(G(p2)) U p1))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-11 11:27:31] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 11:27:31] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-11 11:27:31] [INFO ] Invariant cache hit.
[2023-03-11 11:27:31] [INFO ] Implicit Places using invariants in 47 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 415 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1)), p0:(GEQ s17 1), p2:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-00 finished in 568 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(F(!p1)))) U p2))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 11:27:32] [INFO ] Invariant cache hit.
[2023-03-11 11:27:32] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-11 11:27:32] [INFO ] Invariant cache hit.
[2023-03-11 11:27:32] [INFO ] Implicit Places using invariants in 32 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (OR (NOT p0) p1), p1]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), 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=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s2 2) (GEQ s13 1) (GEQ s25 1)), p0:(LT s15 1), p1:(AND (GEQ s1 1) (GEQ s20 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33986 reset in 219 ms.
Stack based approach found an accepted trace after 2640 steps with 909 reset with depth 8 and stack size 8 in 7 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-01 finished in 452 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(((p2 U G((F(p3) U p4)))&&p1))&&p0)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 2 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 20
Applied a total of 3 rules in 10 ms. Remains 30 /32 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 30 cols
[2023-03-11 11:27:32] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 11:27:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-11 11:27:32] [INFO ] Invariant cache hit.
[2023-03-11 11:27:32] [INFO ] Implicit Places using invariants in 47 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/32 places, 20/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 28 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 27 transition count 19
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 27 cols
[2023-03-11 11:27:32] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 11:27:32] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 11:27:32] [INFO ] Invariant cache hit.
[2023-03-11 11:27:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 11:27:32] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 71 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/32 places, 19/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 162 ms. Remains : 25/32 places, 19/22 transitions.
Stuttering acceptance computed with spot in 835 ms :[(OR (NOT p4) (NOT p1) (NOT p0)), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p4), (NOT p4), (OR (NOT p1) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (NOT p4), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) p2 (NOT p4)) (AND p2 (NOT p3) (NOT p4))), (NOT p4), (AND p2 (NOT p3) (NOT p4))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p4) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 4}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 p1 (NOT p4) p2), acceptance={} source=0 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 p4 (NOT p3) p2), acceptance={1} source=1 dest: 5}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={0, 1} source=1 dest: 5}, { cond=(OR (AND p0 p1 p4 (NOT p3)) (AND p0 p1 (NOT p3) p2)), acceptance={0} source=1 dest: 8}, { cond=(AND p0 p1 p4 (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4)) (AND (NOT p4) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p4) p2), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={} source=2 dest: 8}, { cond=(AND p0 p1 (NOT p4) p2), acceptance={0} source=2 dest: 10}], [{ cond=(OR (AND (NOT p0) (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4)) (AND (NOT p4) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p4) p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 p1 (NOT p4) p2), acceptance={} source=3 dest: 10}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 11}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p4) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p4) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p4 (NOT p3) p2), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p4 (NOT p3) (NOT p2)), acceptance={1} source=5 dest: 9}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p4) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p4) p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p4) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(NOT p2), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p4) p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=8 dest: 1}, { cond=(AND p1 p4 (NOT p3) p2), acceptance={1} source=8 dest: 5}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={0, 1} source=8 dest: 5}, { cond=(OR (AND p1 p4 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p1 p4 (NOT p3) (NOT p2)), acceptance={1} source=8 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=9 dest: 1}, { cond=(AND p0 p1 p4 (NOT p3) p2), acceptance={1} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={0, 1} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p4) (NOT p3) p2), acceptance={0} source=9 dest: 8}, { cond=(OR (AND (NOT p0) p4 (NOT p3)) (AND (NOT p1) p4 (NOT p3)) (AND p4 (NOT p3) (NOT p2))), acceptance={1} source=9 dest: 9}, { cond=(AND p0 p1 p4 (NOT p3) p2), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) (NOT p4) p2), acceptance={0, 1} source=10 dest: 2}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={} source=10 dest: 8}, { cond=(AND p1 (NOT p4) p2), acceptance={0} source=10 dest: 10}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=11 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p4)) (AND (NOT p4) (NOT p2))), acceptance={} source=11 dest: 2}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=11 dest: 3}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={} source=11 dest: 5}, { cond=(AND p1 (NOT p4) p2), acceptance={} source=11 dest: 6}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p4) p2), acceptance={} source=11 dest: 10}, { cond=(AND p1 p2), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={0, 1} source=12 dest: 1}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={0} source=12 dest: 8}, { cond=(AND (NOT p1) p4 (NOT p3) p2), acceptance={1} source=12 dest: 9}, { cond=(AND p1 p4 (NOT p3) p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s15 1)), p1:(AND (GEQ s9 1) (GEQ s19 300)), p4:(GEQ s2 2), p3:(AND (GEQ s12 1) (GEQ s15 1) (GEQ s13 1)), p2:(AND (GEQ s12 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-02 finished in 1188 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((F(p0)||(G(p2)&&p1)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-11 11:27:33] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 11:27:33] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
[2023-03-11 11:27:33] [INFO ] Invariant cache hit.
[2023-03-11 11:27:33] [INFO ] Implicit Places using invariants in 50 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s13 1)), p1:(AND (GEQ s2 1) (GEQ s21 1)), p2:(AND (GEQ s2 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 108 ms.
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1 p2))))
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-04 finished in 583 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(p0)) U (G(p1) U X(!p2))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 11:27:34] [INFO ] Invariant cache hit.
[2023-03-11 11:27:34] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-03-11 11:27:34] [INFO ] Invariant cache hit.
[2023-03-11 11:27:34] [INFO ] Implicit Places using invariants in 35 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 219 ms :[p2, (AND (NOT p0) p2), p2, (AND (NOT p0) (NOT p1) p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s24 1)), p2:(AND (GEQ s13 1) (GEQ s25 300)), p0:(AND (GEQ s16 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 122 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) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT p0))), (X (X (AND p2 (NOT p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 16 factoid took 181 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-06 finished in 765 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(F((!p1 U (p2||G(!p1)))))&&p0)))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 11:27:35] [INFO ] Invariant cache hit.
[2023-03-11 11:27:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-11 11:27:35] [INFO ] Invariant cache hit.
[2023-03-11 11:27:35] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s27 700)), p2:(AND (NOT (AND (GEQ s8 1) (GEQ s9 1) (GEQ s27 700))) (NOT (OR (AND (GEQ s8 1) (GEQ s9 1) (GEQ s27 700)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-07 finished in 218 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(G(p0)) U !p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 27 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 25 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 11 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2023-03-11 11:27:35] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 11:27:35] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-11 11:27:35] [INFO ] Invariant cache hit.
[2023-03-11 11:27:35] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 17 transition count 12
Applied a total of 8 rules in 3 ms. Remains 17 /21 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-11 11:27:35] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-11 11:27:35] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 12 rows 17 cols
[2023-03-11 11:27:35] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-11 11:27:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 11:27:35] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 171 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0, true]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-09 finished in 226 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((p0&&G(p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-11 11:27:35] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 11:27:35] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-11 11:27:35] [INFO ] Invariant cache hit.
[2023-03-11 11:27:35] [INFO ] Implicit Places using invariants in 36 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s3 1)), p0:(GEQ s4 2)], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-10 finished in 216 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)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 26 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 9 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2023-03-11 11:27:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 11:27:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-11 11:27:35] [INFO ] Invariant cache hit.
[2023-03-11 11:27:35] [INFO ] Implicit Places using invariants in 30 ms returned [1, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 15/22 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 21 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 13
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 0 with 2 rules applied. Total rules applied 6 place count 18 transition count 12
Applied a total of 6 rules in 3 ms. Remains 18 /21 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-11 11:27:35] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-11 11:27:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 11:27:35] [INFO ] Invariant cache hit.
[2023-03-11 11:27:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 11:27:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 129 ms. Remains : 17/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-11 finished in 184 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||X(!p0)||G(p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-11 11:27:35] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 11:27:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-11 11:27:36] [INFO ] Invariant cache hit.
[2023-03-11 11:27:36] [INFO ] Implicit Places using invariants in 30 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GEQ s4 2), p1:(OR (LT s5 1) (LT s26 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-12 finished in 268 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 X(!p1)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 11:27:36] [INFO ] Invariant cache hit.
[2023-03-11 11:27:36] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-11 11:27:36] [INFO ] Invariant cache hit.
[2023-03-11 11:27:36] [INFO ] Implicit Places using invariants in 39 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 145 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1)), p1:(OR (AND (GEQ s6 1) (GEQ s7 1)) (AND (GEQ s6 1) (GEQ s10 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-13 finished in 646 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)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 26 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 17 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2023-03-11 11:27:36] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 11:27:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-11 11:27:36] [INFO ] Invariant cache hit.
[2023-03-11 11:27:36] [INFO ] Implicit Places using invariants in 31 ms returned [2, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 16/22 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 3 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 21 cols
[2023-03-11 11:27:36] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 11:27:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 11:27:37] [INFO ] Invariant cache hit.
[2023-03-11 11:27:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 11:27:37] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/32 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 21/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1249 steps with 0 reset in 10 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-14 finished in 226 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((!p0 U p1)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-11 11:27:37] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 11:27:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-11 11:27:37] [INFO ] Invariant cache hit.
[2023-03-11 11:27:37] [INFO ] Implicit Places using invariants in 35 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s16 1), p0:(LT s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-15 finished in 171 ms.
All properties solved by simple procedures.
Total runtime 6895 ms.
ITS solved all properties within timeout

BK_STOP 1678534058140

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

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="GPPP-PT-C0100N0000001000"
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 GPPP-PT-C0100N0000001000, 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 r167-tall-167838853700860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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