fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r351-tall-171679101700128
Last Updated
July 7, 2024

About the Execution of 2023-gold for RobotManipulation-PT-00100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
337.048 9915.00 12997.00 1005.60 FFFTFFTFFFTFTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-00100-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-00100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716858338699

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-00100
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 01:05:41] [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:05:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:05:41] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2024-05-28 01:05:41] [INFO ] Transformed 15 places.
[2024-05-28 01:05:41] [INFO ] Transformed 11 transitions.
[2024-05-28 01:05:41] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA RobotManipulation-PT-00100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00100-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00100-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00100-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 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 9 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:05:41] [INFO ] Computed 6 invariants in 7 ms
[2024-05-28 01:05:42] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-28 01:05:42] [INFO ] Invariant cache hit.
[2024-05-28 01:05:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2024-05-28 01:05:42] [INFO ] Invariant cache hit.
[2024-05-28 01:05:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 14 out of 15 places after structural reductions.
[2024-05-28 01:05:42] [INFO ] Flatten gal took : 14 ms
[2024-05-28 01:05:42] [INFO ] Flatten gal took : 4 ms
[2024-05-28 01:05:42] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 6240 steps, including 1 resets, run visited all 13 properties in 18 ms. (steps per millisecond=346 )
Parikh walk visited 0 properties in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G((F(((G(p2)&&p1)||p0)) U (G(p3) U p4))))'
Support contains 8 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-28 01:05:42] [INFO ] Invariant cache hit.
[2024-05-28 01:05:42] [INFO ] Implicit Places using invariants in 27 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34 ms. Remains : 14/15 places, 11/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 453 ms :[(NOT p4), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p4), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(NOT p4), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p4) p3 (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p4) p3 (NOT p0) p1 p2), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(NOT p4), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p4) p3 (NOT p0) (NOT p1)) (AND (NOT p4) p3 (NOT p0) (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p4) p3 (NOT p0) p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p2))), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0) p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p4:(GEQ s10 1), p3:(AND (GEQ s12 1) (GEQ s13 1)), p0:(OR (GEQ s7 1) (AND (GEQ s3 1) (GEQ s5 1))), p1:(AND (GEQ s2 1) (GEQ s9 1)), p2:(AND (GEQ s2 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 13140 reset in 245 ms.
Stack based approach found an accepted trace after 136 steps with 15 reset with depth 9 and stack size 9 in 1 ms.
FORMULA RobotManipulation-PT-00100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLFireability-00 finished in 797 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(F((!(F(p0) U !p1)&&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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 15 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:05:43] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:05:43] [INFO ] Implicit Places using invariants in 37 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 5 transition count 5
Applied a total of 4 rules in 3 ms. Remains 5 /7 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 01:05:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:05:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 01:05:43] [INFO ] Invariant cache hit.
[2024-05-28 01:05:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 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 113 ms. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 772 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(NOT p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLFireability-02 finished in 1016 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) U p1)||p2) U (X(p2)||!p0)))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 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:05:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 01:05:44] [INFO ] Implicit Places using invariants in 31 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 14/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 451 ms :[true, (OR (NOT p0) p2), p2, (OR (NOT p0) p2), (AND p0 p1), (AND p0 p1 p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (AND p0 p2), (AND p0 p2), p0]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 8}], [{ cond=(OR p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 10}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 8}, { cond=(AND p2 p0 p1), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 1}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND p2 p0), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=9 dest: 8}, { cond=(AND p2 p0), acceptance={} source=9 dest: 10}], [{ cond=p0, acceptance={0} source=10 dest: 10}]], initial=6, aps=[p0:(AND (GEQ s12 1) (GEQ s13 1)), p2:(AND (GEQ s1 1) (GEQ s5 1)), p1:(AND (GEQ s2 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, 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-00100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-LTLFireability-04 finished in 512 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)||X(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:05:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants in 26 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 : 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:05:45] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 01:05:45] [INFO ] Invariant cache hit.
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 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 93 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s3 1) (LT s5 1)), p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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]]
Product exploration explored 100000 steps with 50000 reset in 53 ms.
Product exploration explored 100000 steps with 50000 reset in 65 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00100-LTLFireability-06 finished in 422 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((p0&&G(F(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 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:05:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants in 25 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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:05:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 01:05:45] [INFO ] Invariant cache hit.
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 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 81 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s8 1), p1:(AND (GEQ s1 1) (GEQ s5 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-LTLFireability-07 finished in 277 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 U (p1||X(p0)))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-28 01:05:45] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants in 33 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 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:05:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 01:05:45] [INFO ] Invariant cache hit.
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 66 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 103 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR p1 p0), acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1)), p1:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2152 steps with 0 reset in 16 ms.
FORMULA RobotManipulation-PT-00100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00100-LTLFireability-09 finished in 226 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||F(!p1)))))'
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 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 4 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:05:45] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 01:05:45] [INFO ] Implicit Places using invariants in 22 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 7/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28 ms. Remains : 8/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 783 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1)), p1:(OR (LT s2 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50 reset in 74 ms.
Stack based approach found an accepted trace after 29 steps with 2 reset with depth 12 and stack size 12 in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLFireability-11 finished in 905 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)||G(p1)))'
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 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 4 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-05-28 01:05:46] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:05:46] [INFO ] Implicit Places using invariants in 29 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 8/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36 ms. Remains : 9/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s4 1)), p1:(AND (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9809 reset in 62 ms.
Stack based approach found an accepted trace after 58 steps with 4 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLFireability-13 finished in 206 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((!X(!G((p0 U p1))) U p2)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 3 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-28 01:05:47] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 01:05:47] [INFO ] Implicit Places using invariants in 26 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 7/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 8/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Product exploration explored 100000 steps with 50000 reset in 58 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 : [(NOT p2), (X p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00100-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00100-LTLFireability-14 finished in 202 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) U G(p1)))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 3 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-28 01:05:47] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 01:05:47] [INFO ] Implicit Places using invariants in 30 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 9/11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 7
Applied a total of 6 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 01:05:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 01:05:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 01:05:47] [INFO ] Invariant cache hit.
[2024-05-28 01:05:47] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/15 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 7/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s6 1)), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7892 reset in 56 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RobotManipulation-PT-00100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00100-LTLFireability-15 finished in 252 ms.
All properties solved by simple procedures.
Total runtime 6090 ms.

BK_STOP 1716858348614

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-00100"
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-00100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r351-tall-171679101700128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00100.tgz
mv RobotManipulation-PT-00100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;