Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990200593.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990200593
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 534K Mar 20 13:27 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 BART-PT-002-00
FORMULA_NAME BART-PT-002-01
FORMULA_NAME BART-PT-002-02
FORMULA_NAME BART-PT-002-03
FORMULA_NAME BART-PT-002-04
FORMULA_NAME BART-PT-002-05
FORMULA_NAME BART-PT-002-06
FORMULA_NAME BART-PT-002-07
FORMULA_NAME BART-PT-002-08
FORMULA_NAME BART-PT-002-09
FORMULA_NAME BART-PT-002-10
FORMULA_NAME BART-PT-002-11
FORMULA_NAME BART-PT-002-12
FORMULA_NAME BART-PT-002-13
FORMULA_NAME BART-PT-002-14
FORMULA_NAME BART-PT-002-15

=== Now, execution of the tool begins

BK_START 1623177284765

Running Version 0
[2021-06-08 18:34:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-08 18:34:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 18:34:46] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2021-06-08 18:34:46] [INFO ] Transformed 474 places.
[2021-06-08 18:34:46] [INFO ] Transformed 404 transitions.
[2021-06-08 18:34:46] [INFO ] Found NUPN structural information;
[2021-06-08 18:34:46] [INFO ] Parsed PT model containing 474 places and 404 transitions in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-06-08 18:34:46] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-002-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 264 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 210 transition count 350
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 210 transition count 350
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 151 place count 167 transition count 307
Iterating global reduction 0 with 43 rules applied. Total rules applied 194 place count 167 transition count 307
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 201 place count 160 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 208 place count 160 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 214 place count 154 transition count 294
Iterating global reduction 0 with 6 rules applied. Total rules applied 220 place count 154 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 225 place count 149 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 230 place count 149 transition count 289
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 235 place count 144 transition count 284
Iterating global reduction 0 with 5 rules applied. Total rules applied 240 place count 144 transition count 284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 245 place count 139 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 250 place count 139 transition count 279
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 255 place count 134 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 260 place count 134 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 263 place count 131 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 268 place count 129 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 270 place count 129 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 271 place count 128 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 272 place count 128 transition count 268
Applied a total of 272 rules in 85 ms. Remains 128 /264 variables (removed 136) and now considering 268/404 (removed 136) transitions.
// Phase 1: matrix 268 rows 128 cols
[2021-06-08 18:34:46] [INFO ] Computed 2 place invariants in 18 ms
[2021-06-08 18:34:46] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 268 rows 128 cols
[2021-06-08 18:34:46] [INFO ] Computed 2 place invariants in 5 ms
[2021-06-08 18:34:47] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 128 cols
[2021-06-08 18:34:47] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:47] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/264 places, 268/404 transitions.
[2021-06-08 18:34:47] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-06-08 18:34:47] [INFO ] Flatten gal took : 43 ms
FORMULA BART-PT-002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 18:34:47] [INFO ] Flatten gal took : 18 ms
[2021-06-08 18:34:47] [INFO ] Input system was already deterministic with 268 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=555 ) properties (out of 12) seen :8
Running SMT prover for 4 properties.
// Phase 1: matrix 268 rows 128 cols
[2021-06-08 18:34:47] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-06-08 18:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:34:47] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-06-08 18:34:47] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:34:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-06-08 18:34:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-08 18:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:34:47] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-06-08 18:34:47] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:34:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-06-08 18:34:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-08 18:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:34:47] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-06-08 18:34:47] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:34:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-06-08 18:34:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-08 18:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 18:34:48] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-06-08 18:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 18:34:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
[2021-06-08 18:34:48] [INFO ] Initial state test concluded for 3 properties.
FORMULA BART-PT-002-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 268/268 transitions.
Graph (trivial) has 260 edges and 128 vertex of which 124 / 128 are part of one of the 2 SCC in 3 ms
Free SCC test removed 122 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 3 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 3 transition count 5
Applied a total of 7 rules in 14 ms. Remains 3 /128 variables (removed 125) and now considering 5/268 (removed 263) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-06-08 18:34:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:34:48] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-06-08 18:34:48] [INFO ] Computed 1 place invariants in 1 ms
[2021-06-08 18:34:48] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-06-08 18:34:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-06-08 18:34:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:34:48] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/128 places, 5/268 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-002-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s1 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 0 steps with 0 reset in 2 ms.
FORMULA BART-PT-002-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-01 finished in 385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 268/268 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 118 transition count 258
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 118 transition count 258
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 111 transition count 251
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 111 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 109 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 109 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 108 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 108 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 107 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 107 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 106 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 106 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 104 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 104 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 103 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 103 transition count 243
Applied a total of 50 rules in 25 ms. Remains 103 /128 variables (removed 25) and now considering 243/268 (removed 25) transitions.
// Phase 1: matrix 243 rows 103 cols
[2021-06-08 18:34:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:48] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 243 rows 103 cols
[2021-06-08 18:34:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:48] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 243 rows 103 cols
[2021-06-08 18:34:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:48] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/128 places, 243/268 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-002-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s26 0), p0:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 553 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 103/103 places, 243/243 transitions.
Graph (trivial) has 239 edges and 103 vertex of which 98 / 103 are part of one of the 2 SCC in 1 ms
Free SCC test removed 96 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 9 ms. Remains 7 /103 variables (removed 96) and now considering 9/243 (removed 234) transitions.
[2021-06-08 18:34:50] [INFO ] Redundant transitions in 0 ms returned []
[2021-06-08 18:34:50] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2021-06-08 18:34:50] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:34:50] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/103 places, 9/243 transitions.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
[2021-06-08 18:34:51] [INFO ] Flatten gal took : 9 ms
[2021-06-08 18:34:51] [INFO ] Flatten gal took : 8 ms
[2021-06-08 18:34:51] [INFO ] Time to serialize gal into /tmp/LTL12228212670668505572.gal : 5 ms
[2021-06-08 18:34:51] [INFO ] Time to serialize properties into /tmp/LTL12909120665112874094.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12228212670668505572.gal, -t, CGAL, -LTL, /tmp/LTL12909120665112874094.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12228212670668505572.gal -t CGAL -LTL /tmp/LTL12909120665112874094.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(TrainState_2_3_20==1)")||(F("(TrainState_1_3_11==0)")))))
Formula 0 simplified : !X("(TrainState_2_3_20==1)" | F"(TrainState_1_3_11==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.111178,19784,1,0,6,19923,18,0,2539,3452,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-002-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-002-04 finished in 2723 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 268/268 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 118 transition count 258
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 118 transition count 258
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 109 transition count 249
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 109 transition count 249
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 106 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 106 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 104 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 104 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 103 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 103 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 102 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 102 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 101 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 101 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 100 transition count 240
Applied a total of 56 rules in 22 ms. Remains 100 /128 variables (removed 28) and now considering 240/268 (removed 28) transitions.
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/128 places, 240/268 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-06 automaton TGBA [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:(OR (EQ s24 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 81 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-06 finished in 267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 268/268 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 257
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 257
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 109 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 109 transition count 249
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 106 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 106 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 104 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 104 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 103 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 103 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 102 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 102 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 101 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 101 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 100 transition count 240
Applied a total of 56 rules in 12 ms. Remains 100 /128 variables (removed 28) and now considering 240/268 (removed 28) transitions.
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 2 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 240 rows 100 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/128 places, 240/268 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s48 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1188 steps with 0 reset in 8 ms.
FORMULA BART-PT-002-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-08 finished in 308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 268/268 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 257
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 257
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 109 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 109 transition count 249
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 106 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 106 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 104 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 104 transition count 244
Applied a total of 48 rules in 6 ms. Remains 104 /128 variables (removed 24) and now considering 244/268 (removed 24) transitions.
// Phase 1: matrix 244 rows 104 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 244 rows 104 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:51] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 244 rows 104 cols
[2021-06-08 18:34:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-08 18:34:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/128 places, 244/268 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-12 automaton TGBA [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:(OR (EQ s48 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 279 ms.
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 273 ms.
Product exploration explored 100000 steps with 33333 reset in 252 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 104/104 places, 244/244 transitions.
Graph (trivial) has 238 edges and 104 vertex of which 97 / 104 are part of one of the 2 SCC in 1 ms
Free SCC test removed 95 places
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 9 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 9 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 9 transition count 11
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 7 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 7 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 12 rules in 3 ms. Remains 7 /104 variables (removed 97) and now considering 9/244 (removed 235) transitions.
[2021-06-08 18:34:53] [INFO ] Redundant transitions in 0 ms returned []
[2021-06-08 18:34:53] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2021-06-08 18:34:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-06-08 18:34:53] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/104 places, 9/244 transitions.
Product exploration explored 100000 steps with 33333 reset in 232 ms.
Product exploration explored 100000 steps with 33333 reset in 232 ms.
[2021-06-08 18:34:54] [INFO ] Flatten gal took : 8 ms
[2021-06-08 18:34:54] [INFO ] Flatten gal took : 8 ms
[2021-06-08 18:34:54] [INFO ] Time to serialize gal into /tmp/LTL6339135273025286247.gal : 9 ms
[2021-06-08 18:34:54] [INFO ] Time to serialize properties into /tmp/LTL18182476231011594235.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6339135273025286247.gal, -t, CGAL, -LTL, /tmp/LTL18182476231011594235.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6339135273025286247.gal -t CGAL -LTL /tmp/LTL18182476231011594235.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((TrainState_2_4_20==0)||(TrainState_1_1_8==1))")))))
Formula 0 simplified : !XXF"((TrainState_2_4_20==0)||(TrainState_1_1_8==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.110556,20224,1,0,7,22342,20,0,2560,4338,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-002-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-PT-002-12 finished in 2390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 268/268 transitions.
Graph (trivial) has 266 edges and 128 vertex of which 126 / 128 are part of one of the 2 SCC in 0 ms
Free SCC test removed 124 places
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2 transition count 3
Applied a total of 4 rules in 2 ms. Remains 2 /128 variables (removed 126) and now considering 3/268 (removed 265) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:34:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:34:54] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:34:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:34:54] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-06-08 18:34:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-06-08 18:34:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-06-08 18:34:54] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/128 places, 3/268 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-002-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-14 finished in 113 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623177295497

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="BART-PT-002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-002, 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 r007-tall-162037990200593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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