fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r197-smll-162089451800092
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for RobotManipulation-PT-02000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1639.588 156139.00 227472.00 1054.20 TFFFFTTTTFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.4K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620987414180

Running Version 0
[2021-05-14 10:16:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 10:16:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 10:16:57] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-14 10:16:57] [INFO ] Transformed 15 places.
[2021-05-14 10:16:57] [INFO ] Transformed 11 transitions.
[2021-05-14 10:16:57] [INFO ] Parsed PT model containing 15 places and 11 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 10:16:57] [INFO ] Initial state test concluded for 3 properties.
FORMULA RobotManipulation-PT-02000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 16 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 10:16:57] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-14 10:16:58] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 10:16:58] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-14 10:16:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 10:16:58] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 10:16:58] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-14 10:16:58] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 10:16:58] [INFO ] Flatten gal took : 39 ms
FORMULA RobotManipulation-PT-02000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 10:16:58] [INFO ] Flatten gal took : 8 ms
[2021-05-14 10:16:58] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100030 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=971 ) properties (out of 23) seen :22
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 10:16:58] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-14 10:16:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 10:16:58] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 10:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 10:16:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-14 10:16:58] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 10:16:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 10:16:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 10:16:58] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 10:16:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 10:16:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-14 10:16:58] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 10:16:58] [INFO ] Added : 8 causal constraints over 2 iterations in 36 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 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 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 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 8 place count 10 transition count 8
Applied a total of 8 rules in 21 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-14 10:16:59] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-14 10:16:59] [INFO ] Implicit Places using invariants in 44 ms returned [4, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
[2021-05-14 10:16:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-14 10:16:59] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 10:16:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 8/15 places, 8/11 transitions.
Graph (trivial) has 3 edges and 8 vertex of which 3 / 8 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 8 ms. Remains 6 /8 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 10:16:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 10:16:59] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 10:16:59] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-14 10:16:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-02000-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 3 s2), p1:(LEQ s4 s5)], 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 2473 reset in 557 ms.
Product exploration explored 100000 steps with 2424 reset in 322 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2499 reset in 219 ms.
Product exploration explored 100000 steps with 2551 reset in 225 ms.
[2021-05-14 10:17:01] [INFO ] Flatten gal took : 3 ms
[2021-05-14 10:17:01] [INFO ] Flatten gal took : 2 ms
[2021-05-14 10:17:01] [INFO ] Time to serialize gal into /tmp/LTL16701692938162956505.gal : 2 ms
[2021-05-14 10:17:01] [INFO ] Time to serialize properties into /tmp/LTL1459897161581706379.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16701692938162956505.gal, -t, CGAL, -LTL, /tmp/LTL1459897161581706379.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16701692938162956505.gal -t CGAL -LTL /tmp/LTL1459897161581706379.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(r_moving>=3)"))||(G("(p_rel<=access)"))))
Formula 0 simplified : !(F"(r_moving>=3)" | G"(p_rel<=access)")
Detected timeout of ITS tools.
[2021-05-14 10:17:16] [INFO ] Flatten gal took : 2 ms
[2021-05-14 10:17:16] [INFO ] Applying decomposition
[2021-05-14 10:17:16] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3202746358309451213.txt, -o, /tmp/graph3202746358309451213.bin, -w, /tmp/graph3202746358309451213.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3202746358309451213.bin, -l, -1, -v, -w, /tmp/graph3202746358309451213.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 10:17:16] [INFO ] Decomposing Gal with order
[2021-05-14 10:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:17:16] [INFO ] Flatten gal took : 37 ms
[2021-05-14 10:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-14 10:17:16] [INFO ] Time to serialize gal into /tmp/LTL14681932155772216579.gal : 2 ms
[2021-05-14 10:17:16] [INFO ] Time to serialize properties into /tmp/LTL4326132598305101434.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14681932155772216579.gal, -t, CGAL, -LTL, /tmp/LTL4326132598305101434.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14681932155772216579.gal -t CGAL -LTL /tmp/LTL4326132598305101434.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(gu0.r_moving>=3)"))||(G("(gu1.p_rel<=gu1.access)"))))
Formula 0 simplified : !(F"(gu0.r_moving>=3)" | G"(gu1.p_rel<=gu1.access)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14327036021358244152
[2021-05-14 10:17:31] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14327036021358244152
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14327036021358244152]
Compilation finished in 270 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14327036021358244152]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14327036021358244152]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RobotManipulation-PT-02000-01 finished in 47637 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 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
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 3 with 2 rules applied. Total rules applied 9 place count 10 transition count 7
Applied a total of 9 rules in 8 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-14 10:17:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 10:17:46] [INFO ] Implicit Places using invariants in 27 ms returned [4, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
[2021-05-14 10:17:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 10:17:46] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-14 10:17:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 7/15 places, 7/11 transitions.
Graph (trivial) has 4 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 4
Applied a total of 4 rules in 3 ms. Remains 3 /7 variables (removed 4) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 10:17:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:17:46] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 10:17:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:17:46] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-02 finished in 150 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(F((p0&&F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 3 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-14 10:17:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 10:17:46] [INFO ] Implicit Places using invariants in 16 ms returned [4, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 17 ms to find 3 implicit places.
[2021-05-14 10:17:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-05-14 10:17:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 10:17:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 6/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 6 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 5 transition count 6
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 4 transition count 5
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 4 transition count 5
Applied a total of 4 rules in 4 ms. Remains 4 /6 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-14 10:17:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:17:46] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-14 10:17:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 10:17:46] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s2), p0:(LEQ s3 s2)], 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 3 reset in 365 ms.
Stack based approach found an accepted trace after 28182 steps with 0 reset with depth 28183 and stack size 5209 in 100 ms.
FORMULA RobotManipulation-PT-02000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-04 finished in 653 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((G(p0) U p1)&&X(X(X(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:17:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 10:17:47] [INFO ] Implicit Places using invariants in 42 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 10:17:47] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 10:17:47] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 10:17:47] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-14 10:17:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 318 ms :[p0, p0, (OR (NOT p1) p0), p0, p0, p0, p0, p0]
Running random walk in product with property : RobotManipulation-PT-02000-05 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 4}, { cond=(NOT p1), acceptance={0} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 6}, { cond=p1, acceptance={0} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 1}]], initial=2, aps=[p1:(LEQ s2 s0), p0:(LEQ 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Product exploration explored 100000 steps with 25000 reset in 152 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 338 ms :[p0, p0, (OR (NOT p1) p0), p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 25000 reset in 63 ms.
Product exploration explored 100000 steps with 25000 reset in 171 ms.
[2021-05-14 10:17:49] [INFO ] Flatten gal took : 4 ms
[2021-05-14 10:17:49] [INFO ] Flatten gal took : 3 ms
[2021-05-14 10:17:49] [INFO ] Time to serialize gal into /tmp/LTL8258537385980837405.gal : 1 ms
[2021-05-14 10:17:49] [INFO ] Time to serialize properties into /tmp/LTL14472661908727452198.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8258537385980837405.gal, -t, CGAL, -LTL, /tmp/LTL14472661908727452198.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8258537385980837405.gal -t CGAL -LTL /tmp/LTL14472661908727452198.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((G("(initialized>=2)"))U("(moved<=initialize)"))&&(X(X(X("(initialized<2)")))))))
Formula 0 simplified : !F((G"(initialized>=2)" U "(moved<=initialize)") & XXX"(initialized<2)")
Detected timeout of ITS tools.
[2021-05-14 10:18:04] [INFO ] Flatten gal took : 3 ms
[2021-05-14 10:18:04] [INFO ] Applying decomposition
[2021-05-14 10:18:04] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14158404456575856624.txt, -o, /tmp/graph14158404456575856624.bin, -w, /tmp/graph14158404456575856624.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14158404456575856624.bin, -l, -1, -v, -w, /tmp/graph14158404456575856624.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 10:18:04] [INFO ] Decomposing Gal with order
[2021-05-14 10:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:18:04] [INFO ] Flatten gal took : 3 ms
[2021-05-14 10:18:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 10:18:04] [INFO ] Time to serialize gal into /tmp/LTL1290175875255718632.gal : 1 ms
[2021-05-14 10:18:04] [INFO ] Time to serialize properties into /tmp/LTL7240062534216311973.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1290175875255718632.gal, -t, CGAL, -LTL, /tmp/LTL7240062534216311973.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1290175875255718632.gal -t CGAL -LTL /tmp/LTL7240062534216311973.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((G("(gi1.gu3.initialized>=2)"))U("(gu0.moved<=gu0.initialize)"))&&(X(X(X("(gi1.gu3.initialized<2)")))))))
Formula 0 simplified : !F((G"(gi1.gu3.initialized>=2)" U "(gu0.moved<=gu0.initialize)") & XXX"(gi1.gu3.initialized<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8572597153566534988
[2021-05-14 10:18:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8572597153566534988
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8572597153566534988]
Compilation finished in 148 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8572597153566534988]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((([]((LTLAPp0==true)) U (LTLAPp1==true))&&X(X(X(!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin8572597153566534988]
LTSmin run took 212 ms.
FORMULA RobotManipulation-PT-02000-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-05 finished in 32114 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p1&&F((p2||X(p3))))||G(F(p4))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
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
[2021-05-14 10:18:19] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-14 10:18:19] [INFO ] Implicit Places using invariants in 37 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:18:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 10:18:19] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:18:19] [INFO ] Computed 4 place invariants in 7 ms
[2021-05-14 10:18:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4) (NOT p2) (NOT p3))]
Running random walk in product with property : RobotManipulation-PT-02000-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p4)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p4)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 2 s7) (GT 2 s12)), p1:(GT 1 s8), p4:(OR (GT 3 s1) (GT 2 s12)), p2:(GT 3 s1), p3:(GT 2 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Knowledge obtained : [p0, p1, p4, p2, p3]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4) (NOT p2) (NOT p3))]
Support contains 4 out of 13 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 13/13 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 5 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-14 10:18:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:18:21] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 10:18:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/13 places, 11/11 transitions.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
[2021-05-14 10:18:22] [INFO ] Flatten gal took : 3 ms
[2021-05-14 10:18:22] [INFO ] Flatten gal took : 2 ms
[2021-05-14 10:18:22] [INFO ] Time to serialize gal into /tmp/LTL9076453300628106516.gal : 1 ms
[2021-05-14 10:18:22] [INFO ] Time to serialize properties into /tmp/LTL17975324081965181481.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9076453300628106516.gal, -t, CGAL, -LTL, /tmp/LTL17975324081965181481.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9076453300628106516.gal -t CGAL -LTL /tmp/LTL17975324081965181481.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((("((p_sc>=2)||(p_i2<2))")||(G(F("((move<3)||(p_i2<2))"))))||(("(p_m<1)")&&(F(("(move<3)")||(X("(p_i2<2)")))))))))
Formula 0 simplified : !XF("((p_sc>=2)||(p_i2<2))" | GF"((move<3)||(p_i2<2))" | ("(p_m<1)" & F("(move<3)" | X"(p_i2<2)")))
Detected timeout of ITS tools.
[2021-05-14 10:18:37] [INFO ] Flatten gal took : 4 ms
[2021-05-14 10:18:37] [INFO ] Applying decomposition
[2021-05-14 10:18:37] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8697048602433659273.txt, -o, /tmp/graph8697048602433659273.bin, -w, /tmp/graph8697048602433659273.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8697048602433659273.bin, -l, -1, -v, -w, /tmp/graph8697048602433659273.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 10:18:37] [INFO ] Decomposing Gal with order
[2021-05-14 10:18:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:18:37] [INFO ] Flatten gal took : 3 ms
[2021-05-14 10:18:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 10:18:37] [INFO ] Time to serialize gal into /tmp/LTL5926517398215820776.gal : 1 ms
[2021-05-14 10:18:37] [INFO ] Time to serialize properties into /tmp/LTL10039806884846763519.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5926517398215820776.gal, -t, CGAL, -LTL, /tmp/LTL10039806884846763519.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5926517398215820776.gal -t CGAL -LTL /tmp/LTL10039806884846763519.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((("((u2.p_sc>=2)||(i3.u3.p_i2<2))")||(G(F("((u0.move<3)||(i3.u3.p_i2<2))"))))||(("(u2.p_m<1)")&&(F(("(u0.move<3)")||(X("(i3.u3.p_i2<2)")))))))))
Formula 0 simplified : !XF("((u2.p_sc>=2)||(i3.u3.p_i2<2))" | GF"((u0.move<3)||(i3.u3.p_i2<2))" | ("(u2.p_m<1)" & F("(u0.move<3)" | X"(i3.u3.p_i2<2)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5209215584918414980
[2021-05-14 10:18:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5209215584918414980
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5209215584918414980]
Compilation finished in 161 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5209215584918414980]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([](<>((LTLAPp1==true)))||((LTLAPp2==true)&&<>(((LTLAPp3==true)||X((LTLAPp4==true)))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5209215584918414980]
LTSmin run took 298 ms.
FORMULA RobotManipulation-PT-02000-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-07 finished in 33120 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:18:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 10:18:52] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:18:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 10:18:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:18:52] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 10:18:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-02000-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (LEQ s10 s1) (LEQ s11 s5)), p0:(LEQ s10 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-09 finished in 188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 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 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 3 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-14 10:18:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 10:18:52] [INFO ] Implicit Places using invariants in 25 ms returned [5, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
[2021-05-14 10:18:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-14 10:18:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 10:18:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 9/15 places, 8/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 7 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 0 with 2 rules applied. Total rules applied 5 place count 6 transition count 6
Applied a total of 5 rules in 4 ms. Remains 6 /9 variables (removed 3) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 10:18:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 10:18:52] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 10:18:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s4 s5) (GT 1 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA RobotManipulation-PT-02000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-11 finished in 291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 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 3 with 2 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 3 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-14 10:18:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants in 25 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
[2021-05-14 10:18:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-05-14 10:18:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 6/15 places, 7/11 transitions.
Graph (trivial) has 4 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-14 10:18:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-14 10:18:53] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-12 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 4 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-14 10:18:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants in 32 ms returned [3, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
[2021-05-14 10:18:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-14 10:18:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:18:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 5/15 places, 6/11 transitions.
Graph (trivial) has 4 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 3
Applied a total of 3 rules in 2 ms. Remains 2 /5 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-14 10:18:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-14 10:18:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/15 places, 3/11 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-13 finished in 189 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:18:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants in 22 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 10:18:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 10:18:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 10:18:53] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-02000-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s4), p1:(LEQ s10 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 7 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-14 finished in 277 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1) U X(G((p2||X((p3 U p4)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 10:18:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Implicit Places using invariants in 17 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 10:18:53] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-14 10:18:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 10:18:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 10:18:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 523 ms :[(AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p4), true, (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-02000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p4) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(OR (AND p1 (NOT p4) (NOT p3)) (AND p0 (NOT p4) (NOT p3))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p1 (NOT p2) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p1 p2 (NOT p4) p3) (AND p0 p2 (NOT p4) p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p4)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 9}]], initial=1, aps=[p2:(LEQ 1 s4), p1:(LEQ s2 s6), p0:(AND (GT 2 s8) (LEQ 1 s4)), p4:(AND (LEQ 2 s3) (LEQ 1 s4)), p3:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 61 reset in 184 ms.
Product exploration explored 100000 steps with 196 reset in 318 ms.
Knowledge obtained : [p2, p1, p0, (NOT p4), (NOT p3)]
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p4), true, (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p1)]
Product exploration explored 100000 steps with 260 reset in 104 ms.
Product exploration explored 100000 steps with 61 reset in 161 ms.
Applying partial POR strategy [false, false, false, true, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 512 ms :[(AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p4), true, (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p1)]
Support contains 5 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 11 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 5 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2021-05-14 10:18:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 10:18:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 10:18:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/11 places, 10/11 transitions.
Product exploration explored 100000 steps with 174 reset in 182 ms.
Product exploration explored 100000 steps with 159 reset in 280 ms.
[2021-05-14 10:18:57] [INFO ] Flatten gal took : 2 ms
[2021-05-14 10:18:57] [INFO ] Flatten gal took : 2 ms
[2021-05-14 10:18:57] [INFO ] Time to serialize gal into /tmp/LTL4115753137064083236.gal : 1 ms
[2021-05-14 10:18:57] [INFO ] Time to serialize properties into /tmp/LTL4384654221450796292.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4115753137064083236.gal, -t, CGAL, -LTL, /tmp/LTL4384654221450796292.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4115753137064083236.gal -t CGAL -LTL /tmp/LTL4384654221450796292.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((p_rel<2)&&(r_stopped>=1))")U("(moved<=p_rdy)"))U(X(G(("(r_stopped>=1)")||(X(("(off>=2)")U("((off>=2)&&(r_stopped>=1))"))))))))
Formula 0 simplified : !(("((p_rel<2)&&(r_stopped>=1))" U "(moved<=p_rdy)") U XG("(r_stopped>=1)" | X("(off>=2)" U "((off>=2)&&(r_stopped>=1))")))
Detected timeout of ITS tools.
[2021-05-14 10:19:12] [INFO ] Flatten gal took : 2 ms
[2021-05-14 10:19:12] [INFO ] Applying decomposition
[2021-05-14 10:19:12] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18217542369233754984.txt, -o, /tmp/graph18217542369233754984.bin, -w, /tmp/graph18217542369233754984.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18217542369233754984.bin, -l, -1, -v, -w, /tmp/graph18217542369233754984.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 10:19:12] [INFO ] Decomposing Gal with order
[2021-05-14 10:19:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:19:12] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-14 10:19:12] [INFO ] Flatten gal took : 4 ms
[2021-05-14 10:19:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 10:19:12] [INFO ] Time to serialize gal into /tmp/LTL8827351621753006829.gal : 1 ms
[2021-05-14 10:19:12] [INFO ] Time to serialize properties into /tmp/LTL13441589607864136058.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8827351621753006829.gal, -t, CGAL, -LTL, /tmp/LTL13441589607864136058.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8827351621753006829.gal -t CGAL -LTL /tmp/LTL13441589607864136058.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((gu1.p_rel<2)&&(gi2.gu2.r_stopped>=1))")U("(gu1.moved<=gu1.p_rdy)"))U(X(G(("(gi2.gu2.r_stopped>=1)")||(X(("(gi2.gu2.off>=2)")U("((gi2.gu2.off>=2)&&(gi2.gu2.r_stopped>=1))"))))))))
Formula 0 simplified : !(("((gu1.p_rel<2)&&(gi2.gu2.r_stopped>=1))" U "(gu1.moved<=gu1.p_rdy)") U XG("(gi2.gu2.r_stopped>=1)" | X("(gi2.gu2.off>=2)" U "((gi2.gu2.off>=2)&&(gi2.gu2.r_stopped>=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16277076554144612839
[2021-05-14 10:19:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16277076554144612839
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16277076554144612839]
Compilation finished in 233 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16277076554144612839]
Link finished in 47 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp0==true) U (LTLAPp1==true)) U X([](((LTLAPp2==true)||X(((LTLAPp3==true) U (LTLAPp4==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16277076554144612839]
LTSmin run took 480 ms.
FORMULA RobotManipulation-PT-02000-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-15 finished in 34181 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11984170448853358763
[2021-05-14 10:19:27] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2021-05-14 10:19:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 10:19:27] [INFO ] Applying decomposition
[2021-05-14 10:19:27] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2021-05-14 10:19:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 10:19:27] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2021-05-14 10:19:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 10:19:27] [INFO ] Flatten gal took : 3 ms
[2021-05-14 10:19:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11984170448853358763
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11984170448853358763]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13429558712227289672.txt, -o, /tmp/graph13429558712227289672.bin, -w, /tmp/graph13429558712227289672.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13429558712227289672.bin, -l, -1, -v, -w, /tmp/graph13429558712227289672.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 10:19:27] [INFO ] Decomposing Gal with order
[2021-05-14 10:19:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 10:19:28] [INFO ] Flatten gal took : 4 ms
[2021-05-14 10:19:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 10:19:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality10151378687350274337.gal : 2 ms
[2021-05-14 10:19:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality17513610572794342229.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality10151378687350274337.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17513610572794342229.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality10151378687350274337.gal -t CGAL -LTL /tmp/LTLCardinality17513610572794342229.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(gi0.gu1.r_moving>=3)"))||(G("(gu4.p_rel<=gu4.access)"))))
Formula 0 simplified : !(F"(gi0.gu1.r_moving>=3)" | G"(gu4.p_rel<=gu4.access)")
Compilation finished in 192 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11984170448853358763]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>((LTLAPp0==true))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11984170448853358763]
LTSmin run took 834 ms.
FORMULA RobotManipulation-PT-02000-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620987570319

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RobotManipulation-PT-02000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-162089451800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-02000.tgz
mv RobotManipulation-PT-02000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;