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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16249.071 3600000.00 4056283.00 25268.30 TTFFFFT?FFFFTFFF 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-162089451800084.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-01000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089451800084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K 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.8K 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.2K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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.3K 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-01000-00
FORMULA_NAME RobotManipulation-PT-01000-01
FORMULA_NAME RobotManipulation-PT-01000-02
FORMULA_NAME RobotManipulation-PT-01000-03
FORMULA_NAME RobotManipulation-PT-01000-04
FORMULA_NAME RobotManipulation-PT-01000-05
FORMULA_NAME RobotManipulation-PT-01000-06
FORMULA_NAME RobotManipulation-PT-01000-07
FORMULA_NAME RobotManipulation-PT-01000-08
FORMULA_NAME RobotManipulation-PT-01000-09
FORMULA_NAME RobotManipulation-PT-01000-10
FORMULA_NAME RobotManipulation-PT-01000-11
FORMULA_NAME RobotManipulation-PT-01000-12
FORMULA_NAME RobotManipulation-PT-01000-13
FORMULA_NAME RobotManipulation-PT-01000-14
FORMULA_NAME RobotManipulation-PT-01000-15

=== Now, execution of the tool begins

BK_START 1620980141679

Running Version 0
[2021-05-14 08:15:44] [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 08:15:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:15:44] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-14 08:15:44] [INFO ] Transformed 15 places.
[2021-05-14 08:15:44] [INFO ] Transformed 11 transitions.
[2021-05-14 08:15:44] [INFO ] Parsed PT model containing 15 places and 11 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:15:44] [INFO ] Initial state test concluded for 3 properties.
FORMULA RobotManipulation-PT-01000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 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
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 14 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:15:44] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-14 08:15:44] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:15:44] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-14 08:15:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:15:44] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-14 08:15:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 11/11 transitions.
[2021-05-14 08:15:45] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 08:15:45] [INFO ] Flatten gal took : 26 ms
FORMULA RobotManipulation-PT-01000-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:15:45] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:15:45] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100061 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=1725 ) properties (out of 24) seen :23
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:15:45] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-14 08:15:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 08:15:45] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-05-14 08:15:45] [INFO ] Initial state test concluded for 1 properties.
FORMULA RobotManipulation-PT-01000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((((p0&&G(p1)&&F(p2)) U p3)||X(X(F(p3))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:15:45] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-14 08:15:45] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:15:45] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-14 08:15:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:15:45] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-14 08:15:45] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 559 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : RobotManipulation-PT-01000-01 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0 p1 p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=0 dest: 5}], [{ cond=(AND p3 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p3 p1 p2), acceptance={} source=1 dest: 4}, { cond=(OR (NOT p3) (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p2), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 7}], [{ cond=(AND p3 p1), acceptance={} source=3 dest: 4}, { cond=(OR (NOT p3) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=7 dest: 7}]], initial=6, aps=[p3:(LEQ s10 s11), p0:(LEQ 1 s9), p1:(LEQ 3 s6), p2:(LEQ s5 s0)], 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Knowledge obtained : [p3, (NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 345 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Applying partial POR strategy [false, false, true, false, true, false, false, true]
Stuttering acceptance computed with spot in 363 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (NOT p3)]
Support contains 6 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 14/14 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 11 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-14 08:15:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:15:48] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-14 08:15:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 11/11 transitions.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Product exploration explored 100000 steps with 50000 reset in 263 ms.
[2021-05-14 08:15:48] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:15:48] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:15:48] [INFO ] Time to serialize gal into /tmp/LTL9204739077553132572.gal : 89 ms
[2021-05-14 08:15:48] [INFO ] Time to serialize properties into /tmp/LTL7785204407502968594.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/LTL9204739077553132572.gal, -t, CGAL, -LTL, /tmp/LTL7785204407502968594.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/LTL9204739077553132572.gal -t CGAL -LTL /tmp/LTL7785204407502968594.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((((("(p_m>=1)")&&(G("(r_moving>=3)")))&&(F("(r_active<=initialize)")))U("(p_rel<=access)"))||(X(X(F("(p_rel<=access)")))))))
Formula 0 simplified : !X((("(p_m>=1)" & G"(r_moving>=3)" & F"(r_active<=initialize)") U "(p_rel<=access)") | XXF"(p_rel<=access)")
Detected timeout of ITS tools.
[2021-05-14 08:16:03] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:16:03] [INFO ] Applying decomposition
[2021-05-14 08:16:03] [INFO ] Flatten gal took : 3 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/graph7426357306890110459.txt, -o, /tmp/graph7426357306890110459.bin, -w, /tmp/graph7426357306890110459.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/graph7426357306890110459.bin, -l, -1, -v, -w, /tmp/graph7426357306890110459.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:16:04] [INFO ] Decomposing Gal with order
[2021-05-14 08:16:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:16:04] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-14 08:16:04] [INFO ] Flatten gal took : 71 ms
[2021-05-14 08:16:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2021-05-14 08:16:04] [INFO ] Time to serialize gal into /tmp/LTL11682662100137549606.gal : 2 ms
[2021-05-14 08:16:04] [INFO ] Time to serialize properties into /tmp/LTL18330657393784008947.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/LTL11682662100137549606.gal, -t, CGAL, -LTL, /tmp/LTL18330657393784008947.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/LTL11682662100137549606.gal -t CGAL -LTL /tmp/LTL18330657393784008947.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((((("(gi1.gi1.gu3.p_m>=1)")&&(G("(gi1.gi1.gu2.r_moving>=3)")))&&(F("(gu0.r_active<=gu0.initialize)")))U("(gu4.p_rel<=gu4.access)"))||(X(X(F("(gu4.p_rel<=gu4.access)")))))))
Formula 0 simplified : !X((("(gi1.gi1.gu3.p_m>=1)" & G"(gi1.gi1.gu2.r_moving>=3)" & F"(gu0.r_active<=gu0.initialize)") U "(gu4.p_rel<=gu4.access)") | XXF"(gu4.p_rel<=gu4.access)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12638287859459066599
[2021-05-14 08:16:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12638287859459066599
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/ltsmin12638287859459066599]
Compilation finished in 344 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12638287859459066599]
Link finished in 53 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(((((LTLAPp0==true)&&[]((LTLAPp1==true))&&<>((LTLAPp2==true))) U (LTLAPp3==true))||X(X(<>((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12638287859459066599]
LTSmin run took 286 ms.
FORMULA RobotManipulation-PT-01000-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-01000-01 finished in 34425 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X((X(X((!p0&&G(p1)))) U (p0&&X(X((!p0&&G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:16:19] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 08:16:19] [INFO ] Implicit Places using invariants in 56 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 08:16:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 08:16:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 12/14 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 3 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 08:16:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 08:16:19] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 08:16:19] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 08:16:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), true, (OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-01000-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 s4), p1:(LEQ s8 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27422 steps with 0 reset in 54 ms.
FORMULA RobotManipulation-PT-01000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-02 finished in 461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 08:16:20] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 08:16:20] [INFO ] Implicit Places using invariants in 16 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 08:16:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 08:16:20] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 12/14 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.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 08:16:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 08:16:20] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s9 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA RobotManipulation-PT-01000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-03 finished in 246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0) U (X(p1)&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 0 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 08:16:20] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-14 08:16:20] [INFO ] Implicit Places using invariants in 46 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 08:16:20] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 08:16:20] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 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 08:16:20] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 08:16:20] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-01000-04 automaton TGBA [mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 5}, { cond=(AND p2 p0), acceptance={} source=0 dest: 6}, { cond=(AND p2 p0), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={} source=5 dest: 6}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 7}, { cond=(AND p2 p0), acceptance={} source=5 dest: 8}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 5}, { cond=(AND p2 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(LEQ s6 s4), p0:(LEQ s7 s4), p1:(LEQ s8 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40114 reset in 227 ms.
Product exploration explored 100000 steps with 39995 reset in 214 ms.
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 39956 reset in 165 ms.
Product exploration explored 100000 steps with 40031 reset in 204 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p2)]
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 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 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 1 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-14 08:16:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 08:16:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 08:16:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Product exploration explored 100000 steps with 40126 reset in 678 ms.
Product exploration explored 100000 steps with 40010 reset in 330 ms.
[2021-05-14 08:16:23] [INFO ] Flatten gal took : 2 ms
[2021-05-14 08:16:23] [INFO ] Flatten gal took : 2 ms
[2021-05-14 08:16:23] [INFO ] Time to serialize gal into /tmp/LTL9398442572042336622.gal : 1 ms
[2021-05-14 08:16:23] [INFO ] Time to serialize properties into /tmp/LTL5808480625665156059.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/LTL9398442572042336622.gal, -t, CGAL, -LTL, /tmp/LTL5808480625665156059.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/LTL9398442572042336622.gal -t CGAL -LTL /tmp/LTL5808480625665156059.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G("(p_sc<=r_stopped)"))U((X("(p_rel<=moved)"))&&(G("(p_rdy<=r_stopped)"))))))
Formula 0 simplified : !G(G"(p_sc<=r_stopped)" U (X"(p_rel<=moved)" & G"(p_rdy<=r_stopped)"))
Detected timeout of ITS tools.
[2021-05-14 08:16:38] [INFO ] Flatten gal took : 2 ms
[2021-05-14 08:16:38] [INFO ] Applying decomposition
[2021-05-14 08:16:38] [INFO ] Flatten gal took : 3 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/graph7211296118930970957.txt, -o, /tmp/graph7211296118930970957.bin, -w, /tmp/graph7211296118930970957.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/graph7211296118930970957.bin, -l, -1, -v, -w, /tmp/graph7211296118930970957.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:16:39] [INFO ] Decomposing Gal with order
[2021-05-14 08:16:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:16:39] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-14 08:16:39] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:16:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-14 08:16:39] [INFO ] Time to serialize gal into /tmp/LTL1995186415299253569.gal : 1 ms
[2021-05-14 08:16:39] [INFO ] Time to serialize properties into /tmp/LTL1884065556062632618.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/LTL1995186415299253569.gal, -t, CGAL, -LTL, /tmp/LTL1884065556062632618.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/LTL1995186415299253569.gal -t CGAL -LTL /tmp/LTL1884065556062632618.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((G("(gu2.p_sc<=gu2.r_stopped)"))U((X("(gu1.p_rel<=gu1.moved)"))&&(G("(gu2.p_rdy<=gu2.r_stopped)"))))))
Formula 0 simplified : !G(G"(gu2.p_sc<=gu2.r_stopped)" U (X"(gu1.p_rel<=gu1.moved)" & G"(gu2.p_rdy<=gu2.r_stopped)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10370848360184169865
[2021-05-14 08:16:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10370848360184169865
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/ltsmin10370848360184169865]
Compilation finished in 161 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10370848360184169865]
Link finished in 33 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 (X((LTLAPp1==true))&&[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10370848360184169865]
LTSmin run took 456 ms.
FORMULA RobotManipulation-PT-01000-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-01000-04 finished in 34123 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:16:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 08:16:54] [INFO ] Implicit Places using invariants in 39 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 08:16:54] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 08:16:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 12/14 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.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 08:16:54] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 08:16:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-01000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s11), p0:(LEQ s8 s7)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11639 reset in 347 ms.
Stack based approach found an accepted trace after 192 steps with 30 reset with depth 7 and stack size 7 in 1 ms.
FORMULA RobotManipulation-PT-01000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-05 finished in 675 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 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 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 4 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 5 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 5 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 7 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 9 place count 9 transition count 7
Applied a total of 9 rules in 17 ms. Remains 9 /14 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-14 08:16:55] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 08:16:55] [INFO ] Implicit Places using invariants in 25 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
[2021-05-14 08:16:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-14 08:16:55] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 08:16:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 8/14 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 8 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 7 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 3 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-14 08:16:55] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 08:16:55] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-14 08:16:55] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 08:16:55] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/14 places, 5/11 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-07 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 s5 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3 reset in 122 ms.
Product exploration explored 100000 steps with 4 reset in 206 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 73 ms.
Product exploration explored 100000 steps with 2 reset in 166 ms.
[2021-05-14 08:16:56] [INFO ] Flatten gal took : 1 ms
[2021-05-14 08:16:56] [INFO ] Flatten gal took : 1 ms
[2021-05-14 08:16:56] [INFO ] Time to serialize gal into /tmp/LTL16538320916491953892.gal : 0 ms
[2021-05-14 08:16:56] [INFO ] Time to serialize properties into /tmp/LTL2637425960304347057.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/LTL16538320916491953892.gal, -t, CGAL, -LTL, /tmp/LTL2637425960304347057.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/LTL16538320916491953892.gal -t CGAL -LTL /tmp/LTL2637425960304347057.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p_i1<=access)"))))
Formula 0 simplified : !GF"(p_i1<=access)"
Detected timeout of ITS tools.
[2021-05-14 08:17:11] [INFO ] Flatten gal took : 1 ms
[2021-05-14 08:17:11] [INFO ] Applying decomposition
[2021-05-14 08:17:11] [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/graph1949346157164672224.txt, -o, /tmp/graph1949346157164672224.bin, -w, /tmp/graph1949346157164672224.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/graph1949346157164672224.bin, -l, -1, -v, -w, /tmp/graph1949346157164672224.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:17:11] [INFO ] Decomposing Gal with order
[2021-05-14 08:17:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:17:11] [INFO ] Flatten gal took : 2 ms
[2021-05-14 08:17:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 08:17:11] [INFO ] Time to serialize gal into /tmp/LTL10856703288466136784.gal : 0 ms
[2021-05-14 08:17:11] [INFO ] Time to serialize properties into /tmp/LTL12261194325907833023.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/LTL10856703288466136784.gal, -t, CGAL, -LTL, /tmp/LTL12261194325907833023.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/LTL10856703288466136784.gal -t CGAL -LTL /tmp/LTL12261194325907833023.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu1.p_i1<=gu1.access)"))))
Formula 0 simplified : !GF"(gu1.p_i1<=gu1.access)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5653788662118047574
[2021-05-14 08:17:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5653788662118047574
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/ltsmin5653788662118047574]
Compilation finished in 137 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5653788662118047574]
Link finished in 34 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin5653788662118047574]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RobotManipulation-PT-01000-07 finished in 46038 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0)))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 08:17:41] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 08:17:41] [INFO ] Implicit Places using invariants in 34 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 08:17:41] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 08:17:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 11/14 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 08:17:41] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 08:17:41] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 08:17:41] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 08:17:41] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-01000-08 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}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 2}]], initial=4, aps=[p0:(GT s6 s1), p1:(GT 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-01000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-08 finished in 320 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (X(F(p1)) U (p2 U p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 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 13 transition count 11
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 08:17:41] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 08:17:41] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 08:17:41] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-14 08:17:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 08:17:41] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-14 08:17:41] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p3), (NOT p1), (NOT p3)]
Running random walk in product with property : RobotManipulation-PT-01000-09 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(LEQ s11 s5), p0:(OR (LEQ s11 s5) (LEQ s10 s1)), p2:(LEQ 1 s4), p1:(LEQ s10 s1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA RobotManipulation-PT-01000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-09 finished in 513 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 08:17:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 08:17:42] [INFO ] Implicit Places using invariants in 23 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 08:17:42] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 08:17:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 13/14 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 12 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 2 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-14 08:17:42] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 08:17:42] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-14 08:17:42] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 08:17:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-01000-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s9 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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-01000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-10 finished in 206 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 11/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 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 10
Applied a total of 2 rules in 3 ms. Remains 13 /14 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 13 cols
[2021-05-14 08:17:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 08:17:42] [INFO ] Implicit Places using invariants in 21 ms returned [4, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
[2021-05-14 08:17:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 08:17:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 08:17:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 10/14 places, 10/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 7 transition count 7
Applied a total of 6 rules in 4 ms. Remains 7 /10 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 08:17:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 08:17:42] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 08:17:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 08:17:42] [INFO ] Implicit Places using invariants and state equation in 18 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 : 7/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : RobotManipulation-PT-01000-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s5), p1:(GT 2 s6), p2:(GT s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 585 reset in 170 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA RobotManipulation-PT-01000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-01000-15 finished in 372 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9671327657581711375
[2021-05-14 08:17:42] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2021-05-14 08:17:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:17:42] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2021-05-14 08:17:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:17:42] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2021-05-14 08:17:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:17:42] [INFO ] Applying decomposition
[2021-05-14 08:17:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9671327657581711375
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/ltsmin9671327657581711375]
[2021-05-14 08:17:42] [INFO ] Flatten gal took : 3 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/graph15920744033893603523.txt, -o, /tmp/graph15920744033893603523.bin, -w, /tmp/graph15920744033893603523.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/graph15920744033893603523.bin, -l, -1, -v, -w, /tmp/graph15920744033893603523.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:17:42] [INFO ] Decomposing Gal with order
[2021-05-14 08:17:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:17:42] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:17:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 08:17:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality2736791174228670723.gal : 2 ms
[2021-05-14 08:17:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality3072562335214209218.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/LTLCardinality2736791174228670723.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3072562335214209218.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/LTLCardinality2736791174228670723.gal -t CGAL -LTL /tmp/LTLCardinality3072562335214209218.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu4.p_i1<=gu4.access)"))))
Formula 0 simplified : !GF"(gu4.p_i1<=gu4.access)"
Compilation finished in 210 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9671327657581711375]
Link finished in 35 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin9671327657581711375]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.004: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Initializing POR dependencies: labels 12, guards 11
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.013: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.021: There are 14 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.021: State length is 15, there are 14 groups
pins2lts-mc-linux64( 0/ 8), 0.021: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.021: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.021: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.021: Visible groups: 4 / 14, labels: 1 / 14
pins2lts-mc-linux64( 0/ 8), 0.021: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.021: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.173: [Blue] ~106 levels ~960 states ~2504 transitions
pins2lts-mc-linux64( 4/ 8), 0.183: [Blue] ~166 levels ~1920 states ~5032 transitions
pins2lts-mc-linux64( 6/ 8), 0.199: [Blue] ~349 levels ~3840 states ~9256 transitions
pins2lts-mc-linux64( 2/ 8), 0.206: [Blue] ~503 levels ~7680 states ~17832 transitions
pins2lts-mc-linux64( 1/ 8), 0.212: [Blue] ~1920 levels ~15360 states ~24584 transitions
pins2lts-mc-linux64( 1/ 8), 0.233: [Blue] ~3840 levels ~30720 states ~47624 transitions
pins2lts-mc-linux64( 6/ 8), 0.270: [Blue] ~3396 levels ~61440 states ~132432 transitions
pins2lts-mc-linux64( 6/ 8), 0.342: [Blue] ~5444 levels ~122880 states ~251216 transitions
pins2lts-mc-linux64( 2/ 8), 0.497: [Blue] ~13731 levels ~245760 states ~507168 transitions
pins2lts-mc-linux64( 2/ 8), 0.786: [Blue] ~33680 levels ~491520 states ~1110576 transitions
pins2lts-mc-linux64( 6/ 8), 1.498: [Blue] ~33770 levels ~983040 states ~1886744 transitions
pins2lts-mc-linux64( 6/ 8), 2.858: [Blue] ~51981 levels ~1966080 states ~3545352 transitions
pins2lts-mc-linux64( 6/ 8), 5.566: [Blue] ~80505 levels ~3932160 states ~6769968 transitions
pins2lts-mc-linux64( 6/ 8), 10.798: [Blue] ~126440 levels ~7864320 states ~12977888 transitions
pins2lts-mc-linux64( 6/ 8), 21.231: [Blue] ~195161 levels ~15728640 states ~24926680 transitions
pins2lts-mc-linux64( 6/ 8), 42.641: [Blue] ~295610 levels ~31457280 states ~48045968 transitions
pins2lts-mc-linux64( 6/ 8), 86.802: [Blue] ~441500 levels ~62914560 states ~93091728 transitions
pins2lts-mc-linux64( 2/ 8), 138.329: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 138.394:
pins2lts-mc-linux64( 0/ 8), 138.394: Explored 60535547 states 111077484 transitions, fanout: 1.835
pins2lts-mc-linux64( 0/ 8), 138.394: Total exploration time 138.330 sec (138.260 sec minimum, 138.294 sec on average)
pins2lts-mc-linux64( 0/ 8), 138.394: States per second: 437617, Transitions per second: 802989
pins2lts-mc-linux64( 0/ 8), 138.394:
pins2lts-mc-linux64( 0/ 8), 138.394: State space has 80851832 states, 12980570 are accepting
pins2lts-mc-linux64( 0/ 8), 138.394: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 138.394: blue states: 60535547 (74.87%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 138.394: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 138.394: all-red states: 12980570 (16.05%), bogus 35 (0.00%)
pins2lts-mc-linux64( 0/ 8), 138.394:
pins2lts-mc-linux64( 0/ 8), 138.394: Total memory used for local state coloring: 701.9MB
pins2lts-mc-linux64( 0/ 8), 138.395:
pins2lts-mc-linux64( 0/ 8), 138.395: Queue width: 8B, total height: 45998328, memory: 350.94MB
pins2lts-mc-linux64( 0/ 8), 138.395: Tree memory: 872.9MB, 11.3 B/state, compr.: 18.3%
pins2lts-mc-linux64( 0/ 8), 138.395: Tree fill ratio (roots/leafs): 60.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 138.395: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 138.395: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 138.395: Est. total memory use: 1223.8MB (~1374.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin9671327657581711375]
255
java.lang.RuntimeException: Unexpected exception when executing 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin9671327657581711375]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-14 08:38:22] [INFO ] Flatten gal took : 3 ms
[2021-05-14 08:38:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality14687000744897454116.gal : 1 ms
[2021-05-14 08:38:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality7664350174439934099.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/LTLCardinality14687000744897454116.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7664350174439934099.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/LTLCardinality14687000744897454116.gal -t CGAL -LTL /tmp/LTLCardinality7664350174439934099.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p_i1<=access)"))))
Formula 0 simplified : !GF"(p_i1<=access)"
Detected timeout of ITS tools.
[2021-05-14 08:59:03] [INFO ] Flatten gal took : 288 ms
[2021-05-14 08:59:03] [INFO ] Input system was already deterministic with 11 transitions.
[2021-05-14 08:59:04] [INFO ] Transformed 14 places.
[2021-05-14 08:59:04] [INFO ] Transformed 11 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 08:59:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality6405016631418000231.gal : 11 ms
[2021-05-14 08:59:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality5311013926317715331.ltl : 11 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/LTLCardinality6405016631418000231.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5311013926317715331.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality6405016631418000231.gal -t CGAL -LTL /tmp/LTLCardinality5311013926317715331.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(p_i1<=access)"))))
Formula 0 simplified : !GF"(p_i1<=access)"

BK_TIME_CONFINEMENT_REACHED

--------------------
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-01000"
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-01000, 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-162089451800084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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