fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r167-tall-167838853400676
Last Updated
May 14, 2023

About the Execution of LoLa+red for FunctionPointer-PT-b008

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
403.388 8187.00 16677.00 325.20 TFTTFFTFFFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853400676.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 FunctionPointer-PT-b008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853400676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 25 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678502565985

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=FunctionPointer-PT-b008
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:42:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:42:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:42:47] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-11 02:42:47] [INFO ] Transformed 306 places.
[2023-03-11 02:42:47] [INFO ] Transformed 840 transitions.
[2023-03-11 02:42:47] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 189 transition count 538
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 538
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 104 place count 189 transition count 490
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 117 place count 176 transition count 464
Iterating global reduction 2 with 13 rules applied. Total rules applied 130 place count 176 transition count 464
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 146 place count 176 transition count 448
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 153 place count 169 transition count 434
Iterating global reduction 3 with 7 rules applied. Total rules applied 160 place count 169 transition count 434
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 167 place count 162 transition count 406
Iterating global reduction 3 with 7 rules applied. Total rules applied 174 place count 162 transition count 406
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 181 place count 155 transition count 392
Iterating global reduction 3 with 7 rules applied. Total rules applied 188 place count 155 transition count 392
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 151 transition count 376
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 151 transition count 376
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 147 transition count 360
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 147 transition count 360
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 208 place count 143 transition count 352
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 143 transition count 352
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 216 place count 139 transition count 344
Iterating global reduction 3 with 4 rules applied. Total rules applied 220 place count 139 transition count 344
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 224 place count 135 transition count 336
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 135 transition count 336
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 232 place count 131 transition count 328
Iterating global reduction 3 with 4 rules applied. Total rules applied 236 place count 131 transition count 328
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 238 place count 129 transition count 324
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 129 transition count 324
Applied a total of 240 rules in 76 ms. Remains 129 /222 variables (removed 93) and now considering 324/648 (removed 324) transitions.
[2023-03-11 02:42:47] [INFO ] Flow matrix only has 219 transitions (discarded 105 similar events)
// Phase 1: matrix 219 rows 129 cols
[2023-03-11 02:42:47] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-11 02:42:48] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-11 02:42:48] [INFO ] Flow matrix only has 219 transitions (discarded 105 similar events)
[2023-03-11 02:42:48] [INFO ] Invariant cache hit.
[2023-03-11 02:42:48] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 02:42:48] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-03-11 02:42:48] [INFO ] Flow matrix only has 219 transitions (discarded 105 similar events)
[2023-03-11 02:42:48] [INFO ] Invariant cache hit.
[2023-03-11 02:42:48] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/222 places, 324/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 840 ms. Remains : 129/222 places, 324/648 transitions.
Support contains 15 out of 129 places after structural reductions.
[2023-03-11 02:42:48] [INFO ] Flatten gal took : 45 ms
[2023-03-11 02:42:48] [INFO ] Flatten gal took : 25 ms
[2023-03-11 02:42:48] [INFO ] Input system was already deterministic with 324 transitions.
Support contains 14 out of 129 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:42:49] [INFO ] Flow matrix only has 219 transitions (discarded 105 similar events)
[2023-03-11 02:42:49] [INFO ] Invariant cache hit.
[2023-03-11 02:42:49] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-11 02:42:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 02:42:49] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:42:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 02:42:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 02:42:49] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:42:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 02:42:49] [INFO ] After 148ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:42:49] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 02:42:49] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 324/324 transitions.
Graph (complete) has 518 edges and 129 vertex of which 105 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 105 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 98 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 98 transition count 256
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 69 place count 98 transition count 250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 94 transition count 242
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 94 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 92 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 92 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 90 transition count 226
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 90 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 88 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 88 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 86 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 86 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 84 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 84 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 82 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 82 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 80 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 80 transition count 206
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 80 transition count 202
Applied a total of 109 rules in 51 ms. Remains 80 /129 variables (removed 49) and now considering 202/324 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 80/129 places, 202/324 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished Best-First random walk after 4534 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=755 )
FORMULA FunctionPointer-PT-b008-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b008-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 324/324 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 124 transition count 310
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 124 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 124 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 121 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 121 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 119 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 119 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 117 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 117 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 115 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 115 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 113 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 113 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 111 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 111 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 109 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 109 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 107 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 107 transition count 264
Applied a total of 48 rules in 18 ms. Remains 107 /129 variables (removed 22) and now considering 264/324 (removed 60) transitions.
[2023-03-11 02:42:50] [INFO ] Flow matrix only has 177 transitions (discarded 87 similar events)
// Phase 1: matrix 177 rows 107 cols
[2023-03-11 02:42:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:42:50] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 02:42:50] [INFO ] Flow matrix only has 177 transitions (discarded 87 similar events)
[2023-03-11 02:42:50] [INFO ] Invariant cache hit.
[2023-03-11 02:42:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 02:42:50] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-11 02:42:50] [INFO ] Flow matrix only has 177 transitions (discarded 87 similar events)
[2023-03-11 02:42:50] [INFO ] Invariant cache hit.
[2023-03-11 02:42:50] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/129 places, 264/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 107/129 places, 264/324 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s0 1) (GEQ s89 1)), p0:(AND (OR (LT s0 1) (LT s87 1)) (OR (LT s1 1) (LT s12 1)))], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 276 ms.
Product exploration explored 100000 steps with 33333 reset in 194 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b008-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLFireability-00 finished in 1406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 123 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 123 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 123 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 119 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 119 transition count 292
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 116 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 113 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 113 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 110 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 110 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 107 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 107 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 104 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 101 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 98 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 98 transition count 238
Applied a total of 68 rules in 15 ms. Remains 98 /129 variables (removed 31) and now considering 238/324 (removed 86) transitions.
[2023-03-11 02:42:51] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
// Phase 1: matrix 162 rows 98 cols
[2023-03-11 02:42:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 02:42:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 02:42:51] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2023-03-11 02:42:51] [INFO ] Invariant cache hit.
[2023-03-11 02:42:51] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 02:42:51] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-11 02:42:51] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2023-03-11 02:42:51] [INFO ] Invariant cache hit.
[2023-03-11 02:42:51] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/129 places, 238/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 98/129 places, 238/324 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s71 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 315 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-07 finished in 432 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(G(p1)))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 324/324 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 122 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 122 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 20 place count 122 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 118 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 118 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 115 transition count 278
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 112 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 112 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 110 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 110 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 108 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 108 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 107 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 107 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 106 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 106 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 105 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 105 transition count 252
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 105 transition count 250
Applied a total of 56 rules in 45 ms. Remains 105 /129 variables (removed 24) and now considering 250/324 (removed 74) transitions.
[2023-03-11 02:42:51] [INFO ] Flow matrix only has 173 transitions (discarded 77 similar events)
// Phase 1: matrix 173 rows 105 cols
[2023-03-11 02:42:51] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 02:42:51] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 02:42:51] [INFO ] Flow matrix only has 173 transitions (discarded 77 similar events)
[2023-03-11 02:42:51] [INFO ] Invariant cache hit.
[2023-03-11 02:42:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 02:42:52] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-11 02:42:52] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 02:42:52] [INFO ] Flow matrix only has 173 transitions (discarded 77 similar events)
[2023-03-11 02:42:52] [INFO ] Invariant cache hit.
[2023-03-11 02:42:52] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/129 places, 250/324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 376 ms. Remains : 105/129 places, 250/324 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-09 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s77 1)), p1:(OR (LT s5 1) (LT s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 711 steps with 1 reset in 4 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-09 finished in 560 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 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 123 transition count 308
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 123 transition count 308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 20 place count 123 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 120 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 120 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 118 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 118 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 116 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 116 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 114 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 114 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 112 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 110 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 106 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 106 transition count 258
Applied a total of 54 rules in 11 ms. Remains 106 /129 variables (removed 23) and now considering 258/324 (removed 66) transitions.
[2023-03-11 02:42:52] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-11 02:42:52] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 02:42:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 02:42:52] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-11 02:42:52] [INFO ] Invariant cache hit.
[2023-03-11 02:42:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 02:42:52] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-11 02:42:52] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-11 02:42:52] [INFO ] Invariant cache hit.
[2023-03-11 02:42:52] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/129 places, 258/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 106/129 places, 258/324 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-12 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:(AND (GEQ s1 1) (GEQ s83 1)), p1:(OR (LT s0 1) (LT s87 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 8021 steps with 47 reset in 35 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-12 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 123 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 123 transition count 306
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 123 transition count 302
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 120 transition count 296
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 120 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 117 transition count 284
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 117 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 114 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 114 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 111 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 111 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 108 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 105 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 102 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 102 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 99 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 99 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 99 transition count 240
Applied a total of 66 rules in 40 ms. Remains 99 /129 variables (removed 30) and now considering 240/324 (removed 84) transitions.
[2023-03-11 02:42:52] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2023-03-11 02:42:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 02:42:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 02:42:52] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2023-03-11 02:42:52] [INFO ] Invariant cache hit.
[2023-03-11 02:42:53] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 02:42:53] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 02:42:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 02:42:53] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2023-03-11 02:42:53] [INFO ] Invariant cache hit.
[2023-03-11 02:42:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/129 places, 240/324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 99/129 places, 240/324 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 319 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-13 finished in 433 ms.
All properties solved by simple procedures.
Total runtime 5931 ms.
ITS solved all properties within timeout

BK_STOP 1678502574172

--------------------
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="FunctionPointer-PT-b008"
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 FunctionPointer-PT-b008, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838853400676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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