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.r295-tall-167873948400804.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 QuasiCertifProtocol-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948400804
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 34K 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 QuasiCertifProtocol-COL-02-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678912444033

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=QuasiCertifProtocol-COL-02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 20:34:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 20:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 20:34:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 20:34:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 20:34:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 687 ms
[2023-03-15 20:34:06] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 20:34:06] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-15 20:34:06] [INFO ] Skeletonized 16 HLPN properties in 9 ms.
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1333 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10000 steps, including 696 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 685 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 712 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 20:34:06] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-15 20:34:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 20:34:07] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:1
[2023-03-15 20:34:07] [INFO ] After 34ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-15 20:34:07] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:2
[2023-03-15 20:34:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 20:34:07] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-15 20:34:07] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-15 20:34:07] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 16 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 3 properties in 2 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2023-03-15 20:34:07] [INFO ] Flatten gal took : 17 ms
[2023-03-15 20:34:07] [INFO ] Flatten gal took : 28 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2023-03-15 20:34:07] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 7 ms.
[2023-03-15 20:34:07] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 61 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 7 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2023-03-15 20:34:07] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-15 20:34:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-15 20:34:07] [INFO ] Invariant cache hit.
[2023-03-15 20:34:07] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-15 20:34:07] [INFO ] Invariant cache hit.
[2023-03-15 20:34:07] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 76/86 places, 56/56 transitions.
Support contains 61 out of 76 places after structural reductions.
[2023-03-15 20:34:07] [INFO ] Flatten gal took : 9 ms
[2023-03-15 20:34:07] [INFO ] Flatten gal took : 7 ms
[2023-03-15 20:34:07] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 49 out of 76 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1643 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 18) seen :8
Incomplete Best-First random walk after 10001 steps, including 558 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 542 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 559 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 559 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :7
Running SMT prover for 3 properties.
[2023-03-15 20:34:08] [INFO ] Invariant cache hit.
[2023-03-15 20:34:08] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-15 20:34:08] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-15 20:34:08] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-15 20:34:08] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-15 20:34:08] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-15 20:34:08] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 76 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(F((!p0 U (p1||G(!p0)))))))))'
Support contains 8 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-15 20:34:08] [INFO ] Invariant cache hit.
[2023-03-15 20:34:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-15 20:34:08] [INFO ] Invariant cache hit.
[2023-03-15 20:34:08] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 128 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s56 1)) (AND (GEQ s0 1) (GEQ s57 1)) (AND (GEQ s0 1) (GEQ s55 1))), p1:(AND (NOT (AND (GEQ s40 1) (GEQ s41 1) (GEQ s42 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 5 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-00 finished in 423 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 X(G(p1)))&&(F(p3)||p2))))'
Support contains 8 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-15 20:34:09] [INFO ] Invariant cache hit.
[2023-03-15 20:34:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-15 20:34:09] [INFO ] Invariant cache hit.
[2023-03-15 20:34:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 148 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NOT (OR (AND (GEQ s0 1) (GEQ s49 1)) (AND (GEQ s0 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s51 1)))) (GEQ s59 1) (GEQ s58 1) (GEQ s60 1)), p2:(OR (AND...], 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-02 finished in 458 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 7 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-15 20:34:09] [INFO ] Invariant cache hit.
[2023-03-15 20:34:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-15 20:34:09] [INFO ] Invariant cache hit.
[2023-03-15 20:34:09] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 129 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s59 1) (GEQ s58 1) (GEQ s60 1)), p1:(AND (OR (GEQ s59 1) (GEQ s58 1) (GEQ s60 1)) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s67 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-05 finished in 272 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))))'
Support contains 12 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 53
Applied a total of 3 rules in 17 ms. Remains 71 /76 variables (removed 5) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 71 cols
[2023-03-15 20:34:09] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-15 20:34:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-15 20:34:09] [INFO ] Invariant cache hit.
[2023-03-15 20:34:09] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 114 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/76 places, 53/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 134 ms. Remains : 65/76 places, 53/56 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s36 1) (LT s48 1)) (OR (LT s35 1) (LT s47 1)) (OR (LT s34 1) (LT s46 1))), p1:(OR (AND (GEQ s29 1) (GEQ s50 1)) (AND (GEQ s30 1) (GEQ s51 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-08 finished in 278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2023-03-15 20:34:10] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-15 20:34:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-15 20:34:10] [INFO ] Invariant cache hit.
[2023-03-15 20:34:10] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 125 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s68 1), p1:(OR (AND (GEQ s0 1) (GEQ s47 1)) (AND (GEQ s0 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s46 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-09 finished in 353 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 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 69 transition count 51
Applied a total of 5 rules in 13 ms. Remains 69 /76 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2023-03-15 20:34:10] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 20:34:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-15 20:34:10] [INFO ] Invariant cache hit.
[2023-03-15 20:34:10] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 117 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/76 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 63/76 places, 51/56 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s51 1)) (AND (GEQ s0 1) (GEQ s49 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 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-10 finished in 190 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&&G(p1))) U !p0)))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Graph (complete) has 137 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 70 transition count 52
Applied a total of 5 rules in 9 ms. Remains 70 /76 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 70 cols
[2023-03-15 20:34:10] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 20:34:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-15 20:34:10] [INFO ] Invariant cache hit.
[2023-03-15 20:34:10] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [46, 47, 48]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 108 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/76 places, 52/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 67/76 places, 52/56 transitions.
Stuttering acceptance computed with spot in 150 ms :[p0, (OR (NOT p1) (NOT p0)), p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s66 1), p1:(OR (AND (GEQ s0 1) (GEQ s59 1)) (AND (GEQ s0 1) (GEQ s60 1)) (AND (GEQ s0 1) (GEQ s58 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-11 finished in 286 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&&F(p1)))))'
Support contains 16 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2023-03-15 20:34:10] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-15 20:34:11] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-15 20:34:11] [INFO ] Invariant cache hit.
[2023-03-15 20:34:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 105 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s61 1)) (AND (GEQ s13 1) (GEQ s14 1) (GEQ s15 1) (GEQ s62 1)) (AND (GEQ s16 1) (GEQ s17 1) (GEQ s18 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-12 finished in 246 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(!(((!p1 U X(!p2))&&p0) U X((!p2 U p3))))))'
Support contains 26 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-15 20:34:11] [INFO ] Invariant cache hit.
[2023-03-15 20:34:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-15 20:34:11] [INFO ] Invariant cache hit.
[2023-03-15 20:34:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 103 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/76 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 73/76 places, 56/56 transitions.
Stuttering acceptance computed with spot in 331 ms :[p3, p3, (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=p3, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p3), acceptance={0, 2} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p3), acceptance={2} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={2} source=2 dest: 3}], [{ cond=(AND p0 p2), acceptance={0, 2} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=true, acceptance={0, 1, 2} source=3 dest: 4}, { cond=(NOT p1), acceptance={1, 2} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p3), acceptance={0, 2} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={2} source=4 dest: 3}], [{ cond=(AND p0 p2 p3), acceptance={0, 2} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 4}, { cond=p3, acceptance={0, 1, 2} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) p3), acceptance={1, 2} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s67 1)), p1:(AND (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s69 1)), p2:(AND (OR (LT s39 1) (LT s54 1)) (OR...], nbAcceptance=3, 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 34100 reset in 248 ms.
Product exploration explored 100000 steps with 34087 reset in 153 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p2), (X (NOT p1)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), true, (X (X (NOT (AND (NOT p1) p3)))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p3)))
Knowledge based reduction with 33 factoid took 2005 ms. Reduced automaton from 6 states, 25 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLFireability-15 finished in 2910 ms.
All properties solved by simple procedures.
Total runtime 8700 ms.
ITS solved all properties within timeout

BK_STOP 1678912455316

--------------------
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

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="QuasiCertifProtocol-COL-02"
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 QuasiCertifProtocol-COL-02, 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 r295-tall-167873948400804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 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 ;