fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r359-smll-167891808400060
Last Updated
May 14, 2023

About the Execution of LoLa+red for RobotManipulation-PT-00200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
338.655 21232.00 35953.00 633.30 FTFTFFTFFFTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 05:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 05:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 05:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 05:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 05:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-00200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678991144098

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 18:25:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 18:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:25:48] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-16 18:25:48] [INFO ] Transformed 15 places.
[2023-03-16 18:25:48] [INFO ] Transformed 11 transitions.
[2023-03-16 18:25:48] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-00200-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00200-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 18 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 18:25:48] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-16 18:25:48] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-16 18:25:48] [INFO ] Invariant cache hit.
[2023-03-16 18:25:48] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-16 18:25:48] [INFO ] Invariant cache hit.
[2023-03-16 18:25:48] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 18:25:49] [INFO ] Flatten gal took : 29 ms
[2023-03-16 18:25:49] [INFO ] Flatten gal took : 9 ms
[2023-03-16 18:25:49] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10030 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=213 ) properties (out of 14) seen :12
Finished Best-First random walk after 20 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=6 )
FORMULA RobotManipulation-PT-00200-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RobotManipulation-PT-00200-LTLFireability-00 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p1) U X(p2))))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
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
Applied a total of 5 rules in 14 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-16 18:25:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 18:25:49] [INFO ] Implicit Places using invariants in 48 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/15 places, 9/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 11 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 10 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 9 transition count 7
Applied a total of 4 rules in 4 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-16 18:25:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 18:25:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 18:25:50] [INFO ] Invariant cache hit.
[2023-03-16 18:25:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/15 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 9/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 521 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1)), p1:(AND (GEQ s7 1) (GEQ s8 1)), p2:(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 23107 reset in 545 ms.
Product exploration explored 100000 steps with 23184 reset in 331 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 539 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Finished random walk after 5218 steps, including 1 resets, run visited all 5 properties in 6 ms. (steps per millisecond=869 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 767 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
[2023-03-16 18:25:53] [INFO ] Invariant cache hit.
[2023-03-16 18:25:53] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2023-03-16 18:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 18:25:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 18:25:53] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 18:25:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 18:25:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 18:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 18:25:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 18:25:53] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 18:25:53] [INFO ] Added : 5 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-16 18:25:53] [INFO ] Invariant cache hit.
[2023-03-16 18:25:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 18:25:53] [INFO ] Invariant cache hit.
[2023-03-16 18:25:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-16 18:25:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 18:25:53] [INFO ] Invariant cache hit.
[2023-03-16 18:25:53] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 9/9 places, 7/7 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 p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 630 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Finished random walk after 3209 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=641 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 792 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
[2023-03-16 18:25:56] [INFO ] Invariant cache hit.
[2023-03-16 18:25:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-16 18:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 18:25:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-16 18:25:56] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 18:25:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 18:25:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-16 18:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 18:25:56] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 18:25:56] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 18:25:56] [INFO ] Added : 5 causal constraints over 2 iterations in 19 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 23295 reset in 293 ms.
Product exploration explored 100000 steps with 23145 reset in 242 ms.
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-16 18:25:57] [INFO ] Invariant cache hit.
[2023-03-16 18:25:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 18:25:57] [INFO ] Invariant cache hit.
[2023-03-16 18:25:57] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-16 18:25:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 18:25:57] [INFO ] Invariant cache hit.
[2023-03-16 18:25:57] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 9/9 places, 7/7 transitions.
Treatment of property RobotManipulation-PT-00200-LTLFireability-03 finished in 7441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&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 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2023-03-16 18:25:57] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-16 18:25:57] [INFO ] Implicit Places using invariants in 45 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 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 5 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-16 18:25:57] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 18:25:57] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 18:25:57] [INFO ] Invariant cache hit.
[2023-03-16 18:25:57] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 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 129 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s6 1), p1:(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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00200-LTLFireability-04 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(G(p1)&&F((p0||G(!p1))))))'
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 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 18:25:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 18:25:57] [INFO ] Implicit Places using invariants in 38 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 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
[2023-03-16 18:25:57] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-16 18:25:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 18:25:57] [INFO ] Invariant cache hit.
[2023-03-16 18:25:57] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 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 122 ms. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p0)), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1)), p0:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00200-LTLFireability-05 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 5 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-16 18:25:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 18:25:58] [INFO ] Implicit Places using invariants in 37 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 6 transition count 6
Applied a total of 3 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 18:25:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 18:25:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 18:25:58] [INFO ] Invariant cache hit.
[2023-03-16 18:25:58] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s3 1)), p1:(OR (LT s0 1) (LT s3 1))], nbAcceptance=2, 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 232 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-00200-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00200-LTLFireability-07 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 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
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 3 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-16 18:25:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 18:25:58] [INFO ] Implicit Places using invariants in 40 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 8/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 6 transition count 6
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 6
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 4 transition count 5
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 4 transition count 5
Applied a total of 6 rules in 5 ms. Remains 4 /7 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-16 18:25:58] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 18:25:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-16 18:25:58] [INFO ] Invariant cache hit.
[2023-03-16 18:25:58] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 5/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 4/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 116 ms.
Stack based approach found an accepted trace after 7 steps with 1 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RobotManipulation-PT-00200-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00200-LTLFireability-08 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||G(p1))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 7 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-16 18:25:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 18:25:58] [INFO ] Implicit Places using invariants in 40 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 6 transition count 6
Applied a total of 3 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-16 18:25:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 18:25:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 18:25:58] [INFO ] Invariant cache hit.
[2023-03-16 18:25:59] [INFO ] Implicit Places using invariants and state equation in 32 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 : 6/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s3 1)), p0:(OR (LT s1 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13498 reset in 163 ms.
Stack based approach found an accepted trace after 15 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA RobotManipulation-PT-00200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00200-LTLFireability-09 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||X((p1||G((!p0||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 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
[2023-03-16 18:25:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 18:25:59] [INFO ] Implicit Places using invariants in 54 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 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 66 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s5 1)), p1:(GEQ s10 1), p2:(AND (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 129 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)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00200-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00200-LTLFireability-10 finished in 643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(X(X(X(F((X(p2)&&p1))))))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
[2023-03-16 18:25:59] [INFO ] Invariant cache hit.
[2023-03-16 18:25:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-16 18:25:59] [INFO ] Invariant cache hit.
[2023-03-16 18:25:59] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-16 18:25:59] [INFO ] Invariant cache hit.
[2023-03-16 18:26:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 11/11 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 14/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 708 ms :[(NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 5}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 8}], [{ cond=p0, acceptance={} source=10 dest: 7}, { cond=(NOT p0), acceptance={} source=10 dest: 9}]], initial=10, aps=[p1:(AND (GEQ s12 1) (GEQ s13 1)), p2:(OR (LT s1 1) (LT s5 1)), p0:(AND (GEQ s7 1) (GEQ s10 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]]
Product exploration explored 100000 steps with 12299 reset in 169 ms.
Stack based approach found an accepted trace after 641 steps with 81 reset with depth 11 and stack size 11 in 2 ms.
FORMULA RobotManipulation-PT-00200-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00200-LTLFireability-11 finished in 1061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!p0)))&&F(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 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-16 18:26:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 18:26:01] [INFO ] Implicit Places using invariants in 51 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 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 0 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 54 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) p0), p0, (NOT p1), p0, true]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s10 1) (AND (GEQ s2 1) (GEQ s9 1))), p0:(OR (LT s1 1) (LT 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 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00200-LTLFireability-12 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(!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 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 6 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-16 18:26:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 18:26:01] [INFO ] Implicit Places using invariants in 67 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/15 places, 8/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 5 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-16 18:26:01] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 18:26:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 18:26:01] [INFO ] Invariant cache hit.
[2023-03-16 18:26:01] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 8/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : RobotManipulation-PT-00200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1)), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1685 reset in 214 ms.
Stack based approach found an accepted trace after 13 steps with 1 reset with depth 10 and stack size 10 in 1 ms.
FORMULA RobotManipulation-PT-00200-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00200-LTLFireability-13 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 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
[2023-03-16 18:26:01] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-16 18:26:01] [INFO ] Implicit Places using invariants in 40 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 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 45 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00200-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:(AND (GEQ s10 1) (GEQ s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15146 reset in 182 ms.
Product exploration explored 100000 steps with 15001 reset in 170 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 8026 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1003 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
// Phase 1: matrix 11 rows 12 cols
[2023-03-16 18:26:02] [INFO ] Computed 3 place invariants in 1 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RobotManipulation-PT-00200-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00200-LTLFireability-15 finished in 1217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p1) U X(p2))))))'
[2023-03-16 18:26:03] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:26:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 18:26:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 1 ms.
Total runtime 15508 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RobotManipulation-PT-00200
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA RobotManipulation-PT-00200-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678991165330

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 RobotManipulation-PT-00200-LTLFireability-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for RobotManipulation-PT-00200-LTLFireability-03
lola: result : true
lola: markings : 325607
lola: fired transitions : 731803
lola: time used : 1.000000
lola: memory pages used : 3
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
RobotManipulation-PT-00200-LTLFireability-03: LTL true LTL model checker


Time elapsed: 1 secs. Pages in use: 3

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-00200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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