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

--------------------
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 154K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.7K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 4.0K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 14:07 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-00100-00
FORMULA_NAME RobotManipulation-PT-00100-01
FORMULA_NAME RobotManipulation-PT-00100-02
FORMULA_NAME RobotManipulation-PT-00100-03
FORMULA_NAME RobotManipulation-PT-00100-04
FORMULA_NAME RobotManipulation-PT-00100-05
FORMULA_NAME RobotManipulation-PT-00100-06
FORMULA_NAME RobotManipulation-PT-00100-07
FORMULA_NAME RobotManipulation-PT-00100-08
FORMULA_NAME RobotManipulation-PT-00100-09
FORMULA_NAME RobotManipulation-PT-00100-10
FORMULA_NAME RobotManipulation-PT-00100-11
FORMULA_NAME RobotManipulation-PT-00100-12
FORMULA_NAME RobotManipulation-PT-00100-13
FORMULA_NAME RobotManipulation-PT-00100-14
FORMULA_NAME RobotManipulation-PT-00100-15

=== Now, execution of the tool begins

BK_START 1620964000242

Running Version 0
[2021-05-14 03:46:43] [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 03:46:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 03:46:43] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-14 03:46:43] [INFO ] Transformed 15 places.
[2021-05-14 03:46:43] [INFO ] Transformed 11 transitions.
[2021-05-14 03:46:43] [INFO ] Parsed PT model containing 15 places and 11 transitions in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 03:46:43] [INFO ] Initial state test concluded for 4 properties.
FORMULA RobotManipulation-PT-00100-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00100-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 19 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 03:46:43] [INFO ] Computed 6 place invariants in 9 ms
[2021-05-14 03:46:44] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 03:46:44] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-14 03:46:44] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 03:46:44] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 03:46:44] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-14 03:46:44] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 03:46:44] [INFO ] Flatten gal took : 41 ms
FORMULA RobotManipulation-PT-00100-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 03:46:44] [INFO ] Flatten gal took : 10 ms
[2021-05-14 03:46:44] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 2614 steps, including 0 resets, run visited all 12 properties in 22 ms. (steps per millisecond=118 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0||G(p1)))&&X(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 4 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 03:46:44] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-14 03:46:44] [INFO ] Implicit Places using invariants in 50 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 03:46:44] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 03:46:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 3 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 03:46:44] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 03:46:44] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 923 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (NOT p1), false, p0, (AND p0 (NOT p1)), p0, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), false, (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={0, 2} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=1 dest: 3}], [{ cond=(OR p0 p1), acceptance={0, 2} source=2 dest: 4}, { cond=(OR p0 p1), acceptance={0, 1, 2} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={2} source=3 dest: 8}, { cond=(AND p0 p1), acceptance={1, 2} source=3 dest: 9}], [{ cond=p0, acceptance={0, 2} source=4 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=p0, acceptance={0, 2} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=5 dest: 5}, { cond=p0, acceptance={0, 1, 2} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={2} source=6 dest: 8}, { cond=(AND p0 p1), acceptance={1, 2} source=6 dest: 9}], [{ cond=p0, acceptance={0, 2} source=7 dest: 1}, { cond=p0, acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=8 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=8 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=8 dest: 3}, { cond=(AND p0 p1), acceptance={2} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2} source=9 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=9 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 7}, { cond=(AND p0 p1), acceptance={2} source=9 dest: 10}, { cond=(AND p0 p1), acceptance={1, 2} source=9 dest: 11}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2} source=10 dest: 1}, { cond=(AND p0 p1), acceptance={2} source=10 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2} source=11 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=11 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={1} source=11 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=11 dest: 7}, { cond=(AND p0 p1), acceptance={2} source=11 dest: 10}, { cond=(AND p0 p1), acceptance={1, 2} source=11 dest: 11}]], initial=0, aps=[p0:(GEQ s8 1), p1:(GEQ s5 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 356 reset in 470 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA RobotManipulation-PT-00100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-00 finished in 1650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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
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 29 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 03:46:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 03:46:46] [INFO ] Implicit Places using invariants in 27 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
[2021-05-14 03:46:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-14 03:46:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 03:46:46] [INFO ] Dead Transitions using invariants and state equation in 26 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 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 9 ms. Remains 2 /5 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-14 03:46:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 03:46:46] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-14 03:46:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 03:46:46] [INFO ] Implicit Places using invariants and state equation in 16 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 : 2/15 places, 3/11 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00100-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-03 finished in 307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(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
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 5 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 03:46:46] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-14 03:46:46] [INFO ] Implicit Places using invariants in 37 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
[2021-05-14 03:46:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-14 03:46:46] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 03:46:46] [INFO ] Dead Transitions using invariants and state equation in 23 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 0 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 2 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 03:46:46] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 03:46:46] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-14 03:46:46] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 03:46:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-14 03:46:46] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 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 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00100-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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 5 reset in 1 ms.
FORMULA RobotManipulation-PT-00100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-04 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(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 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 03:46:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 03:46:46] [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 12 cols
[2021-05-14 03:46:47] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-14 03:46:47] [INFO ] Dead Transitions using invariants and state equation in 42 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 11 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 03:46:47] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 03:46:47] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 03:46:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 03:46:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 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 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00100-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s3 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 6388 reset in 294 ms.
Stack based approach found an accepted trace after 345 steps with 24 reset with depth 8 and stack size 8 in 2 ms.
FORMULA RobotManipulation-PT-00100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-05 finished in 597 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((!p0&&X((p1||X(p0))))||G((p1||X(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 03:46:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 03:46:47] [INFO ] Implicit Places using invariants in 27 ms returned [5]
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-14 03:46:47] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-14 03:46:47] [INFO ] Dead Transitions using invariants and state equation in 51 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 03:46:47] [INFO ] Computed 4 place invariants in 8 ms
[2021-05-14 03:46:47] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p0:(AND (GEQ s6 1) (GEQ s9 1)), p1:(AND (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25001 reset in 157 ms.
Product exploration explored 100000 steps with 25061 reset in 215 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24937 reset in 123 ms.
Product exploration explored 100000 steps with 25023 reset in 226 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 13 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 13/13 places, 11/11 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 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 3 place count 13 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 11
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 11 transition count 9
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 9 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 9 rules in 6 ms. Remains 11 /13 variables (removed 2) and now considering 9/11 (removed 2) transitions.
[2021-05-14 03:46:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-14 03:46:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 03:46:49] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/13 places, 9/11 transitions.
Product exploration explored 100000 steps with 25028 reset in 632 ms.
Product exploration explored 100000 steps with 25031 reset in 297 ms.
[2021-05-14 03:46:50] [INFO ] Flatten gal took : 3 ms
[2021-05-14 03:46:50] [INFO ] Flatten gal took : 2 ms
[2021-05-14 03:46:50] [INFO ] Time to serialize gal into /tmp/LTL11623811268611947374.gal : 1 ms
[2021-05-14 03:46:50] [INFO ] Time to serialize properties into /tmp/LTL17485757202000870566.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/LTL11623811268611947374.gal, -t, CGAL, -LTL, /tmp/LTL17485757202000870566.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/LTL11623811268611947374.gal -t CGAL -LTL /tmp/LTL17485757202000870566.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(("((initialized>=1)&&(p_i2>=1))")||(X("((p_rdy>=1)&&(access>=1))"))))||((X(("((initialized>=1)&&(p_i2>=1))")||(X("((p_rdy>=1)&&(access>=1))"))))&&("((p_rdy<1)||(access<1))")))))
Formula 0 simplified : !F(G("((initialized>=1)&&(p_i2>=1))" | X"((p_rdy>=1)&&(access>=1))") | ("((p_rdy<1)||(access<1))" & X("((initialized>=1)&&(p_i2>=1))" | X"((p_rdy>=1)&&(access>=1))")))
Detected timeout of ITS tools.
[2021-05-14 03:47:05] [INFO ] Flatten gal took : 3 ms
[2021-05-14 03:47:05] [INFO ] Applying decomposition
[2021-05-14 03:47:05] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph666765423633255776.txt, -o, /tmp/graph666765423633255776.bin, -w, /tmp/graph666765423633255776.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph666765423633255776.bin, -l, -1, -v, -w, /tmp/graph666765423633255776.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 03:47:05] [INFO ] Decomposing Gal with order
[2021-05-14 03:47:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 03:47:05] [INFO ] Flatten gal took : 45 ms
[2021-05-14 03:47:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-14 03:47:05] [INFO ] Time to serialize gal into /tmp/LTL15633834901295497814.gal : 1 ms
[2021-05-14 03:47:05] [INFO ] Time to serialize properties into /tmp/LTL13857153469107648620.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/LTL15633834901295497814.gal, -t, CGAL, -LTL, /tmp/LTL13857153469107648620.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15633834901295497814.gal -t CGAL -LTL /tmp/LTL13857153469107648620.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(("((i2.u4.initialized>=1)&&(i2.u3.p_i2>=1))")||(X("((i2.u3.p_rdy>=1)&&(i1.u0.access>=1))"))))||((X(("((i2.u4.initialized>=1)&&(i2.u3.p_i2>=1))")||(X("((i2.u3.p_rdy>=1)&&(i1.u0.access>=1))"))))&&("((i2.u3.p_rdy<1)||(i1.u0.access<1))")))))
Formula 0 simplified : !F(G("((i2.u4.initialized>=1)&&(i2.u3.p_i2>=1))" | X"((i2.u3.p_rdy>=1)&&(i1.u0.access>=1))") | ("((i2.u3.p_rdy<1)||(i1.u0.access<1))" & X("((i2.u4.initialized>=1)&&(i2.u3.p_i2>=1))" | X"((i2.u3.p_rdy>=1)&&(i1.u0.access>=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17171739794464496403
[2021-05-14 03:47:20] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17171739794464496403
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17171739794464496403]
Compilation finished in 325 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17171739794464496403]
Link finished in 65 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([](((LTLAPp0==true)||X((LTLAPp1==true))))||(X(((LTLAPp0==true)||X((LTLAPp1==true))))&&!(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17171739794464496403]
LTSmin run took 587 ms.
FORMULA RobotManipulation-PT-00100-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-00100-06 finished in 34117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))&&(p0 U 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-14 03:47:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 03:47:21] [INFO ] Implicit Places using invariants in 36 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 03:47:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 03:47:21] [INFO ] Dead Transitions using invariants and state equation in 30 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 2 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 03:47:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 03:47:21] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 03:47:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 03:47:21] [INFO ] Implicit Places using invariants and state equation in 28 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 : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00100-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(OR p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s8 1)), p1:(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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3555 reset in 114 ms.
Stack based approach found an accepted trace after 24 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RobotManipulation-PT-00100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-07 finished in 479 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 6 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 03:47:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 03:47:22] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 03:47:22] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-14 03:47:22] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 03:47:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 03:47:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00100-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s5 1)), p0:(OR (LT s12 1) (LT s13 1) (LT s7 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 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 3 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-14 03:47:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 03:47:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 03:47:23] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Product exploration explored 100000 steps with 50000 reset in 449 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
[2021-05-14 03:47:24] [INFO ] Flatten gal took : 2 ms
[2021-05-14 03:47:24] [INFO ] Flatten gal took : 1 ms
[2021-05-14 03:47:24] [INFO ] Time to serialize gal into /tmp/LTL5815551584132869014.gal : 1 ms
[2021-05-14 03:47:24] [INFO ] Time to serialize properties into /tmp/LTL16595533318975473583.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5815551584132869014.gal, -t, CGAL, -LTL, /tmp/LTL16595533318975473583.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/LTL5815551584132869014.gal -t CGAL -LTL /tmp/LTL16595533318975473583.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((((initialized<1)||(p_i2<1))||(p_rdy<1))||(access<1))")||(G("((move<1)||(r_active<1))")))))
Formula 0 simplified : !X("((((initialized<1)||(p_i2<1))||(p_rdy<1))||(access<1))" | G"((move<1)||(r_active<1))")
Detected timeout of ITS tools.
[2021-05-14 03:47:39] [INFO ] Flatten gal took : 2 ms
[2021-05-14 03:47:39] [INFO ] Applying decomposition
[2021-05-14 03:47:39] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16414942935355553496.txt, -o, /tmp/graph16414942935355553496.bin, -w, /tmp/graph16414942935355553496.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16414942935355553496.bin, -l, -1, -v, -w, /tmp/graph16414942935355553496.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 03:47:39] [INFO ] Decomposing Gal with order
[2021-05-14 03:47:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 03:47:39] [INFO ] Flatten gal took : 3 ms
[2021-05-14 03:47:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 03:47:39] [INFO ] Time to serialize gal into /tmp/LTL13278388115034721857.gal : 2 ms
[2021-05-14 03:47:39] [INFO ] Time to serialize properties into /tmp/LTL5004817472605939725.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13278388115034721857.gal, -t, CGAL, -LTL, /tmp/LTL5004817472605939725.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13278388115034721857.gal -t CGAL -LTL /tmp/LTL5004817472605939725.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((((i1.u1.initialized<1)||(i1.u4.p_i2<1))||(i1.u1.p_rdy<1))||(u3.access<1))")||(G("((u2.move<1)||(u0.r_active<1))")))))
Formula 0 simplified : !X("((((i1.u1.initialized<1)||(i1.u4.p_i2<1))||(i1.u1.p_rdy<1))||(u3.access<1))" | G"((u2.move<1)||(u0.r_active<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin272159166759122187
[2021-05-14 03:47:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin272159166759122187
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin272159166759122187]
Compilation finished in 154 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin272159166759122187]
Link finished in 33 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp1==true))||(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin272159166759122187]
LTSmin run took 179 ms.
FORMULA RobotManipulation-PT-00100-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-00100-08 finished in 32366 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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
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 4 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-14 03:47:54] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 03:47:54] [INFO ] Implicit Places using invariants in 19 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
[2021-05-14 03:47:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 03:47:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 03:47:54] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 7/15 places, 7/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
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 6 transition count 6
Applied a total of 3 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 03:47:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 03:47:54] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 03:47:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 03:47:54] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00100-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s3 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 22199 reset in 136 ms.
Product exploration explored 100000 steps with 22222 reset in 160 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22238 reset in 133 ms.
Product exploration explored 100000 steps with 22198 reset in 155 ms.
[2021-05-14 03:47:55] [INFO ] Flatten gal took : 1 ms
[2021-05-14 03:47:55] [INFO ] Flatten gal took : 2 ms
[2021-05-14 03:47:55] [INFO ] Time to serialize gal into /tmp/LTL4269140947161661457.gal : 0 ms
[2021-05-14 03:47:55] [INFO ] Time to serialize properties into /tmp/LTL3941801275048707747.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/LTL4269140947161661457.gal, -t, CGAL, -LTL, /tmp/LTL3941801275048707747.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/LTL4269140947161661457.gal -t CGAL -LTL /tmp/LTL3941801275048707747.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(((off>=1)&&(r_active>=1))||((move>=1)&&(r_active>=1)))")))
Formula 0 simplified : !F"(((off>=1)&&(r_active>=1))||((move>=1)&&(r_active>=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
258 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,2.58586,38728,1,0,1006,119920,20,202,1333,116455,2013
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00100-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RobotManipulation-PT-00100-09 finished in 3510 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X((p0 U (p1||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 03:47:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants in 17 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 03:47:58] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 03:47:58] [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 2 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 03:47:58] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 03:47:58] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants and state equation in 16 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 38 ms :[true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00100-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 s5 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][false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00100-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-10 finished in 128 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 3 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 03:47:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants in 20 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 21 ms to find 3 implicit places.
[2021-05-14 03:47:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-14 03:47:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 03:47:58] [INFO ] Dead Transitions using invariants and state equation in 11 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 1 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 2 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 03:47:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 03:47:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 17 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 27 ms :[p0]
Running random walk in product with property : RobotManipulation-PT-00100-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-11 finished in 97 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(!p0)) U 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 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 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-14 03:47:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants in 14 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
[2021-05-14 03:47:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 03:47:58] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 03:47:58] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 7/15 places, 7/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 5
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 5 transition count 4
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 4 transition count 4
Applied a total of 6 rules in 2 ms. Remains 4 /7 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-14 03:47:58] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-14 03:47:58] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants and state equation in 23 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 : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), p0]
Running random walk in product with property : RobotManipulation-PT-00100-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA RobotManipulation-PT-00100-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-12 finished in 279 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(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 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 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 4 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-14 03:47:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 03:47:58] [INFO ] Implicit Places using invariants in 25 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
[2021-05-14 03:47:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-14 03:47:58] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 03:47:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 8/15 places, 7/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-14 03:47:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-14 03:47:58] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 03:47:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10428 reset in 155 ms.
Product exploration explored 100000 steps with 10184 reset in 182 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10321 reset in 156 ms.
Product exploration explored 100000 steps with 10325 reset in 184 ms.
[2021-05-14 03:47:59] [INFO ] Flatten gal took : 1 ms
[2021-05-14 03:47:59] [INFO ] Flatten gal took : 2 ms
[2021-05-14 03:47:59] [INFO ] Time to serialize gal into /tmp/LTL770256362931095907.gal : 1 ms
[2021-05-14 03:47:59] [INFO ] Time to serialize properties into /tmp/LTL1314864558687593628.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/LTL770256362931095907.gal, -t, CGAL, -LTL, /tmp/LTL1314864558687593628.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/LTL770256362931095907.gal -t CGAL -LTL /tmp/LTL1314864558687593628.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p_i1>=1)")))||("((off>=1)&&(r_active>=1))"))))
Formula 0 simplified : !F("((off>=1)&&(r_active>=1))" | GF"(p_i1>=1)")
Detected timeout of ITS tools.
[2021-05-14 03:48:14] [INFO ] Flatten gal took : 1 ms
[2021-05-14 03:48:14] [INFO ] Applying decomposition
[2021-05-14 03:48:14] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16237465830246864432.txt, -o, /tmp/graph16237465830246864432.bin, -w, /tmp/graph16237465830246864432.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16237465830246864432.bin, -l, -1, -v, -w, /tmp/graph16237465830246864432.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 03:48:14] [INFO ] Decomposing Gal with order
[2021-05-14 03:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 03:48:14] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-14 03:48:14] [INFO ] Flatten gal took : 4 ms
[2021-05-14 03:48:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 03:48:14] [INFO ] Time to serialize gal into /tmp/LTL4978017511012879882.gal : 1 ms
[2021-05-14 03:48:14] [INFO ] Time to serialize properties into /tmp/LTL14922107227962508617.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/LTL4978017511012879882.gal, -t, CGAL, -LTL, /tmp/LTL14922107227962508617.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4978017511012879882.gal -t CGAL -LTL /tmp/LTL14922107227962508617.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(u0.p_i1>=1)")))||("((i2.u2.off>=1)&&(i2.u3.r_active>=1))"))))
Formula 0 simplified : !F("((i2.u2.off>=1)&&(i2.u3.r_active>=1))" | GF"(u0.p_i1>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2729101917904147331
[2021-05-14 03:48:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2729101917904147331
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2729101917904147331]
Compilation finished in 132 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2729101917904147331]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([](<>((LTLAPp0==true)))||(LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2729101917904147331]
LTSmin run took 4309 ms.
FORMULA RobotManipulation-PT-00100-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-00100-13 finished in 35640 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(F((!p1 U (p2||G(!p1))))))))], workingDir=/home/mcc/execution]
Support contains 6 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 03:48:34] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-14 03:48:34] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 03:48:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 03:48:34] [INFO ] Dead Transitions using invariants and state equation in 15 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-14 03:48:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 03:48:34] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : RobotManipulation-PT-00100-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s8 1)), p2:(AND (OR (LT s6 1) (LT s10 1)) (GEQ s0 1) (GEQ s4 1)), p1:(AND (GEQ s6 1) (GEQ s10 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 6838 reset in 133 ms.
Stack based approach found an accepted trace after 1504 steps with 103 reset with depth 25 and stack size 25 in 5 ms.
FORMULA RobotManipulation-PT-00100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-15 finished in 350 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620964115700

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

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00100.tgz
mv RobotManipulation-PT-00100 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 ;