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.r103-tall-167814478000187.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 DBSingleClientW-PT-d0m05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478000187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 15:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678238013061

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:13:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 01:13:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:13:34] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-08 01:13:34] [INFO ] Transformed 553 places.
[2023-03-08 01:13:34] [INFO ] Transformed 150 transitions.
[2023-03-08 01:13:34] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 40 place count 80 transition count 100
Iterating global reduction 1 with 22 rules applied. Total rules applied 62 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 80 transition count 99
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 70 transition count 89
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 69 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 68 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 67 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 67 transition count 80
Applied a total of 93 rules in 30 ms. Remains 67 /109 variables (removed 42) and now considering 80/150 (removed 70) transitions.
// Phase 1: matrix 80 rows 67 cols
[2023-03-08 01:13:34] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-08 01:13:35] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 01:13:35] [INFO ] Invariant cache hit.
[2023-03-08 01:13:35] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 01:13:35] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-08 01:13:35] [INFO ] Invariant cache hit.
[2023-03-08 01:13:35] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/109 places, 80/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 67/109 places, 80/150 transitions.
Support contains 4 out of 67 places after structural reductions.
[2023-03-08 01:13:35] [INFO ] Flatten gal took : 24 ms
[2023-03-08 01:13:35] [INFO ] Flatten gal took : 11 ms
[2023-03-08 01:13:35] [INFO ] Input system was already deterministic with 80 transitions.
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 985 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 01:13:35] [INFO ] Invariant cache hit.
[2023-03-08 01:13:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:13:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 01:13:35] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-08 01:13:35] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 01:13:35] [INFO ] After 13ms SMT Verify possible using 27 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 01:13:35] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 01:13:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 01:13:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-08 01:13:35] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 01:13:35] [INFO ] After 16ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 01:13:35] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 01:13:35] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 80/80 transitions.
Graph (complete) has 198 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 79
Applied a total of 2 rules in 12 ms. Remains 66 /67 variables (removed 1) and now considering 79/80 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 66/67 places, 79/80 transitions.
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1021 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Finished probabilistic random walk after 20711 steps, run visited all 2 properties in 120 ms. (steps per millisecond=172 )
Probabilistic random walk after 20711 steps, saw 9150 distinct states, run finished after 120 ms. (steps per millisecond=172 ) properties seen :2
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 218 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 63 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 61 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 58 transition count 64
Applied a total of 21 rules in 13 ms. Remains 58 /67 variables (removed 9) and now considering 64/80 (removed 16) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 01:13:36] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-08 01:13:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 01:13:36] [INFO ] Invariant cache hit.
[2023-03-08 01:13:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 01:13:36] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-08 01:13:36] [INFO ] Invariant cache hit.
[2023-03-08 01:13:36] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 64/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 58/67 places, 64/80 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s24 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m05-LTLCardinality-05 finished in 1145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 73
Applied a total of 8 rules in 26 ms. Remains 63 /67 variables (removed 4) and now considering 73/80 (removed 7) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 01:13:37] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 01:13:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:13:37] [INFO ] Invariant cache hit.
[2023-03-08 01:13:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 01:13:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-08 01:13:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:37] [INFO ] Invariant cache hit.
[2023-03-08 01:13:37] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 73/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 63/67 places, 73/80 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s61)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLCardinality-09 finished in 304 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)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 64 transition count 75
Applied a total of 7 rules in 9 ms. Remains 64 /67 variables (removed 3) and now considering 75/80 (removed 5) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 01:13:37] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 01:13:37] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 01:13:37] [INFO ] Invariant cache hit.
[2023-03-08 01:13:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:13:38] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-08 01:13:38] [INFO ] Invariant cache hit.
[2023-03-08 01:13:38] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 75/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 64/67 places, 75/80 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s62)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22961 reset in 175 ms.
Product exploration explored 100000 steps with 22863 reset in 142 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 207 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8386 steps, run visited all 1 properties in 27 ms. (steps per millisecond=310 )
Probabilistic random walk after 8386 steps, saw 3665 distinct states, run finished after 27 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:13:39] [INFO ] Invariant cache hit.
[2023-03-08 01:13:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 01:13:39] [INFO ] Invariant cache hit.
[2023-03-08 01:13:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:13:39] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-08 01:13:39] [INFO ] Invariant cache hit.
[2023-03-08 01:13:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 64/64 places, 75/75 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 207 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 996 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8386 steps, run visited all 1 properties in 21 ms. (steps per millisecond=399 )
Probabilistic random walk after 8386 steps, saw 3665 distinct states, run finished after 21 ms. (steps per millisecond=399 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22888 reset in 97 ms.
Product exploration explored 100000 steps with 22976 reset in 98 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:13:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:13:40] [INFO ] Invariant cache hit.
[2023-03-08 01:13:40] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 64/64 places, 75/75 transitions.
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:13:40] [INFO ] Invariant cache hit.
[2023-03-08 01:13:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 01:13:40] [INFO ] Invariant cache hit.
[2023-03-08 01:13:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:13:40] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 01:13:40] [INFO ] Invariant cache hit.
[2023-03-08 01:13:40] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 64/64 places, 75/75 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLCardinality-11 finished in 2866 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)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d0m05-LTLCardinality-11
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 64 transition count 75
Applied a total of 7 rules in 14 ms. Remains 64 /67 variables (removed 3) and now considering 75/80 (removed 5) transitions.
[2023-03-08 01:13:40] [INFO ] Invariant cache hit.
[2023-03-08 01:13:40] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 01:13:40] [INFO ] Invariant cache hit.
[2023-03-08 01:13:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:13:41] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-08 01:13:41] [INFO ] Invariant cache hit.
[2023-03-08 01:13:41] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/67 places, 75/80 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 206 ms. Remains : 64/67 places, 75/80 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s62)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22945 reset in 94 ms.
Product exploration explored 100000 steps with 22931 reset in 92 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 207 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 997 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8386 steps, run visited all 1 properties in 14 ms. (steps per millisecond=599 )
Probabilistic random walk after 8386 steps, saw 3665 distinct states, run finished after 14 ms. (steps per millisecond=599 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:13:41] [INFO ] Invariant cache hit.
[2023-03-08 01:13:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 01:13:42] [INFO ] Invariant cache hit.
[2023-03-08 01:13:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:13:42] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-08 01:13:42] [INFO ] Invariant cache hit.
[2023-03-08 01:13:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 64/64 places, 75/75 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 207 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8386 steps, run visited all 1 properties in 13 ms. (steps per millisecond=645 )
Probabilistic random walk after 8386 steps, saw 3665 distinct states, run finished after 13 ms. (steps per millisecond=645 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22833 reset in 93 ms.
Product exploration explored 100000 steps with 22965 reset in 94 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 7 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:13:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:13:43] [INFO ] Invariant cache hit.
[2023-03-08 01:13:43] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 64/64 places, 75/75 transitions.
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 01:13:43] [INFO ] Invariant cache hit.
[2023-03-08 01:13:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:13:43] [INFO ] Invariant cache hit.
[2023-03-08 01:13:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 01:13:43] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-08 01:13:43] [INFO ] Invariant cache hit.
[2023-03-08 01:13:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 64/64 places, 75/75 transitions.
Treatment of property DBSingleClientW-PT-d0m05-LTLCardinality-11 finished in 2634 ms.
[2023-03-08 01:13:43] [INFO ] Flatten gal took : 7 ms
[2023-03-08 01:13:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 01:13:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 80 transitions and 315 arcs took 1 ms.
Total runtime 8878 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d0m05
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678238024405

--------------------
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 LTLCardinality -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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d0m05-LTLCardinality-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d0m05-LTLCardinality-11
lola: result : false
lola: markings : 464
lola: fired transitions : 807
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d0m05-LTLCardinality-11: 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="DBSingleClientW-PT-d0m05"
export BK_EXAMINATION="LTLCardinality"
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 DBSingleClientW-PT-d0m05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478000187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m05.tgz
mv DBSingleClientW-PT-d0m05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;