About the Execution of ITS-Tools for GPPP-PT-C0001N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 665.907 | 53695.00 | 71907.00 | 532.40 | FFFFTFFFFTFFTTFF | 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.r102-smll-162075331200181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C0001N0000000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331200181
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 164K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 19:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-00
FORMULA_NAME GPPP-PT-C0001N0000000100-01
FORMULA_NAME GPPP-PT-C0001N0000000100-02
FORMULA_NAME GPPP-PT-C0001N0000000100-03
FORMULA_NAME GPPP-PT-C0001N0000000100-04
FORMULA_NAME GPPP-PT-C0001N0000000100-05
FORMULA_NAME GPPP-PT-C0001N0000000100-06
FORMULA_NAME GPPP-PT-C0001N0000000100-07
FORMULA_NAME GPPP-PT-C0001N0000000100-08
FORMULA_NAME GPPP-PT-C0001N0000000100-09
FORMULA_NAME GPPP-PT-C0001N0000000100-10
FORMULA_NAME GPPP-PT-C0001N0000000100-11
FORMULA_NAME GPPP-PT-C0001N0000000100-12
FORMULA_NAME GPPP-PT-C0001N0000000100-13
FORMULA_NAME GPPP-PT-C0001N0000000100-14
FORMULA_NAME GPPP-PT-C0001N0000000100-15
=== Now, execution of the tool begins
BK_START 1621198175806
Running Version 0
[2021-05-16 20:49:39] [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-16 20:49:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:49:39] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-16 20:49:39] [INFO ] Transformed 33 places.
[2021-05-16 20:49:39] [INFO ] Transformed 22 transitions.
[2021-05-16 20:49:39] [INFO ] Parsed PT model containing 33 places and 22 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 20:49:39] [INFO ] Initial state test concluded for 3 properties.
FORMULA GPPP-PT-C0001N0000000100-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 17 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:49:39] [INFO ] Computed 13 place invariants in 21 ms
[2021-05-16 20:49:39] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:49:39] [INFO ] Computed 13 place invariants in 4 ms
[2021-05-16 20:49:39] [INFO ] Implicit Places using invariants in 67 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:39] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:49:39] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:40] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 20:49:40] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-16 20:49:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 20:49:40] [INFO ] Flatten gal took : 45 ms
FORMULA GPPP-PT-C0001N0000000100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:49:40] [INFO ] Flatten gal took : 22 ms
[2021-05-16 20:49:40] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 107 steps, including 0 resets, run visited all 20 properties in 4 ms. (steps per millisecond=26 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&(p1 U X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:40] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 20:49:40] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:40] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 20:49:40] [INFO ] Implicit Places using invariants in 84 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 89 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:40] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 20:49:40] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:40] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-16 20:49:40] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s13 1), p1:(GEQ s15 1), p2:(OR (LT s4 1) (LT s24 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 3 reset in 3 ms.
FORMULA GPPP-PT-C0001N0000000100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-00 finished in 924 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 32 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-16 20:49:41] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:49:41] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-16 20:49:41] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 20:49:41] [INFO ] Implicit Places using invariants in 57 ms returned [0, 2, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
[2021-05-16 20:49:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-16 20:49:41] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 20:49:41] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 20/32 places, 15/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-16 20:49:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-16 20:49:41] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 20:49:41] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-01 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 s0 1) (GEQ s13 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 8 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-01 finished in 339 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G((p0||X(p1))) U p2) U (p3||X((!p1 U p4)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:41] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:49:41] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:41] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-16 20:49:42] [INFO ] Implicit Places using invariants in 59 ms returned [0, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:49:42] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:49:42] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:49:42] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:49:42] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 639 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4) (NOT p1)), (AND (NOT p2) (NOT p4)), (AND (NOT p4) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p2), (NOT p4)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-02 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p4)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p4) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p4) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p4) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p4) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p4) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p4) p1), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p4) p1), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p4) p1), acceptance={0} source=3 dest: 8}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=8 dest: 5}, { cond=(NOT p2), acceptance={0} source=8 dest: 6}, { cond=(NOT p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p4) p1), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p4) (NOT p1)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p3:(AND (GEQ s1 2) (GEQ s12 1) (GEQ s24 1)), p2:(AND (GEQ s6 1) (GEQ s7 1)), p0:(GEQ s16 1), p4:(AND (GEQ s0 1) (GEQ s11 1) (GEQ s1 2) (GEQ s12 1) (GEQ s24 1)), p1:(OR (LT s0 1) (LT s11 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, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-02 finished in 924 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G((p1&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:42] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:49:42] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:42] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:49:42] [INFO ] Implicit Places using invariants in 76 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:49:42] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:49:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:49:42] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-03 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=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(OR (LT s11 1) (LT s23 3)), p0:(AND (GEQ s14 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-03 finished in 403 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
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 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
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 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 14
Applied a total of 17 rules in 12 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2021-05-16 20:49:43] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2021-05-16 20:49:43] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 20:49:43] [INFO ] Implicit Places using invariants in 53 ms returned [0, 2, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
[2021-05-16 20:49:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 20:49:43] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-16 20:49:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 20:49:43] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-05 finished in 274 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
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 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
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 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 14
Applied a total of 17 rules in 20 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2021-05-16 20:49:43] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2021-05-16 20:49:43] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-16 20:49:43] [INFO ] Implicit Places using invariants in 45 ms returned [0, 2, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
[2021-05-16 20:49:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 20:49:43] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-16 20:49:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 20:49:43] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : GPPP-PT-C0001N0000000100-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s6 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 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-07 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(X(!p1))&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:43] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:43] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-16 20:49:43] [INFO ] Implicit Places using invariants in 58 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:43] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:49:43] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:49:43] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, p1, (NOT p2), p1]
Running random walk in product with property : GPPP-PT-C0001N0000000100-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s8 1) (LT s26 7)), p2:(GEQ s8 1), p1:(OR (LT s11 1) (LT s22 3))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 3 reset in 2 ms.
FORMULA GPPP-PT-C0001N0000000100-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-08 finished in 498 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:44] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:49:44] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:49:44] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:49:44] [INFO ] Implicit Places using invariants in 55 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:49:44] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:49:44] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:49:44] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:49:44] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s0 1) (LT s1 1) (LT s10 1) (LT s29 1)), p0:(OR (LT s9 1) (LT s10 1) (LT s28 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 542 ms.
Product exploration explored 100000 steps with 33333 reset in 207 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 22
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 2 place count 30 transition count 23
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 30 transition count 23
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 27 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 27 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 27 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 13 rules in 6 ms. Remains 27 /30 variables (removed 3) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 27 cols
[2021-05-16 20:49:46] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:49:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
[2021-05-16 20:49:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 27 cols
[2021-05-16 20:49:46] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:49:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/30 places, 20/22 transitions.
Product exploration explored 100000 steps with 33333 reset in 482 ms.
Product exploration explored 100000 steps with 33333 reset in 458 ms.
[2021-05-16 20:49:47] [INFO ] Flatten gal took : 7 ms
[2021-05-16 20:49:47] [INFO ] Flatten gal took : 7 ms
[2021-05-16 20:49:47] [INFO ] Time to serialize gal into /tmp/LTL13884296984533523937.gal : 58 ms
[2021-05-16 20:49:47] [INFO ] Time to serialize properties into /tmp/LTL15589572489074959603.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/LTL13884296984533523937.gal, -t, CGAL, -LTL, /tmp/LTL15589572489074959603.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/LTL13884296984533523937.gal -t CGAL -LTL /tmp/LTL15589572489074959603.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((S7P<1)||(GAP<1))||(c1<7))")||(F("((((Pi<1)||(NADplus<1))||(GAP<1))||(c2<1))"))))))
Formula 0 simplified : !XX("(((S7P<1)||(GAP<1))||(c1<7))" | F"((((Pi<1)||(NADplus<1))||(GAP<1))||(c2<1))")
Detected timeout of ITS tools.
[2021-05-16 20:50:02] [INFO ] Flatten gal took : 4 ms
[2021-05-16 20:50:02] [INFO ] Applying decomposition
[2021-05-16 20:50:02] [INFO ] Flatten gal took : 4 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/graph12045684036099792778.txt, -o, /tmp/graph12045684036099792778.bin, -w, /tmp/graph12045684036099792778.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/graph12045684036099792778.bin, -l, -1, -v, -w, /tmp/graph12045684036099792778.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 20:50:02] [INFO ] Decomposing Gal with order
[2021-05-16 20:50:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 20:50:02] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-16 20:50:02] [INFO ] Flatten gal took : 39 ms
[2021-05-16 20:50:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 20:50:02] [INFO ] Time to serialize gal into /tmp/LTL2129364218041336735.gal : 2 ms
[2021-05-16 20:50:02] [INFO ] Time to serialize properties into /tmp/LTL12086568618700793945.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/LTL2129364218041336735.gal, -t, CGAL, -LTL, /tmp/LTL12086568618700793945.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/LTL2129364218041336735.gal -t CGAL -LTL /tmp/LTL12086568618700793945.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((u9.S7P<1)||(i1.u2.GAP<1))||(i1.u10.c1<7))")||(F("((((i3.u7.Pi<1)||(i2.u6.NADplus<1))||(i1.u2.GAP<1))||(i1.u10.c2<1))"))))))
Formula 0 simplified : !XX("(((u9.S7P<1)||(i1.u2.GAP<1))||(i1.u10.c1<7))" | F"((((i3.u7.Pi<1)||(i2.u6.NADplus<1))||(i1.u2.GAP<1))||(i1.u10.c2<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14962433059072554473
[2021-05-16 20:50:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14962433059072554473
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/ltsmin14962433059072554473]
Compilation finished in 628 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14962433059072554473]
Link finished in 65 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X((<>((LTLAPp1==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14962433059072554473]
LTSmin run took 238 ms.
FORMULA GPPP-PT-C0001N0000000100-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000000100-09 finished in 34292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
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 2 with 5 rules applied. Total rules applied 10 place count 26 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
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 2 with 2 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 10 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-16 20:50:18] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:50:18] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-16 20:50:18] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:50:18] [INFO ] Implicit Places using invariants in 56 ms returned [0, 2, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
[2021-05-16 20:50:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-16 20:50:18] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 20:50:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 20/32 places, 15/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-16 20:50:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-16 20:50:18] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-16 20:50:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 7) (GEQ s12 7))], 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 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-10 finished in 262 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p1)&&G((!p2&&X(p3)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:50:18] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:50:18] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:50:18] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:50:18] [INFO ] Implicit Places using invariants in 53 ms returned [0, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:50:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:50:18] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-16 20:50:18] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:50:19] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p3) p2), (OR (NOT p3) (NOT p0) p1 p2), (OR (NOT p3) p1 p2), (OR (NOT p3) (NOT p0) p1 p2), true]
Running random walk in product with property : GPPP-PT-C0001N0000000100-11 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 0}, { cond=(OR p2 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(OR p2 (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LT s14 1), p3:(GEQ s17 1), p0:(AND (LT s17 1) (OR (LT s1 2) (LT s12 1) (LT s24 1))), p1:(AND (GEQ s0 1) (GEQ s22 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-11 finished in 507 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:50:19] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:50:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:50:19] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:50:19] [INFO ] Implicit Places using invariants in 53 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:50:19] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:50:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:50:19] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:50:19] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s5 1) (LT s9 1)) (OR (LT s4 1) (LT s25 1))), p0:(OR (LT s4 1) (LT s25 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 50000 reset in 222 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 9 edges and 28 vertex of which 2 / 28 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 27 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 27 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 27 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 24 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 24 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 24 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 22 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 22 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 22 transition count 16
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 21 rules in 9 ms. Remains 22 /28 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-16 20:50:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:50:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
[2021-05-16 20:50:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-16 20:50:20] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 20:50:20] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/28 places, 16/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 462 ms.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
[2021-05-16 20:50:21] [INFO ] Flatten gal took : 4 ms
[2021-05-16 20:50:21] [INFO ] Flatten gal took : 3 ms
[2021-05-16 20:50:21] [INFO ] Time to serialize gal into /tmp/LTL8851807230266774141.gal : 1 ms
[2021-05-16 20:50:21] [INFO ] Time to serialize properties into /tmp/LTL4438114562560094854.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/LTL8851807230266774141.gal, -t, CGAL, -LTL, /tmp/LTL4438114562560094854.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/LTL8851807230266774141.gal -t CGAL -LTL /tmp/LTL4438114562560094854.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((Ru5P<1)||(a2<1))")U((G("((Ru5P<1)||(a2<1))"))||("(((Xu5P<1)||(E4P<1))&&((Ru5P<1)||(a2<1)))"))))))
Formula 0 simplified : !XF("((Ru5P<1)||(a2<1))" U ("(((Xu5P<1)||(E4P<1))&&((Ru5P<1)||(a2<1)))" | G"((Ru5P<1)||(a2<1))"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
544 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,5.46044,98336,1,0,44,377625,78,25,1481,429950,60
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000100-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000000100-13 finished in 8053 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0&&X((G(F(p1))||G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:50:27] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:50:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:50:27] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:50:27] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:50:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:50:27] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 28 cols
[2021-05-16 20:50:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:50:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 182 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000100-14 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s13 1), p1:(AND (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1491 reset in 227 ms.
Stack based approach found an accepted trace after 62 steps with 1 reset with depth 36 and stack size 36 in 1 ms.
FORMULA GPPP-PT-C0001N0000000100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-14 finished in 580 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 21
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 28 transition count 20
Applied a total of 6 rules in 5 ms. Remains 28 /32 variables (removed 4) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-16 20:50:27] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 20:50:27] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-16 20:50:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:50:28] [INFO ] Implicit Places using invariants in 32 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
[2021-05-16 20:50:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 27 cols
[2021-05-16 20:50:28] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-16 20:50:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 27/32 places, 20/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2021-05-16 20:50:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 27 cols
[2021-05-16 20:50:28] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:50:28] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 27/32 places, 20/22 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000100-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=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s15 1), p1:(OR (AND (GEQ s0 1) (GEQ s2 1) (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s1 1) (GEQ s9 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 0 reset in 190 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA GPPP-PT-C0001N0000000100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000100-15 finished in 526 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621198229501
--------------------
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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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 r102-smll-162075331200181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 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 ;