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.r263-smll-167863538500604.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 Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538500604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 13K Feb 25 22:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 22:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 22:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:23 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 Peterson-PT-2-LTLFireability-00
FORMULA_NAME Peterson-PT-2-LTLFireability-01
FORMULA_NAME Peterson-PT-2-LTLFireability-02
FORMULA_NAME Peterson-PT-2-LTLFireability-03
FORMULA_NAME Peterson-PT-2-LTLFireability-04
FORMULA_NAME Peterson-PT-2-LTLFireability-05
FORMULA_NAME Peterson-PT-2-LTLFireability-06
FORMULA_NAME Peterson-PT-2-LTLFireability-07
FORMULA_NAME Peterson-PT-2-LTLFireability-08
FORMULA_NAME Peterson-PT-2-LTLFireability-09
FORMULA_NAME Peterson-PT-2-LTLFireability-10
FORMULA_NAME Peterson-PT-2-LTLFireability-11
FORMULA_NAME Peterson-PT-2-LTLFireability-12
FORMULA_NAME Peterson-PT-2-LTLFireability-13
FORMULA_NAME Peterson-PT-2-LTLFireability-14
FORMULA_NAME Peterson-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678856036782

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=Peterson-PT-2
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 04:53:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 04:53:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 04:54:00] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-03-15 04:54:00] [INFO ] Transformed 102 places.
[2023-03-15 04:54:00] [INFO ] Transformed 126 transitions.
[2023-03-15 04:54:00] [INFO ] Found NUPN structural information;
[2023-03-15 04:54:00] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Peterson-PT-2-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 26 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 04:54:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-15 04:54:00] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-15 04:54:00] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-15 04:54:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:00] [INFO ] Invariant cache hit.
[2023-03-15 04:54:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-15 04:54:01] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-15 04:54:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:01] [INFO ] Invariant cache hit.
[2023-03-15 04:54:01] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 897 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 57 out of 102 places after structural reductions.
[2023-03-15 04:54:01] [INFO ] Flatten gal took : 71 ms
[2023-03-15 04:54:01] [INFO ] Flatten gal took : 28 ms
[2023-03-15 04:54:01] [INFO ] Input system was already deterministic with 126 transitions.
Support contains 55 out of 102 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 04:54:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:02] [INFO ] Invariant cache hit.
[2023-03-15 04:54:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-15 04:54:03] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-15 04:54:03] [INFO ] After 123ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-15 04:54:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-15 04:54:03] [INFO ] After 41ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 04:54:03] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 04:54:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-15 04:54:03] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 04:54:03] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 04:54:03] [INFO ] After 60ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 04:54:03] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 19 ms to minimize.
[2023-03-15 04:54:03] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2023-03-15 04:54:03] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 21 ms to minimize.
[2023-03-15 04:54:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 312 ms
[2023-03-15 04:54:03] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2023-03-15 04:54:04] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-15 04:54:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-03-15 04:54:04] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-15 04:54:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-15 04:54:04] [INFO ] After 687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-15 04:54:04] [INFO ] After 1004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 43 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 102 transition count 96
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 72 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 64 place count 70 transition count 76
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 52 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 55 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 48/102 places, 72/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Finished probabilistic random walk after 3702 steps, run visited all 4 properties in 47 ms. (steps per millisecond=78 )
Probabilistic random walk after 3702 steps, saw 983 distinct states, run finished after 48 ms. (steps per millisecond=77 ) properties seen :4
FORMULA Peterson-PT-2-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 04:54:05] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:05] [INFO ] Invariant cache hit.
[2023-03-15 04:54:05] [INFO ] Implicit Places using invariants in 153 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 155 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s32 0) (EQ s33 0) (EQ s34 0) (EQ s35 0) (EQ s37 0) (EQ s36 0) (EQ s39 0) (EQ s38 0) (EQ s40 0) (EQ s43 0) (EQ s23 0) (EQ s25 0) (EQ s26 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 741 ms.
Product exploration explored 100000 steps with 33333 reset in 609 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 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-2-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLFireability-03 finished in 2232 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 X(G(p1)))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 04:54:07] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:07] [INFO ] Invariant cache hit.
[2023-03-15 04:54:07] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-15 04:54:07] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:07] [INFO ] Invariant cache hit.
[2023-03-15 04:54:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-15 04:54:08] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-15 04:54:08] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:08] [INFO ] Invariant cache hit.
[2023-03-15 04:54:08] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Peterson-PT-2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s89 1) (EQ s99 1)) (AND (EQ s89 1) (EQ s100 1)) (AND (EQ s79 1) (EQ s99 1)) (AND (EQ s79 1) (EQ s100 1)) (AND (EQ s86 1) (EQ s96 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10040 reset in 473 ms.
Stack based approach found an accepted trace after 134 steps with 21 reset with depth 35 and stack size 35 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-05 finished in 1270 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(F(p1))))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 16 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
[2023-03-15 04:54:09] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 48 cols
[2023-03-15 04:54:09] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 04:54:09] [INFO ] Implicit Places using invariants in 91 ms returned [34, 36, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 93 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/102 places, 72/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 45/102 places, 72/126 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s12 1) (EQ s13 1) (EQ s15 1)), p1:(OR (AND (EQ s30 1) (EQ s35 1)) (AND (EQ s28 1) (EQ s36 1)) (AND (EQ s29 1) (EQ s37 1)) (AND (EQ s31 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 7716 reset in 327 ms.
Stack based approach found an accepted trace after 23 steps with 1 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-06 finished in 676 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(p0)) U (p1 U p2))&&X(F(p1))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 04:54:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-15 04:54:09] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 04:54:09] [INFO ] Implicit Places using invariants in 130 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 131 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s65 1) (EQ s88 1)), p1:(AND (EQ s48 1) (EQ s51 1)), p0:(AND (EQ s88 1) (EQ s94 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-09 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p0 U p1)) U (!p0 U (p1||G(!p0)))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 70 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 68 transition count 92
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 68 place count 68 transition count 74
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 104 place count 50 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 22 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
[2023-03-15 04:54:10] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 45 cols
[2023-03-15 04:54:10] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 04:54:10] [INFO ] Implicit Places using invariants in 108 ms returned [34, 36, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 110 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/102 places, 69/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 42/102 places, 69/126 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) p0), true, (AND (NOT p1) p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s32 1), p0:(EQ s6 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, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 156 ms.
Product exploration explored 100000 steps with 4 reset in 228 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 p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 04:54:11] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 42 cols
[2023-03-15 04:54:11] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-15 04:54:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-15 04:54:11] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 04:54:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-15 04:54:11] [INFO ] After 8ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 04:54:11] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 04:54:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-15 04:54:11] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 04:54:11] [INFO ] After 6ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 04:54:11] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2023-03-15 04:54:11] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2023-03-15 04:54:11] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-03-15 04:54:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
[2023-03-15 04:54:11] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-15 04:54:11] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 42/42 places, 69/69 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1942 steps, run visited all 1 properties in 10 ms. (steps per millisecond=194 )
Probabilistic random walk after 1942 steps, saw 512 distinct states, run finished after 11 ms. (steps per millisecond=176 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-15 04:54:12] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-15 04:54:12] [INFO ] Invariant cache hit.
[2023-03-15 04:54:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-15 04:54:12] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-15 04:54:12] [INFO ] Invariant cache hit.
[2023-03-15 04:54:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-15 04:54:12] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-15 04:54:12] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-15 04:54:12] [INFO ] Invariant cache hit.
[2023-03-15 04:54:12] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 42/42 places, 69/69 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 301 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 04:54:12] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-15 04:54:12] [INFO ] Invariant cache hit.
[2023-03-15 04:54:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-15 04:54:13] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 04:54:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-15 04:54:13] [INFO ] After 13ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 04:54:13] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 04:54:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-15 04:54:13] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 04:54:13] [INFO ] After 10ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 04:54:13] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-15 04:54:13] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2023-03-15 04:54:13] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-15 04:54:13] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2023-03-15 04:54:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 172 ms
[2023-03-15 04:54:13] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-15 04:54:13] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 42/42 places, 69/69 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1942 steps, run visited all 1 properties in 7 ms. (steps per millisecond=277 )
Probabilistic random walk after 1942 steps, saw 512 distinct states, run finished after 7 ms. (steps per millisecond=277 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 385 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 216 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-15 04:54:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 04:54:14] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-15 04:54:14] [INFO ] Invariant cache hit.
[2023-03-15 04:54:15] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 42/42 places, 69/69 transitions.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-15 04:54:15] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-15 04:54:15] [INFO ] Invariant cache hit.
[2023-03-15 04:54:15] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-15 04:54:15] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-15 04:54:15] [INFO ] Invariant cache hit.
[2023-03-15 04:54:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-15 04:54:15] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-15 04:54:15] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-15 04:54:15] [INFO ] Invariant cache hit.
[2023-03-15 04:54:15] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 42/42 places, 69/69 transitions.
Treatment of property Peterson-PT-2-LTLFireability-10 finished in 5138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&F(!p1)) U (G((!p0&&F(!p1)))||(F(!p1)&&p2))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 70 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 69 transition count 93
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 66 place count 69 transition count 76
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 100 place count 52 transition count 76
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 112 place count 46 transition count 70
Applied a total of 112 rules in 21 ms. Remains 46 /102 variables (removed 56) and now considering 70/126 (removed 56) transitions.
[2023-03-15 04:54:15] [INFO ] Flow matrix only has 64 transitions (discarded 6 similar events)
// Phase 1: matrix 64 rows 46 cols
[2023-03-15 04:54:15] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 04:54:15] [INFO ] Implicit Places using invariants in 105 ms returned [35, 37, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/102 places, 70/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 43/102 places, 70/126 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : Peterson-PT-2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 p1) (AND p1 (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p1) (AND p1 (NOT p0))), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s20 1) (EQ s26 1))) (NEQ s29 1)), p0:(AND (EQ s20 1) (EQ s26 1)), p1:(AND (EQ s21 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2397 reset in 271 ms.
Stack based approach found an accepted trace after 1349 steps with 28 reset with depth 83 and stack size 70 in 4 ms.
FORMULA Peterson-PT-2-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-11 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(X(X(G((F(G(!p0)) U p1))))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 04:54:16] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-15 04:54:16] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 04:54:16] [INFO ] Implicit Places using invariants in 108 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 110 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-12 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: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s35 1), p0:(AND (EQ s15 1) (EQ s35 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 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 205 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 p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 04:54:17] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2023-03-15 04:54:17] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-15 04:54:17] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-15 04:54:17] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 04:54:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-15 04:54:17] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 04:54:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-15 04:54:17] [INFO ] After 15ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 04:54:17] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-15 04:54:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2023-03-15 04:54:17] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2023-03-15 04:54:17] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-15 04:54:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 234 ms
[2023-03-15 04:54:17] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-15 04:54:17] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 126/126 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 93
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 66 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 65 transition count 92
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 68 place count 65 transition count 74
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 104 place count 47 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 114 place count 42 transition count 69
Applied a total of 114 rules in 12 ms. Remains 42 /99 variables (removed 57) and now considering 69/126 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 42/99 places, 69/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3390 steps, run visited all 1 properties in 11 ms. (steps per millisecond=308 )
Probabilistic random walk after 3390 steps, saw 901 distinct states, run finished after 11 ms. (steps per millisecond=308 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
[2023-03-15 04:54:18] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:18] [INFO ] Invariant cache hit.
[2023-03-15 04:54:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-2-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLFireability-12 finished in 3115 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)))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 04:54:19] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-15 04:54:19] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 04:54:19] [INFO ] Implicit Places using invariants in 82 ms returned [87, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 100/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : Peterson-PT-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s68 1) (EQ s90 1)), p2:(AND (EQ s47 1) (EQ s49 1)), p0:(AND (EQ s48 1) (EQ s85 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]]
Entered a terminal (fully accepting) state of product in 1474 steps with 2 reset in 3 ms.
FORMULA Peterson-PT-2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-13 finished in 284 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((F(G(p0))&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-15 04:54:19] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-15 04:54:19] [INFO ] Invariant cache hit.
[2023-03-15 04:54:19] [INFO ] Implicit Places using invariants in 72 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : Peterson-PT-2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s61 1) (EQ s89 1)), p0:(EQ s24 0), p1:(AND (EQ s66 1) (EQ s86 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]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 93 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-15 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p0 U p1)) U (!p0 U (p1||G(!p0)))))'
[2023-03-15 04:54:20] [INFO ] Flatten gal took : 21 ms
[2023-03-15 04:54:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 04:54:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 126 transitions and 384 arcs took 3 ms.
Total runtime 20381 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-PT-2
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA Peterson-PT-2-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678856061246

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-PT-2-LTLFireability-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Peterson-PT-2-LTLFireability-10
lola: result : false
lola: markings : 1079
lola: fired transitions : 4694
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-2-LTLFireability-10: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="Peterson-PT-2"
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 Peterson-PT-2, 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 r263-smll-167863538500604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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