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.r169-tall-167838856400772.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 ltsminxred
Input is GPPP-PT-C0001N0000000001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856400772
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:42 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.3K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 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-C0001N0000000001-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678645407517

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:23:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:23:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:23:29] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-12 18:23:29] [INFO ] Transformed 33 places.
[2023-03-12 18:23:29] [INFO ] Transformed 22 transitions.
[2023-03-12 18:23:29] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:23:29] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-12 18:23:29] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
[2023-03-12 18:23:29] [INFO ] Invariant cache hit.
[2023-03-12 18:23:29] [INFO ] Implicit Places using invariants in 45 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 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 223 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 22 out of 32 places after structural reductions.
[2023-03-12 18:23:29] [INFO ] Flatten gal took : 30 ms
[2023-03-12 18:23:30] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:23:30] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 18:23:30] [INFO ] Computed 12 place invariants in 12 ms
[2023-03-12 18:23:30] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-12 18:23:30] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 6 ms returned sat
[2023-03-12 18:23:30] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X(X(X(G((F(p0)&&(p1||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-12 18:23:30] [INFO ] Invariant cache hit.
[2023-03-12 18:23:31] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-12 18:23:31] [INFO ] Invariant cache hit.
[2023-03-12 18:23:31] [INFO ] Implicit Places using invariants in 43 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 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 2 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 91 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s10 1), p1:(AND (GEQ s0 1) (GEQ s12 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 37 steps with 2 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-00 finished in 637 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(X(X(F(p0))))))'
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.
[2023-03-12 18:23:31] [INFO ] Invariant cache hit.
[2023-03-12 18:23:31] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-12 18:23:31] [INFO ] Invariant cache hit.
[2023-03-12 18:23:31] [INFO ] Implicit Places using invariants in 33 ms returned [0, 3]
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 : 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 71 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s0 1) (LT s23 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 11069 reset in 212 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-03 finished in 482 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||F(!p1)||(F(p2)&&X(p0)))))'
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.
[2023-03-12 18:23:32] [INFO ] Invariant cache hit.
[2023-03-12 18:23:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-12 18:23:32] [INFO ] Invariant cache hit.
[2023-03-12 18:23:32] [INFO ] Implicit Places using invariants in 34 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 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 85 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s11 1)), p1:(OR (LT s0 1) (LT s23 1)), p2:(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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 126 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) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-04 finished in 671 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))))'
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 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 18:23:32] [INFO ] Invariant cache hit.
[2023-03-12 18:23:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-12 18:23:32] [INFO ] Invariant cache hit.
[2023-03-12 18:23:32] [INFO ] Implicit Places using invariants in 49 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 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 95 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s6 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5506 reset in 103 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-05 finished in 319 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(!p1) U ((X(!p1)&&p2)||X(G(!p1)))))))'
Support contains 8 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-12 18:23:33] [INFO ] Invariant cache hit.
[2023-03-12 18:23:33] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-12 18:23:33] [INFO ] Invariant cache hit.
[2023-03-12 18:23:33] [INFO ] Implicit Places using invariants in 42 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 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 99 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1) (GEQ s1 1) (GEQ s24 1)), p2:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s29 7)), p1:(AND (GEQ s0 1) (GEQ s2 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3052 reset in 173 ms.
Stack based approach found an accepted trace after 212 steps with 7 reset with depth 33 and stack size 32 in 1 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-06 finished in 382 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 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 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 18:23:33] [INFO ] Invariant cache hit.
[2023-03-12 18:23:33] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2023-03-12 18:23:33] [INFO ] Invariant cache hit.
[2023-03-12 18:23:33] [INFO ] Implicit Places using invariants in 38 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 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 97 ms. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s6 2), p0:(AND (GEQ s2 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 144 steps with 31 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-07 finished in 275 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 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/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 32 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 16
Applied a total of 15 rules in 11 ms. Remains 23 /32 variables (removed 9) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 23 cols
[2023-03-12 18:23:33] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-12 18:23:33] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-12 18:23:33] [INFO ] Invariant cache hit.
[2023-03-12 18:23:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-12 18:23:33] [INFO ] Invariant cache hit.
[2023-03-12 18:23:33] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-12 18:23:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:23:33] [INFO ] Invariant cache hit.
[2023-03-12 18:23:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 23/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-08 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 s0 1) (GEQ s2 1) (GEQ s7 1) (GEQ s22 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]]
Product exploration explored 100000 steps with 4857 reset in 98 ms.
Stack based approach found an accepted trace after 50 steps with 2 reset with depth 19 and stack size 19 in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-08 finished in 340 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((p0||G(p1)||F(p2)||X(p0)))))'
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.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 18:23:34] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 18:23:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-12 18:23:34] [INFO ] Invariant cache hit.
[2023-03-12 18:23:34] [INFO ] Implicit Places using invariants in 26 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 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 70 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p2:(AND (GEQ s0 1) (GEQ s12 1)), p0:(AND (GEQ s7 1) (GEQ s8 1)), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12262 reset in 93 ms.
Stack based approach found an accepted trace after 36 steps with 4 reset with depth 19 and stack size 19 in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-09 finished in 429 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||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 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 18:23:34] [INFO ] Invariant cache hit.
[2023-03-12 18:23:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-12 18:23:34] [INFO ] Invariant cache hit.
[2023-03-12 18:23:34] [INFO ] Implicit Places using invariants in 26 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 69 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 79 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 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-10 finished in 477 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 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 place count 31 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 29 transition count 18
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 7 place count 28 transition count 18
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 12 place count 25 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
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 17 place count 22 transition count 14
Applied a total of 17 rules in 16 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-12 18:23:34] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 18:23:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-12 18:23:34] [INFO ] Invariant cache hit.
[2023-03-12 18:23:35] [INFO ] Implicit Places using invariants in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 21/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-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 s2 1) (GEQ s12 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 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-11 finished in 118 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(G((F((G(p1)||(p2 U p3)))&&p0))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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-12 18:23:35] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-12 18:23:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-12 18:23:35] [INFO ] Invariant cache hit.
[2023-03-12 18:23:35] [INFO ] Implicit Places using invariants in 28 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 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 0 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 63 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p1) (NOT p3))]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p1:(AND (GEQ s3 1) (GEQ s4 1)), p3:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-C0001N0000000001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-12 finished in 206 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)||G(p1)))'
Support contains 5 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 0 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
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
Applied a total of 3 rules in 6 ms. Remains 30 /32 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 30 cols
[2023-03-12 18:23:35] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 18:23:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-12 18:23:35] [INFO ] Invariant cache hit.
[2023-03-12 18:23:35] [INFO ] Implicit Places using invariants in 27 ms returned [0, 3]
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 : 28/32 places, 20/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 27 transition count 19
Applied a total of 2 rules in 3 ms. Remains 27 /28 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 27 cols
[2023-03-12 18:23:35] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 18:23:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 18:23:35] [INFO ] Invariant cache hit.
[2023-03-12 18:23:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 18:23:35] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/32 places, 19/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 27/32 places, 19/22 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s16 1) (GEQ s0 1) (GEQ s20 1)), p1:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s0 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-LTLFireability-14 finished in 232 ms.
All properties solved by simple procedures.
Total runtime 6231 ms.
ITS solved all properties within timeout

BK_STOP 1678645416539

--------------------
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-C0001N0000000001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPPP-PT-C0001N0000000001, 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 r169-tall-167838856400772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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