About the Execution of ITS-Tools for RobotManipulation-PT-00001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 426.455 | 13042.00 | 27090.00 | 472.80 | FFFFFFTFFFFFFFFF | 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.r197-smll-162089451700013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RobotManipulation-PT-00001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089451700013
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.4K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RobotManipulation-PT-00001-00
FORMULA_NAME RobotManipulation-PT-00001-01
FORMULA_NAME RobotManipulation-PT-00001-02
FORMULA_NAME RobotManipulation-PT-00001-03
FORMULA_NAME RobotManipulation-PT-00001-04
FORMULA_NAME RobotManipulation-PT-00001-05
FORMULA_NAME RobotManipulation-PT-00001-06
FORMULA_NAME RobotManipulation-PT-00001-07
FORMULA_NAME RobotManipulation-PT-00001-08
FORMULA_NAME RobotManipulation-PT-00001-09
FORMULA_NAME RobotManipulation-PT-00001-10
FORMULA_NAME RobotManipulation-PT-00001-11
FORMULA_NAME RobotManipulation-PT-00001-12
FORMULA_NAME RobotManipulation-PT-00001-13
FORMULA_NAME RobotManipulation-PT-00001-14
FORMULA_NAME RobotManipulation-PT-00001-15
=== Now, execution of the tool begins
BK_START 1620946934579
Running Version 0
[2021-05-13 23:02:17] [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-13 23:02:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:02:17] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-13 23:02:17] [INFO ] Transformed 15 places.
[2021-05-13 23:02:17] [INFO ] Transformed 11 transitions.
[2021-05-13 23:02:17] [INFO ] Parsed PT model containing 15 places and 11 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 23:02:17] [INFO ] Initial state test concluded for 3 properties.
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 11 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:02:17] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-13 23:02:17] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:02:17] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 23:02:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-13 23:02:17] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 23:02:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-13 23:02:17] [INFO ] Flatten gal took : 25 ms
[2021-05-13 23:02:18] [INFO ] Flatten gal took : 7 ms
[2021-05-13 23:02:18] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 2418 steps, including 0 resets, run visited all 20 properties in 27 ms. (steps per millisecond=89 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 18 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-13 23:02:18] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 23:02:18] [INFO ] Implicit Places using invariants in 39 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
[2021-05-13 23:02:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-13 23:02:18] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 23:02:18] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 8/15 places, 8/11 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 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
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 4 place count 6 transition count 6
Applied a total of 4 rules in 4 ms. Remains 6 /8 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-13 23:02:18] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 23:02:18] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-13 23:02:18] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 23:02:18] [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.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00001-00 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:(LT s5 1), p1:(GEQ s4 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 328 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA RobotManipulation-PT-00001-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-00 finished in 704 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 23:02:18] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:18] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-13 23:02:18] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:18] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 23:02:18] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00001-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(LT s9 1), p0:(AND (GEQ s10 1) (GEQ s11 1)), p1:(OR (LT s10 1) (LT s11 1) (LT s6 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13315 reset in 270 ms.
Stack based approach found an accepted trace after 103 steps with 14 reset with depth 9 and stack size 9 in 1 ms.
FORMULA RobotManipulation-PT-00001-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-01 finished in 645 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0||F(G(p1)))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-13 23:02:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 23:02:19] [INFO ] Implicit Places using invariants in 22 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:19] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 23:02:19] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 4 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 23:02:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 23:02:19] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 23:02:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 23:02:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : RobotManipulation-PT-00001-02 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s8 1)), p0:(LT s8 1), p1:(OR (LT s3 1) (LT s5 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 0 reset in 107 ms.
Stack based approach found an accepted trace after 371 steps with 124 reset with depth 25 and stack size 25 in 2 ms.
FORMULA RobotManipulation-PT-00001-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-02 finished in 411 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 3 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:19] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 23:02:19] [INFO ] Implicit Places using invariants in 32 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 23:02:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:19] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 23:02:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00001-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4906 reset in 106 ms.
Stack based approach found an accepted trace after 69 steps with 4 reset with depth 22 and stack size 22 in 0 ms.
FORMULA RobotManipulation-PT-00001-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-03 finished in 302 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((p1&&X((!p0 U (p2||G(!p0)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:20] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 23:02:20] [INFO ] Implicit Places using invariants in 26 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-13 23:02:20] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 23:02:20] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-13 23:02:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 23:02:20] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-00001-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s12 1)), p1:(OR (LT s1 1) (LT s5 1)), p2:(AND (LT s10 1) (OR (LT s11 1) (LT s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14907 reset in 165 ms.
Stack based approach found an accepted trace after 22 steps with 2 reset with depth 14 and stack size 14 in 1 ms.
FORMULA RobotManipulation-PT-00001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-04 finished in 496 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-13 23:02:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 23:02:20] [INFO ] Implicit Places using invariants in 35 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 23:02:20] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 23:02:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 5 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-13 23:02:20] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 23:02:20] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-13 23:02:20] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 23:02:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : RobotManipulation-PT-00001-05 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, 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}]], initial=2, aps=[p1:(LT s9 1), p0:(OR (LT s9 1) (LT s5 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 13334 reset in 66 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA RobotManipulation-PT-00001-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-05 finished in 333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(X(p1))))], workingDir=/home/mcc/execution]
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:21] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 23:02:21] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:21] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 23:02:21] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 23:02:21] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00001-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s10 1)) (AND (GEQ s12 1) (GEQ s13 1))), p1:(OR (GEQ s11 1) (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s7 1) (GEQ s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 86 ms.
Product exploration explored 100000 steps with 33333 reset in 155 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 74 ms.
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Support contains 7 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 11/11 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 14 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-13 23:02:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 23:02:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Product exploration explored 100000 steps with 33333 reset in 343 ms.
Product exploration explored 100000 steps with 33333 reset in 249 ms.
[2021-05-13 23:02:23] [INFO ] Flatten gal took : 4 ms
[2021-05-13 23:02:23] [INFO ] Flatten gal took : 3 ms
[2021-05-13 23:02:23] [INFO ] Time to serialize gal into /tmp/LTL6638684933810298984.gal : 2 ms
[2021-05-13 23:02:23] [INFO ] Time to serialize properties into /tmp/LTL2374959086703317079.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/LTL6638684933810298984.gal, -t, CGAL, -LTL, /tmp/LTL2374959086703317079.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/LTL6638684933810298984.gal -t CGAL -LTL /tmp/LTL2374959086703317079.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(((p_rdy>=1)&&(access>=1))||((initialized>=1)&&(p_i2>=1)))"))U(X(X("(((p_i1>=1)||((move>=1)&&(r_active>=1)))||((p_rdy>=1)&&(access>=1)))")))))
Formula 0 simplified : !(G"(((p_rdy>=1)&&(access>=1))||((initialized>=1)&&(p_i2>=1)))" U XX"(((p_i1>=1)||((move>=1)&&(r_active>=1)))||((p_rdy>=1)&&(access>=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
0 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.036591,17992,1,0,7,969,18,0,339,548,14
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00001-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RobotManipulation-PT-00001-06 finished in 2510 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(!p0) U p1))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
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 6 place count 11 transition count 9
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 10 place count 9 transition count 7
Applied a total of 10 rules in 3 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-13 23:02:23] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 23:02:23] [INFO ] Implicit Places using invariants in 52 ms returned [3, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
[2021-05-13 23:02:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-05-13 23:02:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 23:02:23] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Starting structural reductions, iteration 1 : 6/15 places, 7/11 transitions.
Graph (trivial) has 3 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 5 ms. Remains 4 /6 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-13 23:02:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 23:02:23] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-13 23:02:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 23:02:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-00001-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1)), p0:(LT s3 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-07 finished in 582 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((G(!p0)&&X(!p1))||(X((p3 U (G(p3)||p4)))&&p2)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 5 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:24] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-13 23:02:24] [INFO ] Implicit Places using invariants in 19 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-13 23:02:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 23:02:24] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-13 23:02:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 23:02:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (AND p0 (NOT p3) (NOT p4)) (AND p1 (NOT p3) (NOT p4)) (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p0 (NOT p3) (NOT p4)) (AND p1 (NOT p3) (NOT p4)) (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, (AND (NOT p0) p1), (AND p0 p2), (AND (NOT p4) (NOT p3)), (AND p0 p2 (NOT p4) (NOT p3)), (AND (NOT p4) (NOT p3) (NOT p0) p1)]
Running random walk in product with property : RobotManipulation-PT-00001-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 p2 (NOT p4) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p4) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p4) p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p4) p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3) p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p4) p3 p1), acceptance={} source=7 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s12 1)), p2:(AND (OR (LT s1 1) (LT s5 1)) (OR (LT s0 1) (LT s4 1))), p1:(GEQ s6 1), p4:(OR (LT s11 1) (LT s12 1)), p3:(OR (LT s0 1) (LT s4 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-08 finished in 498 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-13 23:02:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 23:02:24] [INFO ] Implicit Places using invariants in 24 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 23:02:24] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-13 23:02:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 23:02:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 23:02:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00001-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s8 1), p1:(OR (GEQ s7 1) (GEQ s5 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][false, false, false]]
Product exploration explored 100000 steps with 4888 reset in 158 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA RobotManipulation-PT-00001-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-09 finished in 450 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
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 10 transition count 8
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 12 place count 8 transition count 6
Applied a total of 12 rules in 4 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-13 23:02:25] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 21 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
[2021-05-13 23:02:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-13 23:02:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 6/15 places, 6/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5 transition count 5
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5 transition count 5
Applied a total of 3 rules in 2 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-13 23:02:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-13 23:02:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00001-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-10 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 13 transition count 10
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 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 4 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-13 23:02:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 23 ms returned [4, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
[2021-05-13 23:02:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-13 23:02:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 9/15 places, 9/11 transitions.
Graph (trivial) has 5 edges and 9 vertex of which 3 / 9 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 7 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 3 place count 6 transition count 6
Applied a total of 3 rules in 8 ms. Remains 6 /9 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-13 23:02:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-13 23:02:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00001-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-11 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 30 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00001-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s5 1), p1:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-12 finished in 284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 3 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-13 23:02:25] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 14 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
[2021-05-13 23:02:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 23:02:25] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 9/15 places, 8/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
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 8 transition count 6
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 7 transition count 6
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 6 place count 6 transition count 5
Applied a total of 6 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00001-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s5 1), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 26 steps with 5 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-13 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F((p1||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:25] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 30 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 23:02:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 23:02:25] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : RobotManipulation-PT-00001-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LT s7 1), p1:(GEQ s5 1), p2:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00001-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-14 finished in 207 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0)&&F(G((p1 U !p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-13 23:02:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 23:02:26] [INFO ] Implicit Places using invariants in 16 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 23:02:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-13 23:02:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 23:02:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR p0 p2), (OR p0 p2), true, p2, p2]
Running random walk in product with property : RobotManipulation-PT-00001-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(OR (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s9 1), p2:(OR (LT s0 1) (LT s4 1)), p1:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5877 steps with 43 reset in 9 ms.
FORMULA RobotManipulation-PT-00001-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00001-15 finished in 228 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620946947621
--------------------
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="RobotManipulation-PT-00001"
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 RobotManipulation-PT-00001, 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 r197-smll-162089451700013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00001.tgz
mv RobotManipulation-PT-00001 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 ;