About the Execution of ITS-Tools for FMS-PT-02000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 594.399 | 38081.00 | 46599.00 | 409.00 | FFFFFTFFFFTFFFFF | 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-162048875900805.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 FMS-PT-02000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875900805
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-02000-00
FORMULA_NAME FMS-PT-02000-01
FORMULA_NAME FMS-PT-02000-02
FORMULA_NAME FMS-PT-02000-03
FORMULA_NAME FMS-PT-02000-04
FORMULA_NAME FMS-PT-02000-05
FORMULA_NAME FMS-PT-02000-06
FORMULA_NAME FMS-PT-02000-07
FORMULA_NAME FMS-PT-02000-08
FORMULA_NAME FMS-PT-02000-09
FORMULA_NAME FMS-PT-02000-10
FORMULA_NAME FMS-PT-02000-11
FORMULA_NAME FMS-PT-02000-12
FORMULA_NAME FMS-PT-02000-13
FORMULA_NAME FMS-PT-02000-14
FORMULA_NAME FMS-PT-02000-15
=== Now, execution of the tool begins
BK_START 1620667864174
Running Version 0
[2021-05-10 17:31:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 17:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 17:31:05] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-10 17:31:05] [INFO ] Transformed 22 places.
[2021-05-10 17:31:05] [INFO ] Transformed 20 transitions.
[2021-05-10 17:31:05] [INFO ] Parsed PT model containing 22 places and 20 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 17:31:05] [INFO ] Initial state test concluded for 2 properties.
Support contains 21 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 17:31:06] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-10 17:31:06] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 17:31:06] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-10 17:31:06] [INFO ] Flatten gal took : 19 ms
FORMULA FMS-PT-02000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-02000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-02000-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-02000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 17:31:06] [INFO ] Flatten gal took : 5 ms
[2021-05-10 17:31:06] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 20113 steps, including 0 resets, run visited all 21 properties in 17 ms. (steps per millisecond=1183 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:31:06] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:06] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:06] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FMS-PT-02000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p2:(AND (LT s12 1) (OR (LT s5 1) (LT s7 1))), p1:(OR (LT s5 1) (LT s7 1))], 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 17823 reset in 257 ms.
Stack based approach found an accepted trace after 116 steps with 9 reset with depth 9 and stack size 9 in 1 ms.
FORMULA FMS-PT-02000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-00 finished in 538 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1)&&((p0 U X(p1))||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:06] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:31:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:06] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:31:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p2)]
Running random walk in product with property : FMS-PT-02000-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s0 1), p0:(GEQ s3 1), p2:(OR (GEQ s14 1) (GEQ s0 1))], 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, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-01 finished in 322 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(X(p0)) U (p0||G(p1)))&&(!p1 U (p2||G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:07] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:31:07] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-10 17:31:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2))), true, (NOT p0), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FMS-PT-02000-03 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 1}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s18 1)), p2:(AND (LT s0 1) (OR (LT s2 1) (LT s18 1))), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-03 finished in 290 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:07] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:31:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-02000-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(GEQ s6 1), p0:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-06 finished in 219 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 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 13 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 10 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 8 transition count 8
Applied a total of 25 rules in 14 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-10 17:31:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 17:31:07] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-10 17:31:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:31:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-10 17:31:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-10 17:31:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:31:07] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-02000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-07 finished in 104 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F((p1||(X(!p0)&&p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:07] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:07] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1))]
Running random walk in product with property : FMS-PT-02000-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s16 1), p2:(AND (GEQ s5 1) (GEQ s7 1)), p0:(OR (LT s5 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 17894 reset in 149 ms.
Stack based approach found an accepted trace after 1499 steps with 267 reset with depth 17 and stack size 17 in 3 ms.
FORMULA FMS-PT-02000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-08 finished in 328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:08] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:08] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:08] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-02000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5870 reset in 111 ms.
Stack based approach found an accepted trace after 56 steps with 4 reset with depth 8 and stack size 8 in 1 ms.
FORMULA FMS-PT-02000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-09 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(!p0))||(F(!p0)&&X((p1||F(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:08] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:08] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:08] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:08] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 105 ms :[p0, p0, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : FMS-PT-02000-10 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s21 1), p1:(LT s19 1), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 22 transition count 20
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 21 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 21 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 5 ms. Remains 21 /22 variables (removed 1) and now considering 19/20 (removed 1) transitions.
[2021-05-10 17:31:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 21 cols
[2021-05-10 17:31:09] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:09] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 19/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 221 ms.
[2021-05-10 17:31:09] [INFO ] Flatten gal took : 3 ms
[2021-05-10 17:31:09] [INFO ] Flatten gal took : 2 ms
[2021-05-10 17:31:09] [INFO ] Time to serialize gal into /tmp/LTL6152211301930660856.gal : 1 ms
[2021-05-10 17:31:09] [INFO ] Time to serialize properties into /tmp/LTL9448973863860335891.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/LTL6152211301930660856.gal, -t, CGAL, -LTL, /tmp/LTL9448973863860335891.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/LTL6152211301930660856.gal -t CGAL -LTL /tmp/LTL9448973863860335891.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(P2s<1)")))||((F("(P2s<1)"))&&(X(("(P2d<1)")||(F(G("(P1d>=1)")))))))))
Formula 0 simplified : !F(GF"(P2s<1)" | (F"(P2s<1)" & X("(P2d<1)" | FG"(P1d>=1)")))
Detected timeout of ITS tools.
[2021-05-10 17:31:24] [INFO ] Flatten gal took : 5 ms
[2021-05-10 17:31:24] [INFO ] Applying decomposition
[2021-05-10 17:31:24] [INFO ] Flatten gal took : 2 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/graph3579478411244286476.txt, -o, /tmp/graph3579478411244286476.bin, -w, /tmp/graph3579478411244286476.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/graph3579478411244286476.bin, -l, -1, -v, -w, /tmp/graph3579478411244286476.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 17:31:24] [INFO ] Decomposing Gal with order
[2021-05-10 17:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 17:31:24] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 17:31:25] [INFO ] Flatten gal took : 31 ms
[2021-05-10 17:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 17:31:25] [INFO ] Time to serialize gal into /tmp/LTL1439402889175134074.gal : 152 ms
[2021-05-10 17:31:25] [INFO ] Time to serialize properties into /tmp/LTL587396873276511607.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/LTL1439402889175134074.gal, -t, CGAL, -LTL, /tmp/LTL587396873276511607.ltl, -c, -stutter-deadlock], 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/LTL1439402889175134074.gal -t CGAL -LTL /tmp/LTL587396873276511607.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(i1.u3.P2s<1)")))||((F("(i1.u3.P2s<1)"))&&(X(("(i1.u8.P2d<1)")||(F(G("(i0.u0.P1d>=1)")))))))))
Formula 0 simplified : !F(GF"(i1.u3.P2s<1)" | (F"(i1.u3.P2s<1)" & X("(i1.u8.P2d<1)" | FG"(i0.u0.P1d>=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5058600842803348573
[2021-05-10 17:31:40] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5058600842803348573
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/ltsmin5058600842803348573]
Compilation finished in 195 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5058600842803348573]
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)))||(<>((LTLAPp0==true))&&X(((LTLAPp1==true)||<>([]((LTLAPp2==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5058600842803348573]
LTSmin run took 274 ms.
FORMULA FMS-PT-02000-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-02000-10 finished in 32291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(p1)||p0))&&X((p2 U p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:40] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:40] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:40] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:40] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3)]
Running random walk in product with property : FMS-PT-02000-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s10 1)) (LT s3 1)), p1:(AND (GEQ s8 1) (GEQ s10 1)), p3:(AND (GEQ s1 1) (GEQ s8 1) (GEQ s10 1) (GEQ s1 1)), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-11 finished in 180 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 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 10 edges and 13 vertex of which 6 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 9 transition count 12
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 6 transition count 7
Applied a total of 26 rules in 3 ms. Remains 6 /22 variables (removed 16) and now considering 7/20 (removed 13) transitions.
[2021-05-10 17:31:40] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:31:40] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 17:31:40] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-10 17:31:40] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:31:40] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 17:31:40] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-10 17:31:40] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 17:31:40] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:31:40] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 17:31:40] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-02000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-13 finished in 77 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||X((F(G(p1))||(p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:40] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:40] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:40] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:31:41] [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.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:31:41] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:31:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : FMS-PT-02000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s7 1)), p1:(AND (GEQ s10 1) (GEQ s17 1)), p3:(AND (GEQ s12 1) (GEQ s5 1) (GEQ s7 1)), p2:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Stack based approach found an accepted trace after 308 steps with 0 reset with depth 309 and stack size 309 in 2 ms.
FORMULA FMS-PT-02000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-14 finished in 294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 8 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 16 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 16 transition count 13
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 14 place count 14 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 21 place count 10 transition count 10
Applied a total of 21 rules in 3 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
[2021-05-10 17:31:41] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-10 17:31:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:31:41] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-10 17:31:41] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-10 17:31:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:31:41] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-10 17:31:41] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-10 17:31:41] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-10 17:31:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:31:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-02000-15 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}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s8 1)), p1:(AND (GEQ s2 1) (GEQ s4 1))], 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 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-15 finished in 140 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620667902255
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="FMS-PT-02000"
export BK_EXAMINATION="LTLFireability"
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 FMS-PT-02000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875900805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-02000.tgz
mv FMS-PT-02000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;