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-162089451800053.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-00050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089451800053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.2K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-00050-00
FORMULA_NAME RobotManipulation-PT-00050-01
FORMULA_NAME RobotManipulation-PT-00050-02
FORMULA_NAME RobotManipulation-PT-00050-03
FORMULA_NAME RobotManipulation-PT-00050-04
FORMULA_NAME RobotManipulation-PT-00050-05
FORMULA_NAME RobotManipulation-PT-00050-06
FORMULA_NAME RobotManipulation-PT-00050-07
FORMULA_NAME RobotManipulation-PT-00050-08
FORMULA_NAME RobotManipulation-PT-00050-09
FORMULA_NAME RobotManipulation-PT-00050-10
FORMULA_NAME RobotManipulation-PT-00050-11
FORMULA_NAME RobotManipulation-PT-00050-12
FORMULA_NAME RobotManipulation-PT-00050-13
FORMULA_NAME RobotManipulation-PT-00050-14
FORMULA_NAME RobotManipulation-PT-00050-15

=== Now, execution of the tool begins

BK_START 1620958204029

Running Version 0
[2021-05-14 02:10:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 02:10:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 02:10:07] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-14 02:10:07] [INFO ] Transformed 15 places.
[2021-05-14 02:10:07] [INFO ] Transformed 11 transitions.
[2021-05-14 02:10:07] [INFO ] Parsed PT model containing 15 places and 11 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 02:10:07] [INFO ] Initial state test concluded for 1 properties.
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 17 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 02:10:07] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-14 02:10:07] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 02:10:07] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 02:10:07] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 02:10:07] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-14 02:10:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-14 02:10:08] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 02:10:08] [INFO ] Flatten gal took : 38 ms
FORMULA RobotManipulation-PT-00050-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00050-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 02:10:08] [INFO ] Flatten gal took : 11 ms
[2021-05-14 02:10:08] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 2829 steps, including 0 resets, run visited all 13 properties in 14 ms. (steps per millisecond=202 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&(F(G(p1))||(G(p2) U p3))))], workingDir=/home/mcc/execution]
Support contains 6 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
Applied a total of 6 rules in 24 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2021-05-14 02:10:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:10:08] [INFO ] Implicit Places using invariants in 34 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
[2021-05-14 02:10:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-14 02:10:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 02:10:08] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 10/15 places, 9/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 8
Applied a total of 2 rules in 5 ms. Remains 9 /10 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-14 02:10:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 02:10:08] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-14 02:10:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 02:10:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 523 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-00050-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s4 1) (GEQ s6 1)), p2:(GEQ s7 1), p0:(AND (GEQ s0 1) (GEQ s3 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 435 ms.
Stack based approach found an accepted trace after 3403 steps with 0 reset with depth 3404 and stack size 3325 in 14 ms.
FORMULA RobotManipulation-PT-00050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-00 finished in 1267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p1 U X(p2)))))], 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 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 02:10:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 02:10:09] [INFO ] Implicit Places using invariants in 31 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 02:10:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 02:10:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 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 02:10:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 02:10:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 356 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-00050-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}]], initial=1, aps=[p0:(GEQ s9 1), p1:(AND (GEQ s10 1) (GEQ s11 1)), p2:(GEQ s6 1)], 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]]
Entered a terminal (fully accepting) state of product in 6584 steps with 0 reset in 37 ms.
FORMULA RobotManipulation-PT-00050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-01 finished in 535 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(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
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 02:10:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:10:10] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 02:10:10] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 02:10:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 3 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 02:10:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 02:10:10] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 02:10:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 02:10:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00050-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s7 1)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 6886 reset in 385 ms.
Stack based approach found an accepted trace after 97 steps with 7 reset with depth 14 and stack size 14 in 0 ms.
FORMULA RobotManipulation-PT-00050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-03 finished in 692 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(G((F(p1)&&X(p2))))))], 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 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 02:10:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 02:10:10] [INFO ] Implicit Places using invariants in 25 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 02:10:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:10:10] [INFO ] Dead Transitions using invariants and state equation in 29 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 02:10:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:10:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) p2)]
Running random walk in product with property : RobotManipulation-PT-00050-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 5}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s5 1)), p0:(GEQ s9 1), p2:(AND (GEQ s11 1) (GEQ s12 1))], 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]]
Entered a terminal (fully accepting) state of product in 172 steps with 9 reset in 1 ms.
FORMULA RobotManipulation-PT-00050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-04 finished in 589 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(!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
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 02:10:11] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:10:11] [INFO ] Implicit Places using invariants in 27 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 02:10:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 02:10:11] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 02:10:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 02:10:11] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 02:10:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 02:10:11] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 129 ms :[p0, p0, p0]
Running random walk in product with property : RobotManipulation-PT-00050-05 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1))], 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]]
Product exploration explored 100000 steps with 1135 reset in 159 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA RobotManipulation-PT-00050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-05 finished in 417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(!p0))||G(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 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 02:10:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 02:10:11] [INFO ] Implicit Places using invariants in 35 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 02:10:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:10:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 02:10:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:10:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 159 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00050-06 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s12 1)), p1:(OR (LT s6 1) (LT s9 1) (LT s11 1) (LT s12 1))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 6961 reset in 201 ms.
Stack based approach found an accepted trace after 62 steps with 10 reset with depth 19 and stack size 19 in 1 ms.
FORMULA RobotManipulation-PT-00050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-06 finished in 488 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((p0 U p1)||G(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 3 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-14 02:10:12] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:10:12] [INFO ] Implicit Places using invariants in 36 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
[2021-05-14 02:10:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 02:10:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 02:10:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 7/15 places, 7/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 5 transition count 5
Applied a total of 4 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 02:10:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 02:10:12] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 02:10:12] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 02:10:12] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-00050-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3 1), p2:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 69 ms.
Product exploration explored 100000 steps with 4 reset in 192 ms.
Knowledge obtained : [(NOT p1), p2]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6 reset in 140 ms.
Product exploration explored 100000 steps with 2 reset in 281 ms.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Graph (trivial) has 3 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 transition count 3
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 2 transition count 3
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 0 transition count 2
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 0 transition count 1
Applied a total of 8 rules in 14 ms. Remains 0 /5 variables (removed 5) and now considering 1/5 (removed 4) transitions.
[2021-05-14 02:10:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 02:10:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-14 02:10:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 02:10:13] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-14 02:10:13] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 02:10:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 02:10:13] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 0/5 places, 1/5 transitions.
[2021-05-14 02:10:13] [INFO ] Flatten gal took : 5 ms
[2021-05-14 02:10:13] [INFO ] Flatten gal took : 3 ms
[2021-05-14 02:10:13] [INFO ] Time to serialize gal into /tmp/LTL17062242373562780335.gal : 2 ms
[2021-05-14 02:10:13] [INFO ] Time to serialize properties into /tmp/LTL14875401303348066176.ltl : 2 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/LTL17062242373562780335.gal, -t, CGAL, -LTL, /tmp/LTL14875401303348066176.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/LTL17062242373562780335.gal -t CGAL -LTL /tmp/LTL14875401303348066176.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !((G(F((("((moved>=1)&&(p_m>=1))")U("(p_sc>=1)"))||(G(F("(p_i1>=1)")))))))
Formula 0 simplified : !GF(("((moved>=1)&&(p_m>=1))" U "(p_sc>=1)") | GF"(p_i1>=1)")
Detected timeout of ITS tools.
[2021-05-14 02:10:28] [INFO ] Flatten gal took : 4 ms
[2021-05-14 02:10:28] [INFO ] Applying decomposition
[2021-05-14 02:10:28] [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/graph15775305818484311361.txt, -o, /tmp/graph15775305818484311361.bin, -w, /tmp/graph15775305818484311361.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/graph15775305818484311361.bin, -l, -1, -v, -w, /tmp/graph15775305818484311361.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 02:10:28] [INFO ] Decomposing Gal with order
[2021-05-14 02:10:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 02:10:28] [INFO ] Flatten gal took : 81 ms
[2021-05-14 02:10:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-14 02:10:28] [INFO ] Time to serialize gal into /tmp/LTL12073815884774760051.gal : 1 ms
[2021-05-14 02:10:28] [INFO ] Time to serialize properties into /tmp/LTL14408474494920343143.ltl : 2 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/LTL12073815884774760051.gal, -t, CGAL, -LTL, /tmp/LTL14408474494920343143.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/LTL12073815884774760051.gal -t CGAL -LTL /tmp/LTL14408474494920343143.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((G(F((("((u0.moved>=1)&&(u1.p_m>=1))")U("(u1.p_sc>=1)"))||(G(F("(u2.p_i1>=1)")))))))
Formula 0 simplified : !GF(("((u0.moved>=1)&&(u1.p_m>=1))" U "(u1.p_sc>=1)") | GF"(u2.p_i1>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2821994185468875369
[2021-05-14 02:10:43] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2821994185468875369
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/ltsmin2821994185468875369]
Compilation finished in 484 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2821994185468875369]
Link finished in 68 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))||[](<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2821994185468875369]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RobotManipulation-PT-00050-07 finished in 46579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(!p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 6 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 02:10:58] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:10:58] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 02:10:58] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-14 02:10:58] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 02:10:58] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:10:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p1), p1, true]
Running random walk in product with property : RobotManipulation-PT-00050-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s5 1))), p1:(AND (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1106 steps with 0 reset in 6 ms.
FORMULA RobotManipulation-PT-00050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-08 finished in 245 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p1||X(X(X(F(!p2))))))))], 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 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 02:10:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:10:59] [INFO ] Implicit Places using invariants in 22 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 02:10:59] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-14 02:10:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 02:10:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 02:10:59] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 02:10:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 02:10:59] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), p2, p2, p2]
Running random walk in product with property : RobotManipulation-PT-00050-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s8 1), p1:(AND (GEQ s3 1) (GEQ s5 1)), p2:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10101 reset in 184 ms.
Stack based approach found an accepted trace after 71 steps with 6 reset with depth 13 and stack size 13 in 1 ms.
FORMULA RobotManipulation-PT-00050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-09 finished in 615 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (p1||X((X(G(p2))&&F(!p3))))))], workingDir=/home/mcc/execution]
Support contains 6 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 02:10:59] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-14 02:10:59] [INFO ] Implicit Places using invariants in 26 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 02:10:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:10:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 02:10:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:10:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 538 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p0) p1 p3) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p3), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00050-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0) p3), acceptance={} source=2 dest: 6}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s12 1)), p0:(GEQ s9 1), p3:(AND (GEQ s2 1) (GEQ s8 1)), p2:(GEQ s5 1)], 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 3492 reset in 164 ms.
Stack based approach found an accepted trace after 83 steps with 1 reset with depth 22 and stack size 22 in 1 ms.
FORMULA RobotManipulation-PT-00050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-11 finished in 826 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((!p0&&(!p0 U (p1||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 5 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 02:11:00] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:11:00] [INFO ] Implicit Places using invariants in 35 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
[2021-05-14 02:11:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 02:11:00] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 02:11:00] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 6/15 places, 6/11 transitions.
Graph (trivial) has 3 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 2 ms. Remains 4 /6 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-14 02:11:00] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 02:11:00] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-14 02:11:00] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-14 02:11:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-14 02:11:00] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 54 ms :[p0]
Running random walk in product with property : RobotManipulation-PT-00050-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-12 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)&&X(F((G(F(!p2))||p1)))))], 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 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 02:11:00] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:11:00] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 02:11:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 02:11:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 02:11:00] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-14 02:11:00] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR p0 (AND (NOT p1) p2)), true, p0, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : RobotManipulation-PT-00050-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1)), p1:(OR (LT s6 1) (LT s9 1)), p2:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 0 ms.
FORMULA RobotManipulation-PT-00050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-13 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G((X(!p2)||(!p3&&X(!p3))||p1)))))], workingDir=/home/mcc/execution]
Support contains 6 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 1 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 02:11:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 02:11:01] [INFO ] Implicit Places using invariants in 26 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 02:11:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:11:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 13/15 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 1 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 02:11:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:11:01] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-14 02:11:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 02:11:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (AND (NOT p1) p2 p3)), (NOT p0), (AND (NOT p1) p3 p2), p2, (AND p3 p2), true]
Running random walk in product with property : RobotManipulation-PT-00050-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: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s9 1)), p1:(OR (LT s1 1) (LT s5 1)), p3:(GEQ s6 1), p2:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 143 steps with 5 reset in 0 ms.
FORMULA RobotManipulation-PT-00050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-14 finished in 406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0||X(p1))) U (G(!p2)||(!p2&&F(!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.
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 02:11:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 02:11:01] [INFO ] Implicit Places using invariants in 23 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 02:11:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 02:11:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 11/15 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 02:11:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 02:11:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 193 ms :[p2, p2, (AND p2 p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s4 1)), p0:(GEQ s8 1), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7793 reset in 142 ms.
Stack based approach found an accepted trace after 81 steps with 10 reset with depth 11 and stack size 11 in 1 ms.
FORMULA RobotManipulation-PT-00050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00050-15 finished in 446 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17658486743507632279
[2021-05-14 02:11:01] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2021-05-14 02:11:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 02:11:01] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2021-05-14 02:11:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 02:11:01] [INFO ] Applying decomposition
[2021-05-14 02:11:01] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2021-05-14 02:11:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 02:11:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17658486743507632279
[2021-05-14 02:11:01] [INFO ] Flatten gal took : 4 ms
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/ltsmin17658486743507632279]
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/graph8310055447405576167.txt, -o, /tmp/graph8310055447405576167.bin, -w, /tmp/graph8310055447405576167.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/graph8310055447405576167.bin, -l, -1, -v, -w, /tmp/graph8310055447405576167.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 02:11:01] [INFO ] Decomposing Gal with order
[2021-05-14 02:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 02:11:01] [INFO ] Flatten gal took : 5 ms
[2021-05-14 02:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-14 02:11:01] [INFO ] Time to serialize gal into /tmp/LTLFireability6811324148418377747.gal : 2 ms
[2021-05-14 02:11:01] [INFO ] Time to serialize properties into /tmp/LTLFireability4703336093098857147.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/LTLFireability6811324148418377747.gal, -t, CGAL, -LTL, /tmp/LTLFireability4703336093098857147.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/LTLFireability6811324148418377747.gal -t CGAL -LTL /tmp/LTLFireability4703336093098857147.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((("((i1.u0.moved>=1)&&(i1.u2.p_m>=1))")U("(i1.u2.p_sc>=1)"))||(G(F("(u3.p_i1>=1)")))))))
Formula 0 simplified : !GF(("((i1.u0.moved>=1)&&(i1.u2.p_m>=1))" U "(i1.u2.p_sc>=1)") | GF"(u3.p_i1>=1)")
Compilation finished in 321 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17658486743507632279]
Link finished in 49 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) U (LTLAPp1==true))||[](<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17658486743507632279]
WARNING : LTSmin timed out (>257 s) on command 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) U (LTLAPp1==true))||[](<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17658486743507632279]
Retrying LTSmin with larger timeout 2056 s
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) U (LTLAPp1==true))||[](<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17658486743507632279]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: LTL layer: formula: [](<>((((LTLAPp0==true) U (LTLAPp1==true))||[](<>((LTLAPp2==true))))))
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: "[](<>((((LTLAPp0==true) U (LTLAPp1==true))||[](<>((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.003: Using Spin LTL semantics
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( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: 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 14, guards 11
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.099: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.129: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.129: State length is 16, there are 14 groups
pins2lts-mc-linux64( 0/ 8), 0.129: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.129: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.129: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.129: Visible groups: 4 / 14, labels: 2 / 16
pins2lts-mc-linux64( 0/ 8), 0.129: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.129: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.228: [Blue] ~120 levels ~960 states ~1624 transitions
pins2lts-mc-linux64( 6/ 8), 0.253: [Blue] ~240 levels ~1920 states ~3800 transitions
pins2lts-mc-linux64( 2/ 8), 0.263: [Blue] ~336 levels ~3840 states ~5576 transitions
pins2lts-mc-linux64( 2/ 8), 0.265: [Blue] ~343 levels ~7680 states ~10880 transitions
pins2lts-mc-linux64( 5/ 8), 0.269: [Blue] ~901 levels ~15360 states ~23440 transitions
pins2lts-mc-linux64( 5/ 8), 0.289: [Blue] ~901 levels ~30720 states ~41824 transitions
pins2lts-mc-linux64( 7/ 8), 0.320: [Blue] ~1110 levels ~61440 states ~90096 transitions
pins2lts-mc-linux64( 5/ 8), 0.387: [Blue] ~901 levels ~122880 states ~161024 transitions
pins2lts-mc-linux64( 5/ 8), 0.549: [Blue] ~7903 levels ~245760 states ~418672 transitions
pins2lts-mc-linux64( 6/ 8), 0.838: [Blue] ~9538 levels ~491520 states ~770680 transitions
pins2lts-mc-linux64( 6/ 8), 1.490: [Blue] ~18054 levels ~983040 states ~1513864 transitions
pins2lts-mc-linux64( 7/ 8), 2.947: [Blue] ~61090 levels ~1966080 states ~3480400 transitions
pins2lts-mc-linux64( 7/ 8), 6.332: [Blue] ~262442 levels ~3932160 states ~8453800 transitions
pins2lts-mc-linux64( 2/ 8), 14.332: [Blue] ~583228 levels ~7864320 states ~14857208 transitions
pins2lts-mc-linux64( 0/ 8), 30.364: [Blue] ~1918217 levels ~15728640 states ~40819184 transitions
pins2lts-mc-linux64( 0/ 8), 61.793: [Blue] ~3851743 levels ~31457280 states ~80160536 transitions
pins2lts-mc-linux64( 0/ 8), 127.931: [Blue] ~7700645 levels ~62914560 states ~150484792 transitions
pins2lts-mc-linux64( 2/ 8), 181.466: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 181.519:
pins2lts-mc-linux64( 0/ 8), 181.520: Explored 74943145 states 140208497 transitions, fanout: 1.871
pins2lts-mc-linux64( 0/ 8), 181.520: Total exploration time 181.380 sec (181.320 sec minimum, 181.350 sec on average)
pins2lts-mc-linux64( 0/ 8), 181.520: States per second: 413183, Transitions per second: 773010
pins2lts-mc-linux64( 0/ 8), 181.520:
pins2lts-mc-linux64( 0/ 8), 181.520: State space has 92081145 states, 3202633 are accepting
pins2lts-mc-linux64( 0/ 8), 181.520: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 181.520: blue states: 74943145 (81.39%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 181.520: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 181.520: all-red states: 3202633 (3.48%), bogus 19238 (0.02%)
pins2lts-mc-linux64( 0/ 8), 181.520:
pins2lts-mc-linux64( 0/ 8), 181.520: Total memory used for local state coloring: 1064.3MB
pins2lts-mc-linux64( 0/ 8), 181.520:
pins2lts-mc-linux64( 0/ 8), 181.520: Queue width: 8B, total height: 69750976, memory: 532.16MB
pins2lts-mc-linux64( 0/ 8), 181.520: Tree memory: 958.5MB, 10.9 B/state, compr.: 16.5%
pins2lts-mc-linux64( 0/ 8), 181.520: Tree fill ratio (roots/leafs): 68.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 181.520: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 181.520: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 181.520: Est. total memory use: 1490.7MB (~1556.2MB 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) U (LTLAPp1==true))||[](<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17658486743507632279]
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) U (LTLAPp1==true))||[](<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17658486743507632279]
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:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-14 02:31:20] [INFO ] Flatten gal took : 3 ms
[2021-05-14 02:31:20] [INFO ] Time to serialize gal into /tmp/LTLFireability10126599616740452745.gal : 1 ms
[2021-05-14 02:31:20] [INFO ] Time to serialize properties into /tmp/LTLFireability12457442859158570134.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/LTLFireability10126599616740452745.gal, -t, CGAL, -LTL, /tmp/LTLFireability12457442859158570134.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/LTLFireability10126599616740452745.gal -t CGAL -LTL /tmp/LTLFireability12457442859158570134.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((("((moved>=1)&&(p_m>=1))")U("(p_sc>=1)"))||(G(F("(p_i1>=1)")))))))
Formula 0 simplified : !GF(("((moved>=1)&&(p_m>=1))" U "(p_sc>=1)") | GF"(p_i1>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-14 02:51:38] [INFO ] Flatten gal took : 4 ms
[2021-05-14 02:51:38] [INFO ] Input system was already deterministic with 11 transitions.
[2021-05-14 02:51:38] [INFO ] Transformed 15 places.
[2021-05-14 02:51:38] [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 02:51:38] [INFO ] Time to serialize gal into /tmp/LTLFireability14683064143747009700.gal : 1 ms
[2021-05-14 02:51:38] [INFO ] Time to serialize properties into /tmp/LTLFireability16734219132511452360.ltl : 3 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/LTLFireability14683064143747009700.gal, -t, CGAL, -LTL, /tmp/LTLFireability16734219132511452360.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/LTLFireability14683064143747009700.gal -t CGAL -LTL /tmp/LTLFireability16734219132511452360.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((("((moved>=1)&&(p_m>=1))")U("(p_sc>=1)"))||(G(F("(p_i1>=1)")))))))
Formula 0 simplified : !GF(("((moved>=1)&&(p_m>=1))" U "(p_sc>=1)") | GF"(p_i1>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-00050"
export BK_EXAMINATION="LTLFireability"
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-00050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-162089451800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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