About the Execution of ITS-Tools for SwimmingPool-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 334.756 | 86049.00 | 33576.00 | 24581.90 | FFFTFTTTFFFTFFTF | 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.r254-tall-162106746400717.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SwimmingPool-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746400717
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-01-00
FORMULA_NAME SwimmingPool-PT-01-01
FORMULA_NAME SwimmingPool-PT-01-02
FORMULA_NAME SwimmingPool-PT-01-03
FORMULA_NAME SwimmingPool-PT-01-04
FORMULA_NAME SwimmingPool-PT-01-05
FORMULA_NAME SwimmingPool-PT-01-06
FORMULA_NAME SwimmingPool-PT-01-07
FORMULA_NAME SwimmingPool-PT-01-08
FORMULA_NAME SwimmingPool-PT-01-09
FORMULA_NAME SwimmingPool-PT-01-10
FORMULA_NAME SwimmingPool-PT-01-11
FORMULA_NAME SwimmingPool-PT-01-12
FORMULA_NAME SwimmingPool-PT-01-13
FORMULA_NAME SwimmingPool-PT-01-14
FORMULA_NAME SwimmingPool-PT-01-15
=== Now, execution of the tool begins
BK_START 1621268328222
Running Version 0
[2021-05-17 16:19:04] [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-17 16:19:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:19:04] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-17 16:19:04] [INFO ] Transformed 9 places.
[2021-05-17 16:19:04] [INFO ] Transformed 7 transitions.
[2021-05-17 16:19:04] [INFO ] Parsed PT model containing 9 places and 7 transitions in 51 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 16:19:04] [INFO ] Initial state test concluded for 1 properties.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 7 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:04] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 16:19:05] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:05] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:19:05] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 16:19:05] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 16:19:05] [INFO ] Flatten gal took : 16 ms
FORMULA SwimmingPool-PT-01-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-01-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:19:05] [INFO ] Flatten gal took : 3 ms
[2021-05-17 16:19:05] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 178 steps, including 0 resets, run visited all 12 properties in 2 ms. (steps per millisecond=89 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:05] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:05] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA SwimmingPool-PT-01-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-01 finished in 264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((p1||F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:05] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:05] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:05] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-17 16:19:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 138 ms :[false, false, (AND p0 (NOT p1)), p0]
Running random walk in product with property : SwimmingPool-PT-01-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s5 1), p1:(AND (GEQ s6 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 189 ms.
Product exploration explored 100000 steps with 33333 reset in 105 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[false, false, (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 33333 reset in 74 ms.
Product exploration explored 100000 steps with 33333 reset in 67 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 92 ms :[false, false, (AND p0 (NOT p1)), p0]
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:19:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:06] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:19:06] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Product exploration explored 100000 steps with 33333 reset in 169 ms.
[2021-05-17 16:19:06] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:19:06] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:19:06] [INFO ] Time to serialize gal into /tmp/LTL8145144848578320047.gal : 1 ms
[2021-05-17 16:19:06] [INFO ] Time to serialize properties into /tmp/LTL6158583850627702203.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/LTL8145144848578320047.gal, -t, CGAL, -LTL, /tmp/LTL6158583850627702203.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/LTL8145144848578320047.gal -t CGAL -LTL /tmp/LTL6158583850627702203.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(Dressed>=1)")||(X(("((Out>=1)&&(Dress>=1))")||(F("(Dressed<1)")))))))
Formula 0 simplified : !X("(Dressed>=1)" | X("((Out>=1)&&(Dress>=1))" | F"(Dressed<1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
56 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.571907,27364,1,0,7,55084,19,0,313,62078,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-01-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-01-03 finished in 1960 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&(!p1||F(((p1&&X(F(p0)))||G(F(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:07] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:07] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:07] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-01-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p0:(GEQ s4 1), p1:(OR (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-01-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-04 finished in 171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(p1)||p0)) U X((!p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:07] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:07] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 16:19:07] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:07] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-01-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s2 1), p2:(AND (GEQ s0 1) (GEQ s7 1)), p0:(OR (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Knowledge obtained : [p1, (NOT p2), p0]
Stuttering acceptance computed with spot in 136 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 128 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:19:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:08] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
[2021-05-17 16:19:08] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:19:08] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:19:08] [INFO ] Time to serialize gal into /tmp/LTL14653143309985333534.gal : 0 ms
[2021-05-17 16:19:08] [INFO ] Time to serialize properties into /tmp/LTL17963905490706393760.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/LTL14653143309985333534.gal, -t, CGAL, -LTL, /tmp/LTL17963905490706393760.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/LTL14653143309985333534.gal -t CGAL -LTL /tmp/LTL17963905490706393760.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(("((InBath<1)||(Cabins<1))")||(X("(Undress<1)"))))U(X(("(Undress>=1)")||(F("((Entered>=1)&&(Cabins>=1))"))))))
Formula 0 simplified : !(G("((InBath<1)||(Cabins<1))" | X"(Undress<1)") U X("(Undress>=1)" | F"((Entered>=1)&&(Cabins>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
57 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.58633,28468,1,0,6,55084,24,0,319,62078,11
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-01-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-01-05 finished in 1819 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((!p0||X(F((!p1&&G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:09] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:19:09] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:09] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:09] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut7525850481220083717.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 20066 ms :[false, (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-01-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p0 p1) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s7 1)), p1:(GEQ s4 1), p2:(AND (OR (LT s3 1) (LT s7 1)) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10243 reset in 190 ms.
Product exploration explored 100000 steps with 10270 reset in 165 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 109 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 10208 reset in 90 ms.
Product exploration explored 100000 steps with 10282 reset in 227 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 108 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2))]
Support contains 4 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:19:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:30] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 11546 reset in 222 ms.
Product exploration explored 100000 steps with 11530 reset in 160 ms.
[2021-05-17 16:19:31] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:19:31] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:19:31] [INFO ] Time to serialize gal into /tmp/LTL7201918193700992593.gal : 0 ms
[2021-05-17 16:19:31] [INFO ] Time to serialize properties into /tmp/LTL4199640430817414638.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/LTL7201918193700992593.gal, -t, CGAL, -LTL, /tmp/LTL4199640430817414638.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/LTL7201918193700992593.gal -t CGAL -LTL /tmp/LTL4199640430817414638.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F(("(Dress<1)")&&(G("(((InBath<1)||(Cabins<1))&&(Undress<1))")))))||("((InBath>=1)&&(Cabins>=1))")))))
Formula 0 simplified : !XF("((InBath>=1)&&(Cabins>=1))" | XF("(Dress<1)" & G"(((InBath<1)||(Cabins<1))&&(Undress<1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
232 unique states visited
0 strongly connected components in search stack
259 transitions explored
42 items max in DFS search stack
79 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.79808,30816,1,0,1256,74505,37,516,328,82068,3209
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-01-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-01-06 finished in 22438 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||X(X((!p1 U (p2||G(!p1))))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:31] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:31] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:31] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:31] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), true]
Running random walk in product with property : SwimmingPool-PT-01-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s6 1), p2:(AND (OR (LT s0 1) (LT s7 1)) (LT s5 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, 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 11 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-01-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-08 finished in 183 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(F(p1))||p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:32] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:32] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-01-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1209 reset in 102 ms.
Stack based approach found an accepted trace after 140 steps with 0 reset with depth 141 and stack size 141 in 1 ms.
FORMULA SwimmingPool-PT-01-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-09 finished in 300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(X(!p2)&&F(p0)&&F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:32] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 16:19:32] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-01-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s7 1)), p0:(OR (LT s3 1) (LT s7 1)), p2:(LT s2 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 11115 reset in 188 ms.
Stack based approach found an accepted trace after 146 steps with 16 reset with depth 18 and stack size 18 in 1 ms.
FORMULA SwimmingPool-PT-01-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-10 finished in 364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((!p0||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:32] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:32] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-01-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s4 1), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 19074 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:19:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:52] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
[2021-05-17 16:19:52] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:19:52] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:19:52] [INFO ] Time to serialize gal into /tmp/LTL8039644224677285307.gal : 1 ms
[2021-05-17 16:19:52] [INFO ] Time to serialize properties into /tmp/LTL11509036010473112352.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/LTL8039644224677285307.gal, -t, CGAL, -LTL, /tmp/LTL11509036010473112352.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/LTL8039644224677285307.gal -t CGAL -LTL /tmp/LTL11509036010473112352.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(Dress<1)")||(G(F("(Out<1)")))))))
Formula 0 simplified : !XF("(Dress<1)" | GF"(Out<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
57 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.585604,27536,1,0,6,55084,21,0,310,62078,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-01-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SwimmingPool-PT-01-11 finished in 20520 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||F(p1)) U G((!p2&&F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:53] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-17 16:19:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:53] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR p2 p1), (NOT p1), p1, (AND (NOT p1) p2 p0)]
Running random walk in product with property : SwimmingPool-PT-01-12 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LT s6 1), p1:(OR (LT s1 1) (LT s8 1)), p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 19898 reset in 76 ms.
Stack based approach found an accepted trace after 38376 steps with 7574 reset with depth 91 and stack size 91 in 33 ms.
FORMULA SwimmingPool-PT-01-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-12 finished in 309 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:53] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:53] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-17 16:19:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:53] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-01-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1)), p1:(OR (GEQ s4 1) (AND (GEQ s2 1) (GEQ s6 1)))], nbAcceptance=2, 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 132 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA SwimmingPool-PT-01-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-13 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((!p0||F(p1)))||X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:53] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:53] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:53] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-01-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s8 1)), p1:(GEQ s4 1), p2:(OR (GEQ s4 1) (AND (GEQ s3 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10222 reset in 79 ms.
Product exploration explored 100000 steps with 10255 reset in 89 ms.
Knowledge obtained : [p0, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 10264 reset in 78 ms.
Product exploration explored 100000 steps with 10303 reset in 89 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:19:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:54] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 12428 reset in 93 ms.
Product exploration explored 100000 steps with 12433 reset in 101 ms.
[2021-05-17 16:19:54] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:19:54] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:19:54] [INFO ] Time to serialize gal into /tmp/LTL16469496423976314009.gal : 0 ms
[2021-05-17 16:19:54] [INFO ] Time to serialize properties into /tmp/LTL8496119576780423402.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/LTL16469496423976314009.gal, -t, CGAL, -LTL, /tmp/LTL8496119576780423402.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/LTL16469496423976314009.gal -t CGAL -LTL /tmp/LTL8496119576780423402.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(("((WaitBag>=1)&&(Bags>=1))")||(F("(Dress>=1)"))))||(X(F("((Dress>=1)||((InBath>=1)&&(Cabins>=1)))")))))
Formula 0 simplified : !(G("((WaitBag>=1)&&(Bags>=1))" | F"(Dress>=1)") | XF"((Dress>=1)||((InBath>=1)&&(Cabins>=1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
83 unique states visited
0 strongly connected components in search stack
82 transitions explored
42 items max in DFS search stack
77 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.782326,29680,1,0,1429,70495,35,388,324,74674,3264
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-01-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-01-14 finished in 1810 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:55] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:55] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:55] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:19:55] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:19:55] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:19:55] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, p0, p0]
Running random walk in product with property : SwimmingPool-PT-01-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-01-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-01-15 finished in 95 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621268414271
--------------------
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="SwimmingPool-PT-01"
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 SwimmingPool-PT-01, 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 r254-tall-162106746400717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-01.tgz
mv SwimmingPool-PT-01 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 ;