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.r083-tall-162048875300404.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875300404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 129K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 33K May 5 16:51 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 DoubleExponent-PT-002-00
FORMULA_NAME DoubleExponent-PT-002-01
FORMULA_NAME DoubleExponent-PT-002-02
FORMULA_NAME DoubleExponent-PT-002-03
FORMULA_NAME DoubleExponent-PT-002-04
FORMULA_NAME DoubleExponent-PT-002-05
FORMULA_NAME DoubleExponent-PT-002-06
FORMULA_NAME DoubleExponent-PT-002-07
FORMULA_NAME DoubleExponent-PT-002-08
FORMULA_NAME DoubleExponent-PT-002-09
FORMULA_NAME DoubleExponent-PT-002-10
FORMULA_NAME DoubleExponent-PT-002-11
FORMULA_NAME DoubleExponent-PT-002-12
FORMULA_NAME DoubleExponent-PT-002-13
FORMULA_NAME DoubleExponent-PT-002-14
FORMULA_NAME DoubleExponent-PT-002-15

=== Now, execution of the tool begins

BK_START 1620583340198

Running Version 0
[2021-05-09 18:02:24] [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-05-09 18:02:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 18:02:24] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-09 18:02:24] [INFO ] Transformed 110 places.
[2021-05-09 18:02:24] [INFO ] Transformed 98 transitions.
[2021-05-09 18:02:24] [INFO ] Parsed PT model containing 110 places and 98 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 18:02:24] [INFO ] Initial state test concluded for 5 properties.
FORMULA DoubleExponent-PT-002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 98
Applied a total of 3 rules in 14 ms. Remains 107 /110 variables (removed 3) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 107 cols
[2021-05-09 18:02:24] [INFO ] Computed 11 place invariants in 18 ms
[2021-05-09 18:02:25] [INFO ] Implicit Places using invariants in 145 ms returned [74, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 169 ms to find 2 implicit places.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:02:25] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-09 18:02:25] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 105/110 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:02:25] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-09 18:02:25] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 2 iterations. Remains : 105/110 places, 98/98 transitions.
[2021-05-09 18:02:25] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 18:02:25] [INFO ] Flatten gal took : 30 ms
FORMULA DoubleExponent-PT-002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 18:02:25] [INFO ] Flatten gal took : 12 ms
[2021-05-09 18:02:25] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 100000 steps, including 3341 resets, run finished after 276 ms. (steps per millisecond=362 ) properties (out of 17) seen :9
Running SMT prover for 8 properties.
// Phase 1: matrix 98 rows 105 cols
[2021-05-09 18:02:26] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-09 18:02:26] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 3 ms to minimize.
[2021-05-09 18:02:26] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2021-05-09 18:02:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2021-05-09 18:02:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:02:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-09 18:02:26] [INFO ] Deduced a trap composed of 38 places in 20 ms of which 0 ms to minimize.
[2021-05-09 18:02:26] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2021-05-09 18:02:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2021-05-09 18:02:26] [INFO ] Computed and/alt/rep : 97/183/97 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 18:02:26] [INFO ] Added : 91 causal constraints over 19 iterations in 190 ms. Result :sat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned unsat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-09 18:02:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:02:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-09 18:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:02:26] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-09 18:02:26] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2021-05-09 18:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-09 18:02:26] [INFO ] Computed and/alt/rep : 97/183/97 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-09 18:02:27] [INFO ] Added : 91 causal constraints over 19 iterations in 165 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2021-05-09 18:02:27] [INFO ] Initial state test concluded for 3 properties.
FORMULA DoubleExponent-PT-002-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 103 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 103 transition count 97
Applied a total of 3 rules in 24 ms. Remains 103 /105 variables (removed 2) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:27] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ s27 s95), p0:(LEQ s64 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 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, 97/97 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 103 transition count 97
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 22 place count 103 transition count 99
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 103 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 99 transition count 95
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 99 transition count 95
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 55 place count 99 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 98 transition count 98
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 98 transition count 98
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 98 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 94 transition count 99
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 94 transition count 99
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 68 rules in 42 ms. Remains 94 /103 variables (removed 9) and now considering 99/97 (removed -2) transitions.
[2021-05-09 18:02:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 94 cols
[2021-05-09 18:02:28] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-09 18:02:28] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 94/103 places, 99/97 transitions.
Product exploration explored 100000 steps with 50000 reset in 429 ms.
Product exploration explored 100000 steps with 50000 reset in 376 ms.
[2021-05-09 18:02:29] [INFO ] Flatten gal took : 7 ms
[2021-05-09 18:02:29] [INFO ] Flatten gal took : 7 ms
[2021-05-09 18:02:29] [INFO ] Time to serialize gal into /tmp/LTL17481998000589214756.gal : 2 ms
[2021-05-09 18:02:29] [INFO ] Time to serialize properties into /tmp/LTL15521819859490124142.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/LTL17481998000589214756.gal, -t, CGAL, -LTL, /tmp/LTL15521819859490124142.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/LTL17481998000589214756.gal -t CGAL -LTL /tmp/LTL15521819859490124142.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p60<=p44)")||(G("(p27<=p92)"))))))
Formula 0 simplified : !XF("(p60<=p44)" | G"(p27<=p92)")
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t58, t63, t66, t69, t70, t75, t76, t82, t83, t86, t88, t93, t96, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/22/97
Computing Next relation with stutter on 396 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
97 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.987151,53280,1,0,179,112616,230,102,2979,73578,211
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DoubleExponent-PT-002-01 finished in 3372 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 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Graph (complete) has 169 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 103 transition count 69
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 75 transition count 69
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 57 place count 75 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 72 transition count 66
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 105 place count 51 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 49 transition count 45
Applied a total of 109 rules in 10 ms. Remains 49 /105 variables (removed 56) and now considering 45/98 (removed 53) transitions.
// Phase 1: matrix 45 rows 49 cols
[2021-05-09 18:02:30] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 18:02:30] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 45 rows 49 cols
[2021-05-09 18:02:30] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-09 18:02:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2021-05-09 18:02:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 49 cols
[2021-05-09 18:02:30] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-09 18:02:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/105 places, 45/98 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10868 reset in 158 ms.
Product exploration explored 100000 steps with 10923 reset in 136 ms.
Graph (complete) has 147 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10826 reset in 88 ms.
Product exploration explored 100000 steps with 10906 reset in 225 ms.
[2021-05-09 18:02:31] [INFO ] Flatten gal took : 7 ms
[2021-05-09 18:02:31] [INFO ] Flatten gal took : 4 ms
[2021-05-09 18:02:31] [INFO ] Time to serialize gal into /tmp/LTL10217286621119051961.gal : 4 ms
[2021-05-09 18:02:31] [INFO ] Time to serialize properties into /tmp/LTL7560083963893551201.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/LTL10217286621119051961.gal, -t, CGAL, -LTL, /tmp/LTL7560083963893551201.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/LTL10217286621119051961.gal -t CGAL -LTL /tmp/LTL7560083963893551201.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p3<1)"))))
Formula 0 simplified : !FG"(p3<1)"
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12.t43, t45.t46, t77.t88, t84.t58, t85.t86, t93, t96, t47.t48.t49.t50.t51.t52.t59.t63, t22.t33.t44.t55.t66, t61.t62.t53, t68.t70, t71.t54.t56.t72.t76, t74.t75.t57, t81.t83, t90.t91.t92.t13.t17, t1.t2.t3.t4.t5.t6.t13.t17, t8.t9.t26.t30, t94.t95.t26.t30, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/25/20/45
Computing Next relation with stutter on 396 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
68 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.701677,43320,1,0,1901,121387,120,1949,1678,169431,4871
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-002-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DoubleExponent-PT-002-10 finished in 1613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0||X((p1 U p2))) U X(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 104 cols
[2021-05-09 18:02:32] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:32] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 97 rows 104 cols
[2021-05-09 18:02:32] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-09 18:02:32] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 104 cols
[2021-05-09 18:02:32] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-09 18:02:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 1146 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-002-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s10 s40), p3:(LEQ 1 s90), p2:(AND (GT s19 s88) (LEQ s10 s40)), p1:(GT s19 s88)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-12 finished in 1318 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 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 103 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 103 transition count 97
Applied a total of 3 rules in 5 ms. Remains 103 /105 variables (removed 2) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:33] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:33] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 103 cols
[2021-05-09 18:02:33] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 18:02:33] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/105 places, 97/98 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-14 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:(LEQ s84 s88)], 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]]
Product exploration explored 100000 steps with 3308 reset in 78 ms.
Entered a terminal (fully accepting) state of product in 75336 steps with 2509 reset in 68 ms.
FORMULA DoubleExponent-PT-002-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-14 finished in 358 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 105/105 places, 98/98 transitions.
Graph (complete) has 169 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 103 transition count 72
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 78 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 77 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 53 place count 77 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 74 transition count 68
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 99 place count 54 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 52 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 52 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 51 transition count 47
Applied a total of 105 rules in 12 ms. Remains 51 /105 variables (removed 54) and now considering 47/98 (removed 51) transitions.
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 18:02:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 18:02:33] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 18:02:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 18:02:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-09 18:02:33] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-05-09 18:02:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 47 rows 51 cols
[2021-05-09 18:02:33] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 18:02:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/105 places, 47/98 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-15 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s21), p0:(LEQ s42 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-15 finished in 195 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620583354798

--------------------
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="DoubleExponent-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 DoubleExponent-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 r083-tall-162048875300404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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