Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r357-smll-167891805700084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RobotManipulation-PT-02000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r357-smll-167891805700084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.7K Feb 26 05:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 05:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 05:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 05:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K Mar 5 18:23 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-02000-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-02000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678980074517

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-02000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 15:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 15:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 15:21:18] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-16 15:21:18] [INFO ] Transformed 15 places.
[2023-03-16 15:21:18] [INFO ] Transformed 11 transitions.
[2023-03-16 15:21:18] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-02000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:21:18] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-16 15:21:18] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-16 15:21:18] [INFO ] Invariant cache hit.
[2023-03-16 15:21:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-16 15:21:18] [INFO ] Invariant cache hit.
[2023-03-16 15:21:18] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 15:21:19] [INFO ] Flatten gal took : 29 ms
[2023-03-16 15:21:19] [INFO ] Flatten gal took : 9 ms
[2023-03-16 15:21:19] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 12008 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=285 ) properties (out of 17) seen :2
Finished Best-First random walk after 672 steps, including 1 resets, run visited all 15 properties in 44 ms. (steps per millisecond=15 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 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 3 place count 13 transition count 9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 17 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-16 15:21:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 15:21:20] [INFO ] Implicit Places using invariants in 67 ms returned [4, 9, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 72 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 8/11 transitions.
Graph (trivial) has 5 edges and 8 vertex of which 3 / 8 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 5
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 5 transition count 5
Applied a total of 3 rules in 8 ms. Remains 5 /8 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-16 15:21:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 15:21:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 15:21:20] [INFO ] Invariant cache hit.
[2023-03-16 15:21:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 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 3 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-00 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 8
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 8 place count 10 transition count 8
Applied a total of 8 rules in 4 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-16 15:21:20] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 15:21:20] [INFO ] Implicit Places using invariants in 53 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 8/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 6 transition count 6
Applied a total of 4 rules in 4 ms. Remains 6 /8 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 15:21:20] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 15:21:20] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-16 15:21:20] [INFO ] Invariant cache hit.
[2023-03-16 15:21:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s5 1) (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 506 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 2 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-01 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X(p0) U G(p1)))||(F(p2) U p3)))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:21:21] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 15:21:21] [INFO ] Implicit Places using invariants in 30 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:21:21] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-16 15:21:21] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 15:21:21] [INFO ] Invariant cache hit.
[2023-03-16 15:21:21] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 635 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=7 dest: 11}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(NOT p3), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=11 dest: 11}]], initial=0, aps=[p3:(GEQ s10 1), p2:(AND (GEQ s0 1) (GEQ s4 1)), p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 1 reset in 266 ms.
Product exploration explored 100000 steps with 1 reset in 475 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), true, (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 11 factoid took 1406 ms. Reduced automaton from 12 states, 33 edges and 4 AP (stutter sensitive) to 12 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 536 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1334 ) properties (out of 24) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-16 15:21:25] [INFO ] Invariant cache hit.
[2023-03-16 15:21:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 15:21:25] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 15:21:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 15:21:25] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-16 15:21:25] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-16 15:21:25] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 10 different solutions.
Finished Parikh walk after 23799 steps, including 0 resets, run visited all 4 properties in 376 ms. (steps per millisecond=63 )
Parikh walk visited 12 properties in 1845 ms.
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), true, (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (AND p1 (NOT p3) p0)), (F (AND (NOT p2) (NOT p3))), (F (AND p1 (NOT p2))), (F (NOT p3)), (F (AND (NOT p1) (NOT p3) p0)), (F (AND p1 (NOT p2) (NOT p3) p0)), (F (AND (NOT p1) (NOT p2) (NOT p3) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (AND p1 (NOT p2) (NOT p3) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (F (AND (NOT p3) (NOT p0))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F (AND p1 (NOT p3) (NOT p0))), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 1969 ms. Reduced automaton from 12 states, 33 edges and 4 AP (stutter sensitive) to 12 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 746 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 760 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 15:21:30] [INFO ] Invariant cache hit.
[2023-03-16 15:21:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-16 15:21:30] [INFO ] Invariant cache hit.
[2023-03-16 15:21:30] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-16 15:21:30] [INFO ] Invariant cache hit.
[2023-03-16 15:21:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 11/11 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) (NOT p0)), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 1205 ms. Reduced automaton from 12 states, 33 edges and 4 AP (stutter sensitive) to 12 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 723 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1501 ) properties (out of 24) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-16 15:21:33] [INFO ] Invariant cache hit.
[2023-03-16 15:21:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 15:21:33] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 15:21:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 15:21:33] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-16 15:21:33] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-16 15:21:33] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 10 different solutions.
Finished Parikh walk after 23982 steps, including 0 resets, run visited all 4 properties in 478 ms. (steps per millisecond=50 )
Parikh walk visited 12 properties in 1698 ms.
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) (NOT p0)), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (AND p1 (NOT p3) p0)), (F (AND (NOT p2) (NOT p3))), (F (AND p1 (NOT p2))), (F (NOT p3)), (F (AND (NOT p1) (NOT p3) p0)), (F (AND p1 (NOT p2) (NOT p3) p0)), (F (AND (NOT p1) (NOT p2) (NOT p3) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (AND p1 (NOT p2) (NOT p3) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (F (AND (NOT p3) (NOT p0))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F (AND p1 (NOT p3) (NOT p0))), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 1914 ms. Reduced automaton from 12 states, 33 edges and 4 AP (stutter sensitive) to 12 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 739 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 716 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 777 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 1 reset in 174 ms.
Product exploration explored 100000 steps with 1 reset in 204 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 715 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 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 11 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 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 11 /11 variables (removed 0) and now considering 11/10 (removed -1) transitions.
[2023-03-16 15:21:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2023-03-16 15:21:40] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-16 15:21:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/11 places, 11/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 11/11 places, 11/10 transitions.
Built C files in :
/tmp/ltsmin5073542420067375108
[2023-03-16 15:21:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5073542420067375108
Running compilation step : cd /tmp/ltsmin5073542420067375108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 344 ms.
Running link step : cd /tmp/ltsmin5073542420067375108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin5073542420067375108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased210969864156365951.hoa' '--buchi-type=spotba'
LTSmin run took 2982 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-LTLFireability-02 finished in 22865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p0) U (F(p1) U X(p2)))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:21:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 15:21:44] [INFO ] Implicit Places using invariants in 27 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:21:44] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 15:21:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-16 15:21:44] [INFO ] Invariant cache hit.
[2023-03-16 15:21:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s5 1)), p1:(AND (GEQ s0 1) (GEQ s4 1)), p2:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24487 reset in 150 ms.
Product exploration explored 100000 steps with 24695 reset in 175 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 659 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3002 ) properties (out of 3) seen :2
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p2)]
Knowledge based reduction with 8 factoid took 741 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
[2023-03-16 15:21:46] [INFO ] Invariant cache hit.
[2023-03-16 15:21:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 15:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:21:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 15:21:46] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 15:21:46] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 15:21:46] [INFO ] Invariant cache hit.
[2023-03-16 15:21:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 15:21:46] [INFO ] Invariant cache hit.
[2023-03-16 15:21:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-16 15:21:47] [INFO ] Invariant cache hit.
[2023-03-16 15:21:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 11/11 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 298 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3002 ) properties (out of 3) seen :2
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2)]
Knowledge based reduction with 4 factoid took 357 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
[2023-03-16 15:21:48] [INFO ] Invariant cache hit.
[2023-03-16 15:21:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 15:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 15:21:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 15:21:48] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 15:21:48] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16255 reset in 408 ms.
Product exploration explored 100000 steps with 16276 reset in 343 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 15:21:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 15:21:49] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-16 15:21:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/11 places, 10/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39 ms. Remains : 11/11 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin17823048001358158354
[2023-03-16 15:21:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17823048001358158354
Running compilation step : cd /tmp/ltsmin17823048001358158354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin17823048001358158354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17823048001358158354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6997436650573627900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 15:22:04] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 15:22:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 15:22:04] [INFO ] Invariant cache hit.
[2023-03-16 15:22:04] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-16 15:22:04] [INFO ] Invariant cache hit.
[2023-03-16 15:22:05] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 11/11 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin14188721000959558665
[2023-03-16 15:22:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14188721000959558665
Running compilation step : cd /tmp/ltsmin14188721000959558665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin14188721000959558665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14188721000959558665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16204793248955862196.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 15:22:20] [INFO ] Flatten gal took : 3 ms
[2023-03-16 15:22:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 15:22:20] [INFO ] Time to serialize gal into /tmp/LTL9687377222040411979.gal : 1 ms
[2023-03-16 15:22:20] [INFO ] Time to serialize properties into /tmp/LTL1504374075701981473.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9687377222040411979.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13825846704706399478.hoa' '-atoms' '/tmp/LTL1504374075701981473.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1504374075701981473.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13825846704706399478.hoa
Detected timeout of ITS tools.
[2023-03-16 15:22:35] [INFO ] Flatten gal took : 3 ms
[2023-03-16 15:22:35] [INFO ] Flatten gal took : 2 ms
[2023-03-16 15:22:35] [INFO ] Time to serialize gal into /tmp/LTL18124569984280147622.gal : 1 ms
[2023-03-16 15:22:35] [INFO ] Time to serialize properties into /tmp/LTL3731237912322359205.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18124569984280147622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3731237912322359205.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((move>=1)&&(r_active>=1))"))||((F("((move>=1)&&(r_active>=1))"))U((F("((initialize>=1)&&(r_stopped>=1))"))U(X("(p_rdy>=1)"))))...157
Formula 0 simplified : F!"((move>=1)&&(r_active>=1))" & (G!"((move>=1)&&(r_active>=1))" R (G!"((initialize>=1)&&(r_stopped>=1))" R X!"(p_rdy>=1)"))
Detected timeout of ITS tools.
[2023-03-16 15:22:50] [INFO ] Flatten gal took : 1 ms
[2023-03-16 15:22:50] [INFO ] Applying decomposition
[2023-03-16 15:22:50] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12817923958387057738.txt' '-o' '/tmp/graph12817923958387057738.bin' '-w' '/tmp/graph12817923958387057738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12817923958387057738.bin' '-l' '-1' '-v' '-w' '/tmp/graph12817923958387057738.weights' '-q' '0' '-e' '0.001'
[2023-03-16 15:22:50] [INFO ] Decomposing Gal with order
[2023-03-16 15:22:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:22:50] [INFO ] Flatten gal took : 32 ms
[2023-03-16 15:22:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-16 15:22:50] [INFO ] Time to serialize gal into /tmp/LTL4272252913224920749.gal : 1 ms
[2023-03-16 15:22:50] [INFO ] Time to serialize properties into /tmp/LTL968410600003867873.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4272252913224920749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL968410600003867873.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((G("((u1.move>=1)&&(u0.r_active>=1))"))||((F("((u1.move>=1)&&(u0.r_active>=1))"))U((F("((u3.initialize>=1)&&(u0.r_stopped>=1))"))U(...178
Formula 0 simplified : F!"((u1.move>=1)&&(u0.r_active>=1))" & (G!"((u1.move>=1)&&(u0.r_active>=1))" R (G!"((u3.initialize>=1)&&(u0.r_stopped>=1))" R X!"(u1...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12082487030440337965
[2023-03-16 15:23:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12082487030440337965
Running compilation step : cd /tmp/ltsmin12082487030440337965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin12082487030440337965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12082487030440337965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||(<>((LTLAPp0==true)) U (<>((LTLAPp1==true)) U X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RobotManipulation-PT-02000-LTLFireability-03 finished in 96387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:23:20] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 15:23:20] [INFO ] Implicit Places using invariants in 47 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s5 1) (AND (GEQ s8 1) (GEQ s9 1))), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-04 finished in 190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(F(p2))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 15:23:20] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 15:23:20] [INFO ] Implicit Places using invariants in 27 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s8 1)), p2:(GEQ s9 1), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3019 reset in 91 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-05 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:23:21] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants in 32 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:23:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-16 15:23:21] [INFO ] Invariant cache hit.
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, p0]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1 reset in 136 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-02000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-06 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(!p1)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 7 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-16 15:23:21] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants in 29 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, 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 4 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 15:23:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-16 15:23:21] [INFO ] Invariant cache hit.
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95 ms. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1)), p1:(AND (GEQ s0 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 21 steps with 1 reset with depth 15 and stack size 12 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-07 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 6 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-16 15:23:21] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants in 34 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, 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 3 ms. Remains 4 /7 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-16 15:23:21] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-16 15:23:21] [INFO ] Invariant cache hit.
[2023-03-16 15:23:21] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2604 reset in 164 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 12 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-08 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((F(p1)||G(p2)))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 15:23:22] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-16 15:23:22] [INFO ] Implicit Places using invariants in 34 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 12 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 2 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 15:23:22] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 15:23:22] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 15:23:22] [INFO ] Invariant cache hit.
[2023-03-16 15:23:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 12/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 12/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s2 1) (GEQ s9 1)), p2:(AND (GEQ s7 1) (GEQ s2 1) (GEQ s9 1)), p0:(AND (GEQ s2 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3435 reset in 199 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-09 finished in 610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p1)&&p0)))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 8 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-16 15:23:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 15:23:22] [INFO ] Implicit Places using invariants in 39 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/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 10 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 9 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 8 transition count 6
Applied a total of 4 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-16 15:23:22] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 15:23:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 15:23:22] [INFO ] Invariant cache hit.
[2023-03-16 15:23:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 8/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1)), p1:(OR (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 150 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-10 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(((G(p1) U p2) U p0))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 15:23:23] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 15:23:23] [INFO ] Implicit Places using invariants in 31 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 12 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 15:23:23] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 15:23:23] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 15:23:23] [INFO ] Invariant cache hit.
[2023-03-16 15:23:23] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 12/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 12/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s9 1)), p2:(AND (GEQ s3 1) (GEQ s5 1)), p1:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3591 reset in 138 ms.
Stack based approach found an accepted trace after 110 steps with 6 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-11 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 13 transition count 10
Applied a total of 3 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-16 15:23:23] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 15:23:23] [INFO ] Implicit Places using invariants in 26 ms returned [4, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 10/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 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 7 transition count 7
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 6 transition count 6
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 6 transition count 6
Applied a total of 8 rules in 2 ms. Remains 6 /10 variables (removed 4) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 15:23:23] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 15:23:23] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 15:23:23] [INFO ] Invariant cache hit.
[2023-03-16 15:23:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 75 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-02000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-13 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&X((!p0 U (X(!p1)||G(!p0))))))))'
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 in LTL mode, 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
[2023-03-16 15:23:23] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 15:23:23] [INFO ] Implicit Places using invariants in 25 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, 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 0 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 15:23:23] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 15:23:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-16 15:23:24] [INFO ] Invariant cache hit.
[2023-03-16 15:23:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 11/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-02000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-14 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((p1&&F(p2))))||p0)))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2023-03-16 15:23:24] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 15:23:24] [INFO ] Implicit Places using invariants in 20 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in LTL mode, 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 0 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-16 15:23:24] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 15:23:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-16 15:23:24] [INFO ] Invariant cache hit.
[2023-03-16 15:23:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s8 1) (AND (GEQ s1 1) (GEQ s5 1))), p2:(AND (GEQ s3 1) (GEQ s5 1)), p1:(OR (AND (GEQ s1 1) (GEQ s5 1)) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3928 reset in 143 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-15 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p0) U (F(p1) U X(p2)))))'
[2023-03-16 15:23:24] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14627120607974574606
[2023-03-16 15:23:24] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2023-03-16 15:23:24] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:23:24] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2023-03-16 15:23:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:23:24] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2023-03-16 15:23:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 15:23:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14627120607974574606
[2023-03-16 15:23:24] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin14627120607974574606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 15:23:24] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4263040534302660417.txt' '-o' '/tmp/graph4263040534302660417.bin' '-w' '/tmp/graph4263040534302660417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4263040534302660417.bin' '-l' '-1' '-v' '-w' '/tmp/graph4263040534302660417.weights' '-q' '0' '-e' '0.001'
[2023-03-16 15:23:24] [INFO ] Decomposing Gal with order
[2023-03-16 15:23:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 15:23:24] [INFO ] Flatten gal took : 4 ms
[2023-03-16 15:23:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-16 15:23:24] [INFO ] Time to serialize gal into /tmp/LTLFireability7778754161669933833.gal : 2 ms
[2023-03-16 15:23:24] [INFO ] Time to serialize properties into /tmp/LTLFireability14379309925979972584.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7778754161669933833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14379309925979972584.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G("((i0.u1.move>=1)&&(i0.u1.r_active>=1))"))||((F("((i0.u1.move>=1)&&(i0.u1.r_active>=1))"))U((F("((u3.initialize>=1)&&(i0.u0.r_st...193
Formula 0 simplified : F!"((i0.u1.move>=1)&&(i0.u1.r_active>=1))" & (G!"((i0.u1.move>=1)&&(i0.u1.r_active>=1))" R (G!"((u3.initialize>=1)&&(i0.u0.r_stopped...183
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin14627120607974574606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14627120607974574606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||(<>((LTLAPp0==true)) U (<>((LTLAPp1==true)) U X((LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: ([]((LTLAPp0==true))||(<>((LTLAPp0==true)) U (<>((LTLAPp1==true)) U X((LTLAPp2==true)))))
pins2lts-mc-linux64( 0/ 8), 0.003: "([]((LTLAPp0==true))||(<>((LTLAPp0==true)) U (<>((LTLAPp1==true)) U X((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: buchi has 6 states
pins2lts-mc-linux64( 0/ 8), 0.025: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.085: DFS-FIFO for weak LTL, using special progress label 15
pins2lts-mc-linux64( 0/ 8), 0.085: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.085: State length is 16, there are 28 groups
pins2lts-mc-linux64( 0/ 8), 0.085: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.085: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.085: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.085: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.131: ~94 levels ~960 states ~2200 transitions
pins2lts-mc-linux64( 4/ 8), 0.177: ~182 levels ~1920 states ~4336 transitions
pins2lts-mc-linux64( 3/ 8), 0.266: ~368 levels ~3840 states ~8440 transitions
pins2lts-mc-linux64( 7/ 8), 0.415: ~727 levels ~7680 states ~16904 transitions
pins2lts-mc-linux64( 5/ 8), 0.666: ~1448 levels ~15360 states ~34712 transitions
pins2lts-mc-linux64( 4/ 8), 0.997: ~2948 levels ~30720 states ~70528 transitions
pins2lts-mc-linux64( 6/ 8), 1.397: ~5826 levels ~61440 states ~139360 transitions
pins2lts-mc-linux64( 3/ 8), 2.098: ~11115 levels ~122880 states ~315336 transitions
pins2lts-mc-linux64( 6/ 8), 2.787: ~18026 levels ~245760 states ~652056 transitions
pins2lts-mc-linux64( 6/ 8), 3.226: ~18026 levels ~491520 states ~1117928 transitions
pins2lts-mc-linux64( 4/ 8), 3.813: ~17999 levels ~983040 states ~2013608 transitions
pins2lts-mc-linux64( 1/ 8), 4.789: ~18022 levels ~1966080 states ~3984088 transitions
pins2lts-mc-linux64( 4/ 8), 6.529: ~17999 levels ~3932160 states ~7674288 transitions
pins2lts-mc-linux64( 4/ 8), 10.126: ~17999 levels ~7864320 states ~15315144 transitions
pins2lts-mc-linux64( 0/ 8), 18.333: ~17979 levels ~15728640 states ~30455360 transitions
pins2lts-mc-linux64( 0/ 8), 35.594: ~17979 levels ~31457280 states ~61099328 transitions
pins2lts-mc-linux64( 6/ 8), 46.350: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 46.404:
pins2lts-mc-linux64( 0/ 8), 46.404: mean standard work distribution: 4.1% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 46.404:
pins2lts-mc-linux64( 0/ 8), 46.404: Explored 33539484 states 68520053 transitions, fanout: 2.043
pins2lts-mc-linux64( 0/ 8), 46.404: Total exploration time 46.300 sec (46.250 sec minimum, 46.274 sec on average)
pins2lts-mc-linux64( 0/ 8), 46.404: States per second: 724395, Transitions per second: 1479915
pins2lts-mc-linux64( 0/ 8), 46.404:
pins2lts-mc-linux64( 0/ 8), 46.404: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 46.404: Redundant explorations: 2.2851
pins2lts-mc-linux64( 0/ 8), 46.404:
pins2lts-mc-linux64( 0/ 8), 46.404: Queue width: 8B, total height: 144221, memory: 1.10MB
pins2lts-mc-linux64( 0/ 8), 46.404: Tree memory: 506.2MB, 16.2 B/state, compr.: 24.5%
pins2lts-mc-linux64( 0/ 8), 46.404: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 46.404: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 46.404: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 46.404: Est. total memory use: 507.3MB (~1025.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14627120607974574606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||(<>((LTLAPp0==true)) U (<>((LTLAPp1==true)) U X((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14627120607974574606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||(<>((LTLAPp0==true)) U (<>((LTLAPp1==true)) U X((LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 15:44:06] [INFO ] Flatten gal took : 2 ms
[2023-03-16 15:44:06] [INFO ] Time to serialize gal into /tmp/LTLFireability6769953401465961643.gal : 1 ms
[2023-03-16 15:44:06] [INFO ] Time to serialize properties into /tmp/LTLFireability11864983081390060784.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6769953401465961643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11864983081390060784.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((G("((move>=1)&&(r_active>=1))"))||((F("((move>=1)&&(r_active>=1))"))U((F("((initialize>=1)&&(r_stopped>=1))"))U(X("(p_rdy>=1)"))))...157
Formula 0 simplified : F!"((move>=1)&&(r_active>=1))" & (G!"((move>=1)&&(r_active>=1))" R (G!"((initialize>=1)&&(r_stopped>=1))" R X!"(p_rdy>=1)"))
Detected timeout of ITS tools.
[2023-03-16 16:04:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 16:04:49] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-16 16:04:49] [INFO ] Transformed 15 places.
[2023-03-16 16:04:49] [INFO ] Transformed 11 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 16:04:49] [INFO ] Time to serialize gal into /tmp/LTLFireability9057859387579449398.gal : 1 ms
[2023-03-16 16:04:49] [INFO ] Time to serialize properties into /tmp/LTLFireability10287048157911152120.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9057859387579449398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10287048157911152120.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((move>=1)&&(r_active>=1))"))||((F("((move>=1)&&(r_active>=1))"))U((F("((initialize>=1)&&(r_stopped>=1))"))U(X("(p_rdy>=1)"))))...157
Formula 0 simplified : F!"((move>=1)&&(r_active>=1))" & (G!"((move>=1)&&(r_active>=1))" R (G!"((initialize>=1)&&(r_stopped>=1))" R X!"(p_rdy>=1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 151984 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16067732 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-02000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RobotManipulation-PT-02000, 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 r357-smll-167891805700084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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