About the Execution of ITS-Tools for GPPP-PT-C0001N0000001000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
371.388 | 8923.00 | 16201.00 | 400.90 | TFTFFTFFFFFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r165-tall-167838850900796.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is GPPP-PT-C0001N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838850900796
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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-C0001N0000001000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679590215552
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000001000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 16:50:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 16:50:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:50:17] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-23 16:50:17] [INFO ] Transformed 33 places.
[2023-03-23 16:50:17] [INFO ] Transformed 22 transitions.
[2023-03-23 16:50:17] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 16:50:17] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-23 16:50:17] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
[2023-03-23 16:50:17] [INFO ] Invariant cache hit.
[2023-03-23 16:50:17] [INFO ] Implicit Places using invariants in 45 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 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.
Finished structural reductions in LTL mode , in 2 iterations and 228 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 21 out of 32 places after structural reductions.
[2023-03-23 16:50:18] [INFO ] Flatten gal took : 16 ms
[2023-03-23 16:50:18] [INFO ] Flatten gal took : 6 ms
[2023-03-23 16:50:18] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 129 steps, including 0 resets, run visited all 13 properties in 26 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 11 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 22 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-23 16:50:18] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 16:50:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-23 16:50:18] [INFO ] Invariant cache hit.
[2023-03-23 16:50:18] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 12]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 14/22 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 1 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 13
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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 15 transition count 11
Applied a total of 6 rules in 3 ms. Remains 15 /18 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-23 16:50:18] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 16:50:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-23 16:50:18] [INFO ] Invariant cache hit.
[2023-03-23 16:50:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 16:50:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/32 places, 11/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 15/32 places, 11/22 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s9 3))], 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]]
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-02 finished in 924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
Applied a total of 15 rules in 4 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2023-03-23 16:50:19] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-23 16:50:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-23 16:50:19] [INFO ] Invariant cache hit.
[2023-03-23 16:50:19] [INFO ] Implicit Places using invariants in 54 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 15/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 20/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s9 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 10 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-03 finished in 154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-23 16:50:19] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-23 16:50:19] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-23 16:50:19] [INFO ] Invariant cache hit.
[2023-03-23 16:50:19] [INFO ] Implicit Places using invariants in 43 ms returned [0, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, 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: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (LT s0 7) (LT s21 7)) (LT s20 1)), p0:(OR (LT s5 1) (LT s25 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 92 steps with 0 reset in 3 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-04 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U X(p2))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 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 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
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 4 place count 30 transition count 20
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 9 place count 27 transition count 18
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 12 place count 25 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 24 transition count 16
Applied a total of 14 rules in 5 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2023-03-23 16:50:19] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 16:50:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-23 16:50:19] [INFO ] Invariant cache hit.
[2023-03-23 16:50:19] [INFO ] Implicit Places using invariants in 31 ms returned [0, 2, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 21/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1), p2:(AND (GEQ s2 1) (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]]
Product exploration explored 100000 steps with 11567 reset in 135 ms.
Product exploration explored 100000 steps with 11548 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 16 rows 21 cols
[2023-03-23 16:50:20] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-23 16:50:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 16:50:20] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 16:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:50:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 16:50:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:50:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 16:50:20] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-23 16:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:50:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-23 16:50:20] [INFO ] Computed and/alt/rep : 15/33/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 16:50:20] [INFO ] Added : 14 causal constraints over 3 iterations in 33 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-23 16:50:20] [INFO ] Invariant cache hit.
[2023-03-23 16:50:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-23 16:50:20] [INFO ] Invariant cache hit.
[2023-03-23 16:50:20] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-23 16:50:20] [INFO ] Invariant cache hit.
[2023-03-23 16:50:20] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-23 16:50:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 16:50:20] [INFO ] Invariant cache hit.
[2023-03-23 16:50:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 21/21 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-23 16:50:21] [INFO ] Invariant cache hit.
[2023-03-23 16:50:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-23 16:50:21] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-23 16:50:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 16:50:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 16:50:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 16:50:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 16:50:21] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-23 16:50:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 16:50:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-23 16:50:21] [INFO ] Computed and/alt/rep : 15/33/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 16:50:21] [INFO ] Added : 14 causal constraints over 3 iterations in 38 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 11574 reset in 153 ms.
Product exploration explored 100000 steps with 11538 reset in 179 ms.
Built C files in :
/tmp/ltsmin14949793039096256668
[2023-03-23 16:50:21] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2023-03-23 16:50:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:50:21] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2023-03-23 16:50:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:50:21] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2023-03-23 16:50:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 16:50:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14949793039096256668
Running compilation step : cd /tmp/ltsmin14949793039096256668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 153 ms.
Running link step : cd /tmp/ltsmin14949793039096256668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14949793039096256668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6762167707704648713.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-05 finished in 2517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((F(p1)&&F(p2)))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 1 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 1 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 6 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2023-03-23 16:50:22] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-23 16:50:22] [INFO ] Invariant cache hit.
[2023-03-23 16:50:22] [INFO ] Implicit Places using invariants in 36 ms returned [0, 2, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 15/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 20/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s16 2)), p0:(AND (GEQ s7 1) (GEQ s14 3)), p2:(AND (GEQ s0 7) (GEQ s12 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-08 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 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 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
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 4 place count 30 transition count 20
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 9 place count 27 transition count 18
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 12 place count 25 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 24 transition count 16
Applied a total of 14 rules in 11 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2023-03-23 16:50:22] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-23 16:50:22] [INFO ] Invariant cache hit.
[2023-03-23 16:50:22] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1, 2, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 16/22 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 1 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 17 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 2 with 2 rules applied. Total rules applied 8 place count 16 transition count 12
Applied a total of 8 rules in 7 ms. Remains 16 /20 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-23 16:50:22] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-23 16:50:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-23 16:50:22] [INFO ] Invariant cache hit.
[2023-03-23 16:50:22] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 21 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-09 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 10 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-23 16:50:22] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-23 16:50:22] [INFO ] Invariant cache hit.
[2023-03-23 16:50:22] [INFO ] Implicit Places using invariants in 23 ms returned [0, 2, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 14/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ 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 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-11 finished in 113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(G(p0))))||X((X(p1) U p2))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-23 16:50:22] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-23 16:50:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-23 16:50:22] [INFO ] Invariant cache hit.
[2023-03-23 16:50:22] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s9 1)), p0:(LT s15 1), p1:(AND (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 54 in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-14 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||X((G(p1) U (p0&&G(p1)))))) U !p2)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-23 16:50:23] [INFO ] Invariant cache hit.
[2023-03-23 16:50:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-23 16:50:23] [INFO ] Invariant cache hit.
[2023-03-23 16:50:23] [INFO ] Implicit Places using invariants in 34 ms returned [1, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 94 ms :[p2, p2, (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s14 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-15 finished in 498 ms.
All properties solved by simple procedures.
Total runtime 6184 ms.
BK_STOP 1679590224475
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-C0001N0000001000"
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-5348"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0001N0000001000, 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 r165-tall-167838850900796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000001000.tgz
mv GPPP-PT-C0001N0000001000 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 ;