Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679101700148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r351-tall-171679101700148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 18:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 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 1716858650605

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=gold2023
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 202304061127
[2024-05-28 01:10:52] [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]
[2024-05-28 01:10:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:10:53] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2024-05-28 01:10:53] [INFO ] Transformed 15 places.
[2024-05-28 01:10:53] [INFO ] Transformed 11 transitions.
[2024-05-28 01:10:53] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-02000-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLFireability-14 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 8 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-05-28 01:10:53] [INFO ] Computed 6 invariants in 7 ms
[2024-05-28 01:10:53] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 01:10:53] [INFO ] Invariant cache hit.
[2024-05-28 01:10:53] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-28 01:10:53] [INFO ] Invariant cache hit.
[2024-05-28 01:10:53] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2024-05-28 01:10:53] [INFO ] Flatten gal took : 13 ms
[2024-05-28 01:10:53] [INFO ] Flatten gal took : 4 ms
[2024-05-28 01:10:53] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 12008 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=706 ) properties (out of 13) seen :2
Finished Best-First random walk after 197 steps, including 0 resets, run visited all 11 properties in 5 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
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 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:10:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:10:54] [INFO ] Implicit Places using invariants in 28 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
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
[2024-05-28 01:10:54] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:10:54] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 01:10:54] [INFO ] Invariant cache hit.
[2024-05-28 01:10:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 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 77 ms. Remains : 11/15 places, 10/11 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(GEQ s10 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50317 steps with 0 reset in 148 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-00 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))&&(!p0||F(p1)))))'
Support contains 2 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 3 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:10:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:10:54] [INFO ] Implicit Places using invariants in 30 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 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
[2024-05-28 01:10:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 01:10:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 01:10:54] [INFO ] Invariant cache hit.
[2024-05-28 01:10:54] [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 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s5 1), p1:(LT 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-02 finished in 260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:10:55] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:10:55] [INFO ] Implicit Places using invariants in 24 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 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
[2024-05-28 01:10:55] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:10:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 01:10:55] [INFO ] Invariant cache hit.
[2024-05-28 01:10:55] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 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 75 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 214 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 24539 reset in 135 ms.
Product exploration explored 100000 steps with 24577 reset in 173 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 219 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 169 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1501 ) 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 )
Parikh walk visited 0 properties in 0 ms.
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 p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2)]
Knowledge based reduction with 8 factoid took 419 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 183 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
[2024-05-28 01:10:56] [INFO ] Invariant cache hit.
[2024-05-28 01:10:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 01:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:10:57] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 01:10:57] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 01:10:57] [INFO ] Added : 1 causal constraints over 1 iterations in 17 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.
[2024-05-28 01:10:57] [INFO ] Invariant cache hit.
[2024-05-28 01:10:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 01:10:57] [INFO ] Invariant cache hit.
[2024-05-28 01:10:57] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 01:10:57] [INFO ] Invariant cache hit.
[2024-05-28 01:10:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 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 p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 158 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 159 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=2001 ) properties (out of 3) seen :2
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2)]
Knowledge based reduction with 4 factoid took 209 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 173 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
[2024-05-28 01:10:58] [INFO ] Invariant cache hit.
[2024-05-28 01:10:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 01:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:10:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-28 01:10:58] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 01:10:58] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16247 reset in 196 ms.
Product exploration explored 100000 steps with 16344 reset in 146 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (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 16 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-28 01:10:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 01:10:58] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:10:58] [INFO ] Dead Transitions using invariants and state equation in 26 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 50 ms. Remains : 11/11 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin2676242844351647447
[2024-05-28 01:10:59] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2676242844351647447
Running compilation step : cd /tmp/ltsmin2676242844351647447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 165 ms.
Running link step : cd /tmp/ltsmin2676242844351647447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2676242844351647447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5701431005499055636.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
[2024-05-28 01:11:14] [INFO ] Computed 3 invariants in 16 ms
[2024-05-28 01:11:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-28 01:11:14] [INFO ] Invariant cache hit.
[2024-05-28 01:11:14] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-28 01:11:14] [INFO ] Invariant cache hit.
[2024-05-28 01:11:14] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 11/11 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin111183894775291430
[2024-05-28 01:11:15] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin111183894775291430
Running compilation step : cd /tmp/ltsmin111183894775291430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin111183894775291430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin111183894775291430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11568984715671831878.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 01:11:30] [INFO ] Flatten gal took : 1 ms
[2024-05-28 01:11:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 01:11:30] [INFO ] Time to serialize gal into /tmp/LTL11962147679293880578.gal : 1 ms
[2024-05-28 01:11:30] [INFO ] Time to serialize properties into /tmp/LTL18246424990828156975.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11962147679293880578.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8750109544117437283.hoa' '-atoms' '/tmp/LTL18246424990828156975.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18246424990828156975.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8750109544117437283.hoa
Detected timeout of ITS tools.
[2024-05-28 01:11:45] [INFO ] Flatten gal took : 1 ms
[2024-05-28 01:11:45] [INFO ] Flatten gal took : 1 ms
[2024-05-28 01:11:45] [INFO ] Time to serialize gal into /tmp/LTL88673307409937797.gal : 0 ms
[2024-05-28 01:11:45] [INFO ] Time to serialize properties into /tmp/LTL7174929071787613343.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL88673307409937797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7174929071787613343.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
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.
[2024-05-28 01:12:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 01:12:00] [INFO ] Applying decomposition
[2024-05-28 01:12:00] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15033320213824949234.txt' '-o' '/tmp/graph15033320213824949234.bin' '-w' '/tmp/graph15033320213824949234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15033320213824949234.bin' '-l' '-1' '-v' '-w' '/tmp/graph15033320213824949234.weights' '-q' '0' '-e' '0.001'
[2024-05-28 01:12:00] [INFO ] Decomposing Gal with order
[2024-05-28 01:12:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 01:12:00] [INFO ] Flatten gal took : 22 ms
[2024-05-28 01:12:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 01:12:00] [INFO ] Time to serialize gal into /tmp/LTL9457254542573951063.gal : 1 ms
[2024-05-28 01:12:00] [INFO ] Time to serialize properties into /tmp/LTL14419011912698863199.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9457254542573951063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14419011912698863199.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((u1.move>=1)&&(u3.r_active>=1))"))||((F("((u1.move>=1)&&(u3.r_active>=1))"))U((F("((u0.initialize>=1)&&(u3.r_stopped>=1))"))U(...178
Formula 0 simplified : F!"((u1.move>=1)&&(u3.r_active>=1))" & (G!"((u1.move>=1)&&(u3.r_active>=1))" R (G!"((u0.initialize>=1)&&(u3.r_stopped>=1))" R X!"(u1...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4964184524375413229
[2024-05-28 01:12:15] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4964184524375413229
Running compilation step : cd /tmp/ltsmin4964184524375413229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin4964184524375413229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4964184524375413229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 95375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 8 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-28 01:12:30] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:12:30] [INFO ] Implicit Places using invariants in 34 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/11 transitions.
Graph (trivial) has 3 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 6 ms. Remains 4 /6 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 01:12:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:12:30] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 01:12:30] [INFO ] Invariant cache hit.
[2024-05-28 01:12:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 01:12:30] [INFO ] Implicit Places using invariants and state equation in 33 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 : 4/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3 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 115 ms.
Product exploration explored 100000 steps with 0 reset in 123 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 4002 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1334 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-28 01:12:31] [INFO ] Invariant cache hit.
[2024-05-28 01:12:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 01:12:31] [INFO ] Invariant cache hit.
[2024-05-28 01:12:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 01:12:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 01:12:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:12:31] [INFO ] Invariant cache hit.
[2024-05-28 01:12:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 4/4 places, 4/4 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1361 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 4002 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1334 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 180 ms.
Built C files in :
/tmp/ltsmin15129414787185624826
[2024-05-28 01:12:33] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-28 01:12:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:33] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-28 01:12:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:33] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-28 01:12:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15129414787185624826
Running compilation step : cd /tmp/ltsmin15129414787185624826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin15129414787185624826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15129414787185624826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11016364987156659934.hoa' '--buchi-type=spotba'
LTSmin run took 378 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-LTLFireability-04 finished in 3393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (G((p0&&F(p1))) U p2)))'
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
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 3 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:12:33] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 01:12:33] [INFO ] Implicit Places using invariants in 29 ms returned [5, 11]
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 : 12/15 places, 11/11 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 9 transition count 8
Applied a total of 6 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-28 01:12:33] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 01:12:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 01:12:33] [INFO ] Invariant cache hit.
[2024-05-28 01:12:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/15 places, 8/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 9/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p2), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s6 1)), p0:(GEQ s8 1), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 16961 reset in 80 ms.
Stack based approach found an accepted trace after 48 steps with 10 reset with depth 3 and stack size 3 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-06 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 1 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-28 01:12:34] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:12:34] [INFO ] Implicit Places using invariants in 28 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/11 transitions.
Graph (trivial) has 2 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 01:12:34] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:12:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 01:12:34] [INFO ] Invariant cache hit.
[2024-05-28 01:12:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 01:12:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 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 89 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-07 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 s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-07 finished in 146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(((F(p1)&&X(p2))||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
[2024-05-28 01:12:34] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:12:34] [INFO ] Implicit Places using invariants in 38 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 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
[2024-05-28 01:12:34] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:12:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 01:12:34] [INFO ] Invariant cache hit.
[2024-05-28 01:12:34] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 56 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 412 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s5 1)), p1:(LT s8 1), p2:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 78 ms.
Product exploration explored 100000 steps with 20000 reset in 91 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 p0 p1 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 557 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Incomplete random walk after 12008 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1715 ) properties (out of 4) seen :0
Finished Best-First random walk after 68 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Support contains 3 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 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-28 01:12:36] [INFO ] Invariant cache hit.
[2024-05-28 01:12:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 01:12:36] [INFO ] Invariant cache hit.
[2024-05-28 01:12:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-28 01:12:36] [INFO ] Invariant cache hit.
[2024-05-28 01:12:36] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 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 p0 p1 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 1424 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1602 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Incomplete random walk after 12012 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1092 ) properties (out of 4) seen :0
Finished Best-First random walk after 69 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Product exploration explored 100000 steps with 20000 reset in 50 ms.
Product exploration explored 100000 steps with 20000 reset in 58 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 11 transition count 11
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 3 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 11/10 (removed -1) transitions.
[2024-05-28 01:12:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2024-05-28 01:12:41] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:12:41] [INFO ] Dead Transitions using invariants and state equation in 24 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 34 ms. Remains : 11/11 places, 11/10 transitions.
Built C files in :
/tmp/ltsmin2263884290107384431
[2024-05-28 01:12:41] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2263884290107384431
Running compilation step : cd /tmp/ltsmin2263884290107384431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin2263884290107384431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2263884290107384431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12901304296418568318.hoa' '--buchi-type=spotba'
LTSmin run took 154 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-LTLFireability-08 finished in 7251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!p0)) U G(p1))))'
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
[2024-05-28 01:12:41] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 01:12:41] [INFO ] Implicit Places using invariants in 25 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p1), p0, (AND p0 (NOT p1)), p0, true, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (NOT (AND (GEQ s11 1) (GEQ s12 1))) (AND (GEQ s11 1) (GEQ s12 1) (GEQ s3 1) (GEQ s5 1))), p0:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 81 steps with 14 reset in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-09 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X((X(!p0) U p1))))&&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 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
[2024-05-28 01:12:42] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants in 24 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 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 6 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 01:12:42] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 01:12:42] [INFO ] Invariant cache hit.
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 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 270 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s5 1)), p1:(GEQ s7 1), p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9061 reset in 72 ms.
Stack based approach found an accepted trace after 26 steps with 2 reset with depth 6 and stack size 6 in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-10 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 5 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-28 01:12:42] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants in 25 ms returned [4, 9, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 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 1 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 3 ms. Remains 5 /8 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 01:12:42] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 01:12:42] [INFO ] Invariant cache hit.
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 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 87 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-11 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 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-11 finished in 145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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 3 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:12:42] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants in 27 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 01:12:42] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 01:12:42] [INFO ] Invariant cache hit.
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 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 80 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s4 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 4 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-12 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(!p1 U (p2||G(!p1))))))'
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 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 01:12:42] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:12:42] [INFO ] Implicit Places using invariants in 24 ms returned [5]
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.
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 29 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (LT s5 1) (LT s6 1)), p1:(GEQ s6 1), p0:(AND (GEQ s6 1) (GEQ s9 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-13 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
[2024-05-28 01:12:43] [INFO ] Invariant cache hit.
[2024-05-28 01:12:43] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
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 28 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
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={0} source=1 dest: 1}]], initial=0, aps=[p0:(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][false, false]]
Product exploration explored 100000 steps with 3031 reset in 74 ms.
Stack based approach found an accepted trace after 46 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLFireability-15 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p0) U (F(p1) U X(p2)))))'
[2024-05-28 01:12:43] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4773972372240643860
[2024-05-28 01:12:43] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-28 01:12:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:43] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-28 01:12:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:43] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-28 01:12:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:12:43] [INFO ] Applying decomposition
[2024-05-28 01:12:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4773972372240643860
Running compilation step : cd /tmp/ltsmin4773972372240643860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 01:12:43] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2411857026486511420.txt' '-o' '/tmp/graph2411857026486511420.bin' '-w' '/tmp/graph2411857026486511420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2411857026486511420.bin' '-l' '-1' '-v' '-w' '/tmp/graph2411857026486511420.weights' '-q' '0' '-e' '0.001'
[2024-05-28 01:12:43] [INFO ] Decomposing Gal with order
[2024-05-28 01:12:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 01:12:43] [INFO ] Flatten gal took : 2 ms
[2024-05-28 01:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 01:12:43] [INFO ] Time to serialize gal into /tmp/LTLFireability10918596639433844018.gal : 1 ms
[2024-05-28 01:12:43] [INFO ] Time to serialize properties into /tmp/LTLFireability13548621404399160191.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10918596639433844018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13548621404399160191.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((G("((i0.u1.move>=1)&&(u2.r_active>=1))"))||((F("((i0.u1.move>=1)&&(u2.r_active>=1))"))U((F("((i2.u0.initialize>=1)&&(u2.r_stopped>...190
Formula 0 simplified : F!"((i0.u1.move>=1)&&(u2.r_active>=1))" & (G!"((i0.u1.move>=1)&&(u2.r_active>=1))" R (G!"((i2.u0.initialize>=1)&&(u2.r_stopped>=1))"...180
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin4773972372240643860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4773972372240643860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: ([]((LTLAPp0==true))||(<>((LTLAPp0==true)) U (<>((LTLAPp1==true)) U X((LTLAPp2==true)))))
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: "([]((LTLAPp0==true))||(<>((LTLAPp0==true)) U (<>((LTLAPp1==true)) U X((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.075: DFS-FIFO for weak LTL, using special progress label 15
pins2lts-mc-linux64( 0/ 8), 0.076: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.076: State length is 16, there are 28 groups
pins2lts-mc-linux64( 0/ 8), 0.076: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.076: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.076: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.076: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.095: ~92 levels ~960 states ~2048 transitions
pins2lts-mc-linux64( 6/ 8), 0.120: ~187 levels ~1920 states ~4312 transitions
pins2lts-mc-linux64( 6/ 8), 0.169: ~378 levels ~3840 states ~8896 transitions
pins2lts-mc-linux64( 1/ 8), 0.269: ~723 levels ~7680 states ~17136 transitions
pins2lts-mc-linux64( 3/ 8), 0.422: ~1447 levels ~15360 states ~34088 transitions
pins2lts-mc-linux64( 1/ 8), 0.612: ~2904 levels ~30720 states ~69376 transitions
pins2lts-mc-linux64( 5/ 8), 0.849: ~5809 levels ~61440 states ~138888 transitions
pins2lts-mc-linux64( 2/ 8), 1.270: ~11099 levels ~122880 states ~313400 transitions
pins2lts-mc-linux64( 2/ 8), 1.704: ~17963 levels ~245760 states ~650008 transitions
pins2lts-mc-linux64( 1/ 8), 2.006: ~18006 levels ~491520 states ~1104480 transitions
pins2lts-mc-linux64( 6/ 8), 2.399: ~18041 levels ~983040 states ~2017512 transitions
pins2lts-mc-linux64( 6/ 8), 3.069: ~18041 levels ~1966080 states ~3887888 transitions
pins2lts-mc-linux64( 6/ 8), 4.370: ~18041 levels ~3932160 states ~7671328 transitions
pins2lts-mc-linux64( 6/ 8), 7.204: ~18041 levels ~7864320 states ~15298120 transitions
pins2lts-mc-linux64( 4/ 8), 13.327: ~18023 levels ~15728640 states ~30643656 transitions
pins2lts-mc-linux64( 4/ 8), 26.494: ~18023 levels ~31457280 states ~61503688 transitions
pins2lts-mc-linux64( 3/ 8), 31.314: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 31.369:
pins2lts-mc-linux64( 0/ 8), 31.369: mean standard work distribution: 1.6% (states) 1.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 31.369:
pins2lts-mc-linux64( 0/ 8), 31.369: Explored 32576023 states 64067770 transitions, fanout: 1.967
pins2lts-mc-linux64( 0/ 8), 31.369: Total exploration time 31.290 sec (31.220 sec minimum, 31.259 sec on average)
pins2lts-mc-linux64( 0/ 8), 31.369: States per second: 1041100, Transitions per second: 2047548
pins2lts-mc-linux64( 0/ 8), 31.369:
pins2lts-mc-linux64( 0/ 8), 31.369: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 31.369: Redundant explorations: -0.6018
pins2lts-mc-linux64( 0/ 8), 31.369:
pins2lts-mc-linux64( 0/ 8), 31.369: Queue width: 8B, total height: 144084, memory: 1.10MB
pins2lts-mc-linux64( 0/ 8), 31.369: Tree memory: 506.0MB, 16.2 B/state, compr.: 24.5%
pins2lts-mc-linux64( 0/ 8), 31.369: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 31.369: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 31.369: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 31.369: Est. total memory use: 507.1MB (~1025.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4773972372240643860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4773972372240643860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.
[2024-05-28 01:33:19] [INFO ] Flatten gal took : 2 ms
[2024-05-28 01:33:19] [INFO ] Time to serialize gal into /tmp/LTLFireability9779443000763024787.gal : 1 ms
[2024-05-28 01:33:19] [INFO ] Time to serialize properties into /tmp/LTLFireability14215808146272320972.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9779443000763024787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14215808146272320972.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.202304061127/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.
[2024-05-28 01:53:57] [INFO ] Flatten gal took : 48 ms
[2024-05-28 01:53:57] [INFO ] Input system was already deterministic with 11 transitions.
[2024-05-28 01:53:57] [INFO ] Transformed 15 places.
[2024-05-28 01:53:57] [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
[2024-05-28 01:53:57] [INFO ] Time to serialize gal into /tmp/LTLFireability7177415846089855458.gal : 1 ms
[2024-05-28 01:53:57] [INFO ] Time to serialize properties into /tmp/LTLFireability5446218384639782722.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7177415846089855458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5446218384639782722.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
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: 151836 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16250496 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r351-tall-171679101700148"
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 ;