About the Execution of ITS-Tools for ERK-PT-100000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2396.691 | 31549.00 | 108648.00 | 167.60 | TFTFFFFFFFFFFFTF | normal |
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-162048875600596.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 ERK-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875600596
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-100000-00
FORMULA_NAME ERK-PT-100000-01
FORMULA_NAME ERK-PT-100000-02
FORMULA_NAME ERK-PT-100000-03
FORMULA_NAME ERK-PT-100000-04
FORMULA_NAME ERK-PT-100000-05
FORMULA_NAME ERK-PT-100000-06
FORMULA_NAME ERK-PT-100000-07
FORMULA_NAME ERK-PT-100000-08
FORMULA_NAME ERK-PT-100000-09
FORMULA_NAME ERK-PT-100000-10
FORMULA_NAME ERK-PT-100000-11
FORMULA_NAME ERK-PT-100000-12
FORMULA_NAME ERK-PT-100000-13
FORMULA_NAME ERK-PT-100000-14
FORMULA_NAME ERK-PT-100000-15
=== Now, execution of the tool begins
BK_START 1620632961543
Running Version 0
[2021-05-10 07:49:23] [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-10 07:49:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 07:49:23] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-10 07:49:23] [INFO ] Transformed 11 places.
[2021-05-10 07:49:23] [INFO ] Transformed 11 transitions.
[2021-05-10 07:49:23] [INFO ] Parsed PT model containing 11 places and 11 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 07:49:23] [INFO ] Initial state test concluded for 3 properties.
FORMULA ERK-PT-100000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:23] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-10 07:49:23] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:23] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-10 07:49:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:49:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
[2021-05-10 07:49:23] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-10 07:49:23] [INFO ] Flatten gal took : 18 ms
FORMULA ERK-PT-100000-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 07:49:23] [INFO ] Flatten gal took : 4 ms
[2021-05-10 07:49:23] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=2380 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:49:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-10 07:49:23] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:22
[2021-05-10 07:49:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 07:49:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned unsat :2 sat :20
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-10 07:49:23] [INFO ] SMT Verify possible in nat domain returned unsat :2 sat :20
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-10 07:49:23] [INFO ] Initial state test concluded for 2 properties.
FORMULA ERK-PT-100000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&G(p1)&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:49:23] [INFO ] Implicit Places using invariants in 16 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2021-05-10 07:49:23] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-10 07:49:23] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2021-05-10 07:49:23] [INFO ] Computed 4 place invariants in 8 ms
[2021-05-10 07:49:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (AND p1 (NOT p2))]
Running random walk in product with property : ERK-PT-100000-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 3}]], initial=0, aps=[p1:(GT s6 s4), p0:(LEQ s9 s2), p2:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 231 ms.
Product exploration explored 100000 steps with 0 reset in 265 ms.
Knowledge obtained : [p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ERK-PT-100000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-01 finished in 1343 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 9 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:25] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:49:25] [INFO ] Implicit Places using invariants in 13 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 13 ms to find 3 implicit places.
[2021-05-10 07:49:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:49:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:49:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-10 07:49:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:49:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:49:25] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ERK-PT-100000-04 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:(LEQ s0 s4), p1:(GT s7 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ERK-PT-100000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-04 finished in 270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:49:25] [INFO ] Implicit Places using invariants in 12 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:49:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:49:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:49:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:49:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ERK-PT-100000-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s8 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-08 finished in 148 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:49:25] [INFO ] Implicit Places using invariants in 12 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 13 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:49:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:49:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:49:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:49:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s4 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5849 reset in 118 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ERK-PT-100000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-09 finished in 232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:25] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:49:25] [INFO ] Implicit Places using invariants in 11 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:49:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:49:25] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:49:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:49:25] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ERK-PT-100000-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s0 s3), p1:(LEQ s3 s5)], 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 14 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-10 finished in 154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Applied a total of 4 rules in 6 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 07:49:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 07:49:26] [INFO ] Implicit Places using invariants in 10 ms returned [0, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
[2021-05-10 07:49:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2021-05-10 07:49:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:49:26] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 7/11 places, 10/11 transitions.
Graph (trivial) has 4 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 9/10 (removed 1) transitions.
[2021-05-10 07:49:26] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 07:49:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:49:26] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-10 07:49:26] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-10 07:49:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:49:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-10 07:49:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/11 places, 9/11 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s4 s3)], 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 0 ms.
FORMULA ERK-PT-100000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-11 finished in 102 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2 place count 10 transition count 10
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 07:49:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:49:26] [INFO ] Implicit Places using invariants in 12 ms returned [0, 6, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 13 ms to find 3 implicit places.
[2021-05-10 07:49:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2021-05-10 07:49:26] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-10 07:49:26] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 7/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-10 07:49:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2021-05-10 07:49:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:49:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s4 s3), p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-12 finished in 113 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 07:49:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 07:49:26] [INFO ] Implicit Places using invariants in 8 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
[2021-05-10 07:49:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 07:49:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:49:26] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-10 07:49:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 07:49:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:49:26] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s3 s6) (LEQ 3 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 183 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Product exploration explored 100000 steps with 0 reset in 161 ms.
[2021-05-10 07:49:27] [INFO ] Flatten gal took : 2 ms
[2021-05-10 07:49:27] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:49:27] [INFO ] Time to serialize gal into /tmp/LTL15523866456757278284.gal : 1 ms
[2021-05-10 07:49:27] [INFO ] Time to serialize properties into /tmp/LTL8113173763415472645.ltl : 4 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/LTL15523866456757278284.gal, -t, CGAL, -LTL, /tmp/LTL8113173763415472645.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/LTL15523866456757278284.gal -t CGAL -LTL /tmp/LTL8113173763415472645.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((ERKPP<=ERK)||(Raf1Star>=3))"))))
Formula 0 simplified : !GF"((ERKPP<=ERK)||(Raf1Star>=3))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 07:49:27] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:49:27] [INFO ] Applying decomposition
[2021-05-10 07:49:27] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16949794873455555812.txt, -o, /tmp/graph16949794873455555812.bin, -w, /tmp/graph16949794873455555812.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16949794873455555812.bin, -l, -1, -v, -w, /tmp/graph16949794873455555812.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 07:49:27] [INFO ] Decomposing Gal with order
[2021-05-10 07:49:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 07:49:27] [INFO ] Flatten gal took : 19 ms
[2021-05-10 07:49:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 07:49:27] [INFO ] Time to serialize gal into /tmp/LTL1701158388985052193.gal : 0 ms
[2021-05-10 07:49:27] [INFO ] Time to serialize properties into /tmp/LTL13296852273584345425.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/LTL1701158388985052193.gal, -t, CGAL, -LTL, /tmp/LTL13296852273584345425.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/LTL1701158388985052193.gal -t CGAL -LTL /tmp/LTL13296852273584345425.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu2.ERKPP<=gu2.ERK)||(gi0.gu1.Raf1Star>=3))"))))
Formula 0 simplified : !GF"((gu2.ERKPP<=gu2.ERK)||(gi0.gu1.Raf1Star>=3))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin16760892242787526819
[2021-05-10 07:49:27] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16760892242787526819
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16760892242787526819]
Compilation finished in 169 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16760892242787526819]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16760892242787526819]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-100000-13 finished in 15987 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))||F((p1||X(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:49:42] [INFO ] Implicit Places using invariants in 12 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:49:42] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:49:42] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:49:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:49:42] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ERK-PT-100000-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT 2 s0), p2:(GT 3 s6), p0:(LEQ s5 s6)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 113 ms.
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Knowledge obtained : [(NOT p1), p2, p0]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 66 ms.
Product exploration explored 100000 steps with 33333 reset in 78 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 11/11 transitions.
Graph (trivial) has 3 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2021-05-10 07:49:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 07:49:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:49:43] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 10/11 transitions.
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 146 ms.
[2021-05-10 07:49:43] [INFO ] Flatten gal took : 2 ms
[2021-05-10 07:49:43] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:49:43] [INFO ] Time to serialize gal into /tmp/LTL16638045188146792673.gal : 0 ms
[2021-05-10 07:49:43] [INFO ] Time to serialize properties into /tmp/LTL2818315112814456036.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/LTL16638045188146792673.gal, -t, CGAL, -LTL, /tmp/LTL2818315112814456036.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/LTL16638045188146792673.gal -t CGAL -LTL /tmp/LTL2818315112814456036.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(Raf1Star_RKIP_ERKPP<=RKIPP_RP)")))||(F(("(Raf1Star<2)")||(X(F("(RKIPP_RP<3)"))))))))
Formula 0 simplified : !X(XG"(Raf1Star_RKIP_ERKPP<=RKIPP_RP)" | F("(Raf1Star<2)" | XF"(RKIPP_RP<3)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 07:49:43] [INFO ] Flatten gal took : 2 ms
[2021-05-10 07:49:43] [INFO ] Applying decomposition
[2021-05-10 07:49:43] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15604645169740493222.txt, -o, /tmp/graph15604645169740493222.bin, -w, /tmp/graph15604645169740493222.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15604645169740493222.bin, -l, -1, -v, -w, /tmp/graph15604645169740493222.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 07:49:43] [INFO ] Decomposing Gal with order
[2021-05-10 07:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 07:49:43] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 07:49:43] [INFO ] Time to serialize gal into /tmp/LTL1529674994792307102.gal : 0 ms
[2021-05-10 07:49:43] [INFO ] Time to serialize properties into /tmp/LTL3699036299059988787.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/LTL1529674994792307102.gal, -t, CGAL, -LTL, /tmp/LTL3699036299059988787.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/LTL1529674994792307102.gal -t CGAL -LTL /tmp/LTL3699036299059988787.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(gu1.Raf1Star_RKIP_ERKPP<=gu1.RKIPP_RP)")))||(F(("(gu0.Raf1Star<2)")||(X(F("(gu1.RKIPP_RP<3)"))))))))
Formula 0 simplified : !X(XG"(gu1.Raf1Star_RKIP_ERKPP<=gu1.RKIPP_RP)" | F("(gu0.Raf1Star<2)" | XF"(gu1.RKIPP_RP<3)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin5978112205467022099
[2021-05-10 07:49:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5978112205467022099
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5978112205467022099]
Compilation finished in 107 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5978112205467022099]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X([]((LTLAPp0==true)))||<>(((LTLAPp1==true)||X(<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5978112205467022099]
LTSmin run took 312 ms.
FORMULA ERK-PT-100000-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-14 finished in 1772 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F((p0 U ((p0&&(p1 U (p2||G(p1))))||G(p0)))))&&(p3||G(F(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:49:44] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:49:44] [INFO ] Implicit Places using invariants in 12 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 10 cols
[2021-05-10 07:49:44] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 07:49:44] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2021-05-10 07:49:44] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 07:49:44] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ERK-PT-100000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(GT 2 s0), p0:(GT 3 s6), p2:(AND (GT 3 s7) (GT 1 s7)), p1:(GT 1 s7)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Stack based approach found an accepted trace after 1013 steps with 0 reset with depth 1014 and stack size 774 in 3 ms.
FORMULA ERK-PT-100000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-15 finished in 382 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-10 07:49:44] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin13967574480554976479
[2021-05-10 07:49:44] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2021-05-10 07:49:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 07:49:44] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2021-05-10 07:49:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 07:49:44] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2021-05-10 07:49:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 07:49:44] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13967574480554976479
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13967574480554976479]
[2021-05-10 07:49:44] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7981401376478873767.txt, -o, /tmp/graph7981401376478873767.bin, -w, /tmp/graph7981401376478873767.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7981401376478873767.bin, -l, -1, -v, -w, /tmp/graph7981401376478873767.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 07:49:44] [INFO ] Decomposing Gal with order
[2021-05-10 07:49:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 07:49:44] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-10 07:49:44] [INFO ] Flatten gal took : 3 ms
[2021-05-10 07:49:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 07:49:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality3421506339246858288.gal : 0 ms
[2021-05-10 07:49:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality17286385725636551874.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/LTLCardinality3421506339246858288.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17286385725636551874.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
ITS-tools command line returned an error code 134
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality3421506339246858288.gal -t CGAL -LTL /tmp/LTLCardinality17286385725636551874.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu2.ERKPP<=gu2.ERK)||(gi2.gu0.Raf1Star>=3))"))))
Formula 0 simplified : !GF"((gu2.ERKPP<=gu2.ERK)||(gi2.gu0.Raf1Star>=3))"
terminate called after throwing an instance of 'char const*'
[2021-05-10 07:49:44] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:49:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality4646458772396784043.gal : 0 ms
[2021-05-10 07:49:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality6559854912758315227.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/LTLCardinality4646458772396784043.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6559854912758315227.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/LTLCardinality4646458772396784043.gal -t CGAL -LTL /tmp/LTLCardinality6559854912758315227.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((ERKPP<=ERK)||(Raf1Star>=3))"))))
Formula 0 simplified : !GF"((ERKPP<=ERK)||(Raf1Star>=3))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 07:49:44] [INFO ] Flatten gal took : 2 ms
[2021-05-10 07:49:44] [INFO ] Input system was already deterministic with 11 transitions.
[2021-05-10 07:49:44] [INFO ] Transformed 11 places.
[2021-05-10 07:49:44] [INFO ] Transformed 11 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-10 07:49:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality10343678612610103714.gal : 0 ms
[2021-05-10 07:49:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality653478910137744600.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/LTLCardinality10343678612610103714.gal, -t, CGAL, -LTL, /tmp/LTLCardinality653478910137744600.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality10343678612610103714.gal -t CGAL -LTL /tmp/LTLCardinality653478910137744600.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((ERKPP<=ERK)||(Raf1Star>=3))"))))
Formula 0 simplified : !GF"((ERKPP<=ERK)||(Raf1Star>=3))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Compilation finished in 133 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13967574480554976479]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13967574480554976479]
LTSmin run took 7642 ms.
FORMULA ERK-PT-100000-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
BK_STOP 1620632993092
--------------------
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="ERK-PT-100000"
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 ERK-PT-100000, 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-162048875600596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-100000.tgz
mv ERK-PT-100000 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 '
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 ;