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-162089451700037.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-00010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089451700037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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 23K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.8K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:06 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-00010-00
FORMULA_NAME RobotManipulation-PT-00010-01
FORMULA_NAME RobotManipulation-PT-00010-02
FORMULA_NAME RobotManipulation-PT-00010-03
FORMULA_NAME RobotManipulation-PT-00010-04
FORMULA_NAME RobotManipulation-PT-00010-05
FORMULA_NAME RobotManipulation-PT-00010-06
FORMULA_NAME RobotManipulation-PT-00010-07
FORMULA_NAME RobotManipulation-PT-00010-08
FORMULA_NAME RobotManipulation-PT-00010-09
FORMULA_NAME RobotManipulation-PT-00010-10
FORMULA_NAME RobotManipulation-PT-00010-11
FORMULA_NAME RobotManipulation-PT-00010-12
FORMULA_NAME RobotManipulation-PT-00010-13
FORMULA_NAME RobotManipulation-PT-00010-14
FORMULA_NAME RobotManipulation-PT-00010-15

=== Now, execution of the tool begins

BK_START 1620950815013

Running Version 0
[2021-05-14 00:06:58] [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-14 00:06:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 00:06:58] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-14 00:06:58] [INFO ] Transformed 15 places.
[2021-05-14 00:06:58] [INFO ] Transformed 11 transitions.
[2021-05-14 00:06:58] [INFO ] Parsed PT model containing 15 places and 11 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 00:06:58] [INFO ] Initial state test concluded for 2 properties.
FORMULA RobotManipulation-PT-00010-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 24 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 00:06:58] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-14 00:06:58] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 00:06:58] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 00:06:58] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 00:06:58] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 00:06:58] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-14 00:06:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 00:06:59] [INFO ] Flatten gal took : 28 ms
FORMULA RobotManipulation-PT-00010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 00:06:59] [INFO ] Flatten gal took : 6 ms
[2021-05-14 00:06:59] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 444 steps, including 0 resets, run visited all 17 properties in 5 ms. (steps per millisecond=88 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((X(G(p1)) U (G(p2) U p3))&&p0)))], 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 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 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 00:06:59] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-14 00:06:59] [INFO ] Implicit Places using invariants in 43 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 00:06:59] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 00:06:59] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 00:06:59] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 00:06:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 720 ms :[(OR (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : RobotManipulation-PT-00010-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2 p1) (AND (NOT p3) p2 p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=1 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p3) p2 p1)), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p3) p2 p1)), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={1} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={0, 1} source=3 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(NOT p3), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={1} source=5 dest: 1}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 5}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=6 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=6 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=7 dest: 1}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1)), p3:(GEQ s8 1), p2:(OR (LT s0 1) (LT s4 1) (LT s5 1)), p1:(OR (LT s0 1) (LT s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10904 reset in 632 ms.
Stack based approach found an accepted trace after 491 steps with 55 reset with depth 9 and stack size 9 in 2 ms.
FORMULA RobotManipulation-PT-00010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-00 finished in 1560 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(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 1 places :
Implicit places reduction removed 1 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 2 rules applied. Total rules applied 2 place count 14 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 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 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 5 place count 12 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 7 place count 11 transition count 8
Applied a total of 7 rules in 16 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-14 00:07:00] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-14 00:07:00] [INFO ] Implicit Places using invariants in 35 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
[2021-05-14 00:07:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-14 00:07:00] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-14 00:07:00] [INFO ] Dead Transitions using invariants and state equation in 29 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 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 7 transition count 6
Applied a total of 4 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-14 00:07:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:00] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-14 00:07:00] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-14 00:07:01] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/15 places, 6/11 transitions.
[2021-05-14 00:07:01] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00010-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s3 1), p0:(OR (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 15211 reset in 234 ms.
Product exploration explored 100000 steps with 15164 reset in 303 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15191 reset in 164 ms.
Product exploration explored 100000 steps with 15232 reset in 232 ms.
[2021-05-14 00:07:02] [INFO ] Flatten gal took : 3 ms
[2021-05-14 00:07:02] [INFO ] Flatten gal took : 3 ms
[2021-05-14 00:07:02] [INFO ] Time to serialize gal into /tmp/LTL12120605457046239304.gal : 1 ms
[2021-05-14 00:07:02] [INFO ] Time to serialize properties into /tmp/LTL14982668220046259909.ltl : 2 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/LTL12120605457046239304.gal, -t, CGAL, -LTL, /tmp/LTL14982668220046259909.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/LTL12120605457046239304.gal -t CGAL -LTL /tmp/LTL14982668220046259909.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((initialized<1)||(p_i2<1))"))||(F("(p_rdy>=1)"))))
Formula 0 simplified : !(G"((initialized<1)||(p_i2<1))" | F"(p_rdy>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
44 unique states visited
0 strongly connected components in search stack
45 transitions explored
24 items max in DFS search stack
18 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.225836,19964,1,0,1708,18327,28,464,295,20150,3417
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00010-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RobotManipulation-PT-00010-01 finished in 1993 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 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-14 00:07:02] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 00:07:02] [INFO ] Implicit Places using invariants in 21 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 00:07:02] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 00:07:02] [INFO ] Dead Transitions using invariants and state equation in 21 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 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 00:07:02] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-14 00:07:02] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 00:07:02] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 00:07:02] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 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 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ 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 RobotManipulation-PT-00010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-02 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!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 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 11 transition count 8
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 9 place count 10 transition count 7
Applied a total of 9 rules in 3 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-14 00:07:03] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 00:07:03] [INFO ] Implicit Places using invariants in 39 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
[2021-05-14 00:07:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-14 00:07:03] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:03] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 8/15 places, 7/11 transitions.
Graph (trivial) has 3 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 5
Applied a total of 3 rules in 7 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-14 00:07:03] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:03] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-14 00:07:03] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-14 00:07:03] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 28 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 33 ms :[p0]
Running random walk in product with property : RobotManipulation-PT-00010-03 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24988 reset in 116 ms.
Product exploration explored 100000 steps with 24987 reset in 136 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 31 ms :[p0]
Product exploration explored 100000 steps with 24968 reset in 89 ms.
Product exploration explored 100000 steps with 25065 reset in 237 ms.
[2021-05-14 00:07:03] [INFO ] Flatten gal took : 2 ms
[2021-05-14 00:07:03] [INFO ] Flatten gal took : 6 ms
[2021-05-14 00:07:03] [INFO ] Time to serialize gal into /tmp/LTL10595670446692680294.gal : 2 ms
[2021-05-14 00:07:03] [INFO ] Time to serialize properties into /tmp/LTL4517163213111953075.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/LTL10595670446692680294.gal, -t, CGAL, -LTL, /tmp/LTL4517163213111953075.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/LTL10595670446692680294.gal -t CGAL -LTL /tmp/LTL4517163213111953075.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((initialized>=1)&&(p_i2>=1))")))
Formula 0 simplified : !F"((initialized>=1)&&(p_i2>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
12 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.129874,17304,1,0,111,7165,20,23,251,6562,223
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00010-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RobotManipulation-PT-00010-03 finished in 965 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G((F(p1)&&F(G(p0)))))))], 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 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-14 00:07:04] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 00:07:04] [INFO ] Implicit Places using invariants in 28 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 00:07:04] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 00:07:04] [INFO ] Dead Transitions using invariants and state equation in 31 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-14 00:07:04] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-14 00:07:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00010-04 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=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s12 1)), p1:(OR (LT s1 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 223 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 72 in 1 ms.
FORMULA RobotManipulation-PT-00010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-04 finished in 578 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 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 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 00:07:04] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 00:07:04] [INFO ] Implicit Places using invariants in 33 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-14 00:07:04] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 00:07:04] [INFO ] Dead Transitions using invariants and state equation in 35 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 3 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 00:07:04] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 00:07:04] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 00:07:04] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 00:07:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 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 162 ms :[p0, true, true, true]
Running random walk in product with property : RobotManipulation-PT-00010-05 automaton TGBA [mat=[[{ cond=p0, 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=[p0:(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 4332 reset in 125 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RobotManipulation-PT-00010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-05 finished in 427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1&&G(p0)))))], 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-14 00:07:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 00:07:05] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 00:07:05] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-14 00:07:05] [INFO ] Dead Transitions using invariants and state equation in 31 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-14 00:07:05] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 00:07:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00010-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s6 1) (LT s9 1)), p1:(OR (AND (GEQ s6 1) (GEQ s9 1)) (AND (GEQ s11 1) (GEQ s12 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 5 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-06 finished in 269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0||G(F(!p1))||(!p1&&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-14 00:07:05] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 00:07:05] [INFO ] Implicit Places using invariants in 34 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-14 00:07:05] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-14 00:07:05] [INFO ] Dead Transitions using invariants and state equation in 31 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 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 00:07:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 00:07:05] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 00:07:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 00:07:05] [INFO ] Implicit Places using invariants and state equation in 26 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 : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-00010-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s9 1), p1:(LT s5 1), p2:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Product exploration explored 100000 steps with 25000 reset in 111 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 10 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 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 10 transition count 10
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 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 11/10 (removed -1) transitions.
[2021-05-14 00:07:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2021-05-14 00:07:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 00:07:07] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/10 transitions.
Product exploration explored 100000 steps with 25000 reset in 207 ms.
Product exploration explored 100000 steps with 25000 reset in 190 ms.
[2021-05-14 00:07:07] [INFO ] Flatten gal took : 2 ms
[2021-05-14 00:07:07] [INFO ] Flatten gal took : 1 ms
[2021-05-14 00:07:07] [INFO ] Time to serialize gal into /tmp/LTL17158555750397297533.gal : 1 ms
[2021-05-14 00:07:07] [INFO ] Time to serialize properties into /tmp/LTL11635258746870364683.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/LTL17158555750397297533.gal, -t, CGAL, -LTL, /tmp/LTL11635258746870364683.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/LTL17158555750397297533.gal -t CGAL -LTL /tmp/LTL11635258746870364683.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((("(p_i1>=1)")||(G(F("(r_moving>=1)"))))||(("(r_moving>=1)")&&(G("(p_sc>=1)")))))))))
Formula 0 simplified : !XXXF("(p_i1>=1)" | GF"(r_moving>=1)" | ("(r_moving>=1)" & G"(p_sc>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
13 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.155908,18828,1,0,8,10637,33,0,418,9732,18
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00010-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RobotManipulation-PT-00010-07 finished in 2645 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 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 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 00:07:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 00:07:07] [INFO ] Implicit Places using invariants in 17 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 00:07:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 00:07:07] [INFO ] Dead Transitions using invariants and state equation in 25 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 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 00:07:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 00:07:07] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 00:07:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 00:07:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 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 79 ms :[true, p0, p0]
Running random walk in product with property : RobotManipulation-PT-00010-08 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:(OR (LT s0 1) (LT s4 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 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-08 finished in 165 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 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-14 00:07:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 00:07:08] [INFO ] Implicit Places using invariants in 21 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 00:07:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 00:07:08] [INFO ] Dead Transitions using invariants and state equation in 18 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-14 00:07:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:08] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 00:07:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 00:07:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 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 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s5 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 11/11 places, 10/10 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 11 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 11/10 (removed -1) transitions.
[2021-05-14 00:07:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 00:07:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/10 transitions.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
[2021-05-14 00:07:09] [INFO ] Flatten gal took : 2 ms
[2021-05-14 00:07:09] [INFO ] Flatten gal took : 2 ms
[2021-05-14 00:07:09] [INFO ] Time to serialize gal into /tmp/LTL270415114240735572.gal : 1 ms
[2021-05-14 00:07:09] [INFO ] Time to serialize properties into /tmp/LTL5149439805662121891.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/LTL270415114240735572.gal, -t, CGAL, -LTL, /tmp/LTL5149439805662121891.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/LTL270415114240735572.gal -t CGAL -LTL /tmp/LTL5149439805662121891.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((move<1)||(r_active<1))||(off<1))"))))
Formula 0 simplified : !XF"(((move<1)||(r_active<1))||(off<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
47 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.482465,21292,1,0,6,33711,20,0,458,27738,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00010-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RobotManipulation-PT-00010-09 finished in 1995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 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 2 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-14 00:07:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants in 17 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 18 ms to find 3 implicit places.
[2021-05-14 00:07:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-14 00:07:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 5/15 places, 6/11 transitions.
Graph (trivial) has 4 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 0 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 1 ms. Remains 3 /5 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 00:07:10] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 00:07:10] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-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:(LT s1 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 5 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-10 finished in 137 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p2)&&p1)))], 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 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-14 00:07:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
[2021-05-14 00:07:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 00:07:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 13 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 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 0 with 2 rules applied. Total rules applied 6 place count 10 transition count 8
Applied a total of 6 rules in 2 ms. Remains 10 /13 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-14 00:07:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-14 00:07:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-00010-12 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s6 1)), p0:(GEQ s9 1), p2:(OR (AND (GEQ s2 1) (GEQ s6 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 262 steps with 0 reset in 2 ms.
FORMULA RobotManipulation-PT-00010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-12 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((X(p1)&&p0))))], 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 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-14 00:07:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants in 13 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 00:07:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Dead Transitions using invariants and state equation in 18 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-14 00:07:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 00:07:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 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 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00010-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1)), p1:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5256 reset in 195 ms.
Stack based approach found an accepted trace after 87 steps with 3 reset with depth 7 and stack size 7 in 1 ms.
FORMULA RobotManipulation-PT-00010-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-13 finished in 407 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U G(p1))||G(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 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-14 00:07:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 00:07:10] [INFO ] Implicit Places using invariants in 18 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 00:07:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 00:07:10] [INFO ] Dead Transitions using invariants and state equation in 18 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-14 00:07:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 00:07:10] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s8 1)), p1:(GEQ s7 1), p2:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3011 reset in 114 ms.
Stack based approach found an accepted trace after 34 steps with 1 reset with depth 12 and stack size 12 in 0 ms.
FORMULA RobotManipulation-PT-00010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-15 finished in 513 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620950832722

--------------------
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-00010"
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-00010, 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-162089451700037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00010.tgz
mv RobotManipulation-PT-00010 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;