About the Execution of ITS-Tools for FMS-PT-00002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
343.012 | 6471.00 | 12248.00 | 131.00 | TFFFFTFFFFFTTFFF | 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-162048875800733.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-00002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875800733
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 118K 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.4K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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-00002-00
FORMULA_NAME FMS-PT-00002-01
FORMULA_NAME FMS-PT-00002-02
FORMULA_NAME FMS-PT-00002-03
FORMULA_NAME FMS-PT-00002-04
FORMULA_NAME FMS-PT-00002-05
FORMULA_NAME FMS-PT-00002-06
FORMULA_NAME FMS-PT-00002-07
FORMULA_NAME FMS-PT-00002-08
FORMULA_NAME FMS-PT-00002-09
FORMULA_NAME FMS-PT-00002-10
FORMULA_NAME FMS-PT-00002-11
FORMULA_NAME FMS-PT-00002-12
FORMULA_NAME FMS-PT-00002-13
FORMULA_NAME FMS-PT-00002-14
FORMULA_NAME FMS-PT-00002-15
=== Now, execution of the tool begins
BK_START 1620659571129
Running Version 0
[2021-05-10 15:12:52] [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 15:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:12:52] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-10 15:12:52] [INFO ] Transformed 22 places.
[2021-05-10 15:12:52] [INFO ] Transformed 20 transitions.
[2021-05-10 15:12:52] [INFO ] Parsed PT model containing 22 places and 20 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:12:52] [INFO ] Initial state test concluded for 3 properties.
FORMULA FMS-PT-00002-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 15:12:52] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 15:12:52] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:12:52] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-10 15:12:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:12:52] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 15:12:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 15:12:53] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-10 15:12:53] [INFO ] Flatten gal took : 20 ms
FORMULA FMS-PT-00002-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:12:53] [INFO ] Flatten gal took : 5 ms
[2021-05-10 15:12:53] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 104 steps, including 0 resets, run visited all 15 properties in 3 ms. (steps per millisecond=34 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(F(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 15:12:53] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 15:12:53] [INFO ] Implicit Places using invariants in 26 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2021-05-10 15:12:53] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-10 15:12:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2021-05-10 15:12:53] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-10 15:12:53] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FMS-PT-00002-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s8 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00002-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-01 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||(X(p1) U ((!p0&&X(p1))||X(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 15:12:53] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:12:53] [INFO ] Implicit Places using invariants in 16 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2021-05-10 15:12:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 15:12:53] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2021-05-10 15:12:53] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : FMS-PT-00002-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(GEQ s18 1), p1:(OR (LT s9 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00002-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-02 finished in 205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)||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.
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 1 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 9
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 23 place count 9 transition count 9
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 3 with 2 rules applied. Total rules applied 25 place count 8 transition count 8
Applied a total of 25 rules in 13 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 15:12:53] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:53] [INFO ] Implicit Places using invariants in 26 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
[2021-05-10 15:12:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 15:12:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 15:12:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 7/22 places, 8/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-10 15:12:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 15:12:53] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-10 15:12:53] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FMS-PT-00002-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00002-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-04 finished in 144 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], 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 15:12:53] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:12:53] [INFO ] Implicit Places using invariants in 16 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
// Phase 1: matrix 20 rows 21 cols
[2021-05-10 15:12:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 15:12:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 21 cols
[2021-05-10 15:12:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 15:12:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/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-00002-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s4 1) (GEQ s11 1) (AND (GEQ s5 1) (GEQ s7 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 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 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 21 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 21 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 21 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 18 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 18 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 19
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 16 rules in 5 ms. Remains 18 /21 variables (removed 3) and now considering 19/20 (removed 1) transitions.
[2021-05-10 15:12:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 18 cols
[2021-05-10 15:12:54] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-10 15:12:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/21 places, 19/20 transitions.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Product exploration explored 100000 steps with 50000 reset in 297 ms.
[2021-05-10 15:12:55] [INFO ] Flatten gal took : 3 ms
[2021-05-10 15:12:55] [INFO ] Flatten gal took : 2 ms
[2021-05-10 15:12:55] [INFO ] Time to serialize gal into /tmp/LTL6066666477839372048.gal : 1 ms
[2021-05-10 15:12:55] [INFO ] Time to serialize properties into /tmp/LTL1400007333627549772.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/LTL6066666477839372048.gal, -t, CGAL, -LTL, /tmp/LTL1400007333627549772.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/LTL6066666477839372048.gal -t CGAL -LTL /tmp/LTL1400007333627549772.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((P1>=1)||(P2M2>=1))||((P1wM1>=1)&&(M1>=1)))"))))
Formula 0 simplified : !XF"(((P1>=1)||(P2M2>=1))||((P1wM1>=1)&&(M1>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.021069,16280,1,0,6,1745,20,0,467,724,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FMS-PT-00002-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FMS-PT-00002-05 finished in 1694 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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.
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 15:12:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 15:12:55] [INFO ] Implicit Places using invariants in 17 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2021-05-10 15:12:55] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-10 15:12:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2021-05-10 15:12:55] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 15:12:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00002-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00002-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-06 finished in 129 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p1))&&G(p2)&&p0)))], 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 15:12:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:12:55] [INFO ] Implicit Places using invariants in 14 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2021-05-10 15:12:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:55] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2021-05-10 15:12:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:55] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : FMS-PT-00002-07 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s13 1) (OR (LT s9 1) (LT s15 1))), p2:(LT s13 1), p1:(GEQ s17 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 1772 reset in 181 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA FMS-PT-00002-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-07 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], 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.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 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 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 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 4 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 4 with 2 rules applied. Total rules applied 21 place count 10 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 10 transition count 10
Applied a total of 22 rules in 5 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 15:12:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 15:12:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-10 15:12:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 15:12:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00002-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s7 1)) (AND (GEQ s6 1) (OR (LT s3 1) (LT s5 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00002-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-08 finished in 88 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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.
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 1 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.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 7 transition count 7
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 26 place count 6 transition count 7
Applied a total of 26 rules in 4 ms. Remains 6 /22 variables (removed 16) and now considering 7/20 (removed 13) transitions.
[2021-05-10 15:12:56] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:12:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-10 15:12:56] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:12:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-10 15:12:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 15:12:56] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:12:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00002-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00002-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-09 finished in 93 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G((p1 U 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.
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 7 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 16 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 13 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 21 place count 10 transition count 10
Applied a total of 21 rules in 2 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
[2021-05-10 15:12:56] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-10 15:12:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants in 18 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
[2021-05-10 15:12:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 15:12:56] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 15:12:56] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-10 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 9/22 places, 10/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-10 15:12:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 15:12:56] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 15:12:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FMS-PT-00002-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1), p2:(GEQ s5 1), p1:(GEQ s8 1)], 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 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00002-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-10 finished in 126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&G(p1))))], 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.
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 5 places and 0 transitions.
Graph (trivial) has 7 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 14 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 14 transition count 13
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 15 place count 13 transition count 13
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 3 with 2 rules applied. Total rules applied 17 place count 12 transition count 12
Applied a total of 17 rules in 4 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 15:12:56] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 15:12:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-10 15:12:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2021-05-10 15:12:56] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FMS-PT-00002-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (AND (GEQ s4 1) (GEQ s6 1)) (GEQ s11 1)) (GEQ s2 1)), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00002-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-13 finished in 134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&F(G((p0 U !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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 5 places and 0 transitions.
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 7 rules applied. Total rules applied 11 place count 17 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 15 transition count 13
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 15 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 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 11 transition count 10
Applied a total of 21 rules in 2 ms. Remains 11 /22 variables (removed 11) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-10 15:12:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-10 15:12:56] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-10 15:12:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-10 15:12:56] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 15:12:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) p1), p1, p1]
Running random walk in product with property : FMS-PT-00002-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1)), p1:(OR (LT s6 1) (LT s8 1))], 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 4624 reset in 131 ms.
Stack based approach found an accepted trace after 13 steps with 2 reset with depth 2 and stack size 2 in 0 ms.
FORMULA FMS-PT-00002-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-14 finished in 291 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620659577600
--------------------
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-00002"
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-00002, 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-162048875800733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00002.tgz
mv FMS-PT-00002 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 ;