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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K 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 85K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 21K Mar 25 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.4K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620993561917

Running Version 0
[2021-05-14 11:59:24] [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 11:59:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 11:59:24] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-14 11:59:24] [INFO ] Transformed 15 places.
[2021-05-14 11:59:24] [INFO ] Transformed 11 transitions.
[2021-05-14 11:59:24] [INFO ] Parsed PT model containing 15 places and 11 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 11:59:24] [INFO ] Initial state test concluded for 3 properties.
FORMULA RobotManipulation-PT-05000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-05000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 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 12 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 11:59:24] [INFO ] Computed 5 place invariants in 11 ms
[2021-05-14 11:59:24] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 11:59:24] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-14 11:59:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 11:59:25] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-14 11:59:25] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 11/11 transitions.
[2021-05-14 11:59:25] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 11:59:25] [INFO ] Flatten gal took : 26 ms
FORMULA RobotManipulation-PT-05000-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-05000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-05000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 11:59:25] [INFO ] Flatten gal took : 4 ms
[2021-05-14 11:59:25] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100015 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=1754 ) properties (out of 20) seen :7
Running SMT prover for 13 properties.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 11:59:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 11:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 11:59:25] [INFO ] Added : 8 causal constraints over 2 iterations in 33 ms. Result :sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-14 11:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 11:59:25] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 11:59:25] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:25] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 11:59:25] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:25] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 11:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:26] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-14 11:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 11:59:26] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 11:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 11:59:26] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-14 11:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 11:59:26] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 5 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:26] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 11:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 4 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:26] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:26] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 4 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 11:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 11:59:26] [INFO ] Computed and/alt/rep : 10/17/10 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:59:26] [INFO ] Added : 8 causal constraints over 2 iterations in 26 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 11/11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 10 transition count 7
Applied a total of 8 rules in 16 ms. Remains 10 /14 variables (removed 4) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-14 11:59:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 11:59:26] [INFO ] Implicit Places using invariants in 21 ms returned [4, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 23 ms to find 3 implicit places.
[2021-05-14 11:59:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 11:59:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 11:59:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 7/14 places, 7/11 transitions.
Graph (trivial) has 5 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 4
Applied a total of 4 rules in 7 ms. Remains 3 /7 variables (removed 4) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 11:59:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 11:59:26] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2021-05-14 11:59:26] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-14 11:59:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA RobotManipulation-PT-05000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-00 finished in 400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(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 11:59:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 11:59:27] [INFO ] Implicit Places using invariants in 26 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 11:59:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 11:59:27] [INFO ] Dead Transitions using invariants and state equation in 41 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 4 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 11:59:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 11:59:27] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 11:59:27] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-14 11:59:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 53 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 157 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-05000-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s6), p0:(LEQ s5 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-05000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-01 finished in 302 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 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 3 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 6 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 11:59:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 11:59:27] [INFO ] Implicit Places using invariants in 22 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
[2021-05-14 11:59:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 11:59:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 11:59:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 7/14 places, 7/11 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 2 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 5 transition count 6
Applied a total of 4 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 5 cols
[2021-05-14 11:59:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 11:59:27] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2021-05-14 11:59:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 11:59:27] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/14 places, 6/11 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 s0) (LEQ 1 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 412 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
[2021-05-14 11:59:28] [INFO ] Flatten gal took : 3 ms
[2021-05-14 11:59:28] [INFO ] Flatten gal took : 2 ms
[2021-05-14 11:59:28] [INFO ] Time to serialize gal into /tmp/LTL12631774141164002372.gal : 130 ms
[2021-05-14 11:59:28] [INFO ] Time to serialize properties into /tmp/LTL6622337712705056590.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/LTL12631774141164002372.gal, -t, CGAL, -LTL, /tmp/LTL6622337712705056590.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/LTL12631774141164002372.gal -t CGAL -LTL /tmp/LTL6622337712705056590.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((initialize>=1)||(move>=1))")))
Formula 0 simplified : !F"((initialize>=1)||(move>=1))"
Detected timeout of ITS tools.
[2021-05-14 11:59:44] [INFO ] Flatten gal took : 3 ms
[2021-05-14 11:59:44] [INFO ] Applying decomposition
[2021-05-14 11:59:44] [INFO ] Flatten gal took : 7 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/graph10723158676744932113.txt, -o, /tmp/graph10723158676744932113.bin, -w, /tmp/graph10723158676744932113.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/graph10723158676744932113.bin, -l, -1, -v, -w, /tmp/graph10723158676744932113.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 11:59:44] [INFO ] Decomposing Gal with order
[2021-05-14 11:59:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:59:44] [INFO ] Flatten gal took : 144 ms
[2021-05-14 11:59:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-14 11:59:44] [INFO ] Time to serialize gal into /tmp/LTL2846639911964598164.gal : 1 ms
[2021-05-14 11:59:44] [INFO ] Time to serialize properties into /tmp/LTL4037734652482695161.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/LTL2846639911964598164.gal, -t, CGAL, -LTL, /tmp/LTL4037734652482695161.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/LTL2846639911964598164.gal -t CGAL -LTL /tmp/LTL4037734652482695161.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((u0.initialize>=1)||(u1.move>=1))")))
Formula 0 simplified : !F"((u0.initialize>=1)||(u1.move>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2346480890393652861
[2021-05-14 11:59:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2346480890393652861
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/ltsmin2346480890393652861]
Compilation finished in 419 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2346480890393652861]
Link finished in 74 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/ltsmin2346480890393652861]
LTSmin run took 413 ms.
FORMULA RobotManipulation-PT-05000-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-05000-03 finished in 32874 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((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
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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 10 transition count 8
Applied a total of 7 rules in 5 ms. Remains 10 /14 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-14 12:00:00] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 12:00:00] [INFO ] Implicit Places using invariants in 47 ms returned [4, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
[2021-05-14 12:00:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-05-14 12:00:00] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 12:00:00] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 7/14 places, 8/11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 5 transition count 7
Applied a total of 4 rules in 17 ms. Remains 5 /7 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 5 cols
[2021-05-14 12:00:00] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 12:00:00] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2021-05-14 12:00:00] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 12:00:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/14 places, 7/11 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-05000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s4 s0), p0:(GT 2 s2)], 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 1 reset in 194 ms.
Stack based approach found an accepted trace after 59904 steps with 1 reset with depth 249 and stack size 226 in 256 ms.
FORMULA RobotManipulation-PT-05000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-04 finished in 761 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 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 12:00:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 12:00:01] [INFO ] Implicit Places using invariants in 39 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 12:00:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 12:00:01] [INFO ] Dead Transitions using invariants and state equation in 66 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 0 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 12:00:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 12:00:01] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 12:00:01] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-14 12:00:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 68 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 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-06 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: 1}]], initial=2, aps=[p0:(LEQ s3 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 98 ms.
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 49 ms.
Product exploration explored 100000 steps with 33333 reset in 79 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 10 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 10/10 places, 10/10 transitions.
Graph (trivial) has 6 edges and 10 vertex of which 6 / 10 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 5/10 (removed 5) transitions.
[2021-05-14 12:00:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 12:00:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 12:00:02] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 5/10 transitions.
Product exploration explored 100000 steps with 33333 reset in 300 ms.
Product exploration explored 100000 steps with 33333 reset in 232 ms.
[2021-05-14 12:00:02] [INFO ] Flatten gal took : 2 ms
[2021-05-14 12:00:02] [INFO ] Flatten gal took : 2 ms
[2021-05-14 12:00:02] [INFO ] Time to serialize gal into /tmp/LTL16055350941939461570.gal : 0 ms
[2021-05-14 12:00:02] [INFO ] Time to serialize properties into /tmp/LTL8084051103767226762.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/LTL16055350941939461570.gal, -t, CGAL, -LTL, /tmp/LTL8084051103767226762.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/LTL16055350941939461570.gal -t CGAL -LTL /tmp/LTL8084051103767226762.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(off<=initialize)")))))
Formula 0 simplified : !XXF"(off<=initialize)"
Detected timeout of ITS tools.
[2021-05-14 12:00:17] [INFO ] Flatten gal took : 3 ms
[2021-05-14 12:00:17] [INFO ] Applying decomposition
[2021-05-14 12:00:17] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15094228326000055993.txt, -o, /tmp/graph15094228326000055993.bin, -w, /tmp/graph15094228326000055993.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/graph15094228326000055993.bin, -l, -1, -v, -w, /tmp/graph15094228326000055993.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:00:17] [INFO ] Decomposing Gal with order
[2021-05-14 12:00:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:00:17] [INFO ] Flatten gal took : 4 ms
[2021-05-14 12:00:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 12:00:17] [INFO ] Time to serialize gal into /tmp/LTL2463127460761603301.gal : 1 ms
[2021-05-14 12:00:17] [INFO ] Time to serialize properties into /tmp/LTL16703983622804329452.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/LTL2463127460761603301.gal, -t, CGAL, -LTL, /tmp/LTL16703983622804329452.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/LTL2463127460761603301.gal -t CGAL -LTL /tmp/LTL16703983622804329452.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(gu0.off<=gu0.initialize)")))))
Formula 0 simplified : !XXF"(gu0.off<=gu0.initialize)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12021079754356907209
[2021-05-14 12:00:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12021079754356907209
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/ltsmin12021079754356907209]
Compilation finished in 149 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12021079754356907209]
Link finished in 32 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(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12021079754356907209]
LTSmin run took 141 ms.
FORMULA RobotManipulation-PT-05000-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-05000-06 finished in 32260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&(p1||G(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.
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 12:00:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 12:00:33] [INFO ] Implicit Places using invariants in 40 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 12:00:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 12:00:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 13/14 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 12:00:33] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 12:00:33] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-05000-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 1 s8), p1:(GT 3 s1), p2:(GT s11 s10)], 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]]
Product exploration explored 100000 steps with 33333 reset in 106 ms.
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 33333 reset in 59 ms.
Product exploration explored 100000 steps with 33333 reset in 69 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p2)]
Support contains 4 out of 13 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 13/13 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-14 12:00:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 12:00:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 12:00:34] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/13 places, 11/11 transitions.
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Product exploration explored 100000 steps with 33333 reset in 124 ms.
[2021-05-14 12:00:35] [INFO ] Flatten gal took : 3 ms
[2021-05-14 12:00:35] [INFO ] Flatten gal took : 2 ms
[2021-05-14 12:00:35] [INFO ] Time to serialize gal into /tmp/LTL1584056559503155399.gal : 1 ms
[2021-05-14 12:00:35] [INFO ] Time to serialize properties into /tmp/LTL14395329715147407181.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/LTL1584056559503155399.gal, -t, CGAL, -LTL, /tmp/LTL14395329715147407181.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/LTL1584056559503155399.gal -t CGAL -LTL /tmp/LTL14395329715147407181.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p_m<1)")&&(("(move<3)")||(G(F("(p_i1>access)"))))))))
Formula 0 simplified : !XX("(p_m<1)" & ("(move<3)" | GF"(p_i1>access)"))
Detected timeout of ITS tools.
[2021-05-14 12:00:50] [INFO ] Flatten gal took : 3 ms
[2021-05-14 12:00:50] [INFO ] Applying decomposition
[2021-05-14 12:00:50] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4551214434773558600.txt, -o, /tmp/graph4551214434773558600.bin, -w, /tmp/graph4551214434773558600.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/graph4551214434773558600.bin, -l, -1, -v, -w, /tmp/graph4551214434773558600.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:00:50] [INFO ] Decomposing Gal with order
[2021-05-14 12:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:00:50] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-14 12:00:50] [INFO ] Flatten gal took : 5 ms
[2021-05-14 12:00:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-14 12:00:50] [INFO ] Time to serialize gal into /tmp/LTL10375949935574772665.gal : 1 ms
[2021-05-14 12:00:50] [INFO ] Time to serialize properties into /tmp/LTL12764453292318445414.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/LTL10375949935574772665.gal, -t, CGAL, -LTL, /tmp/LTL12764453292318445414.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/LTL10375949935574772665.gal -t CGAL -LTL /tmp/LTL12764453292318445414.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(gi0.gi0.gu2.p_m<1)")&&(("(gi0.gi0.gu0.move<3)")||(G(F("(gu3.p_i1>gu3.access)"))))))))
Formula 0 simplified : !XX("(gi0.gi0.gu2.p_m<1)" & ("(gi0.gi0.gu0.move<3)" | GF"(gu3.p_i1>gu3.access)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin841424249796567730
[2021-05-14 12:01:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin841424249796567730
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/ltsmin841424249796567730]
Compilation finished in 159 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin841424249796567730]
Link finished in 38 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(X(((LTLAPp0==true)&&((LTLAPp1==true)||[](<>((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin841424249796567730]
LTSmin run took 578 ms.
FORMULA RobotManipulation-PT-05000-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-05000-07 finished in 32739 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.
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 2 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 12:01:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 12:01:06] [INFO ] Implicit Places using invariants in 24 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 12:01:06] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-14 12:01:06] [INFO ] Dead Transitions using invariants and state equation in 36 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 12:01:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 12:01:06] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 12:01:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 12:01:06] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 80 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 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-05000-08 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:(LEQ s2 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 34 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-08 finished in 277 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(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 12:01:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 12:01:06] [INFO ] Implicit Places using invariants in 21 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 12:01:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 12:01:06] [INFO ] Dead Transitions using invariants and state equation in 19 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 0 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 12:01:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 12:01:06] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-14 12:01:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 12:01:06] [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/14 places, 10/11 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-05000-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(LEQ 1 s8), p0:(LEQ 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 213 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-05000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-10 finished in 1032 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(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 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 12:01:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 12:01:07] [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 12:01:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 12:01:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 12/14 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 12:01:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 12:01:07] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : RobotManipulation-PT-05000-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT 2 s6), p0:(LEQ s7 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Stack based approach found an accepted trace after 126 steps with 0 reset with depth 127 and stack size 127 in 1 ms.
FORMULA RobotManipulation-PT-05000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-12 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], 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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 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 2 with 2 rules applied. Total rules applied 9 place count 9 transition count 7
Applied a total of 9 rules in 2 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 12:01:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 12:01:07] [INFO ] Implicit Places using invariants in 15 ms returned [4, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
[2021-05-14 12:01:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-14 12:01:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 12:01:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 7/14 places, 7/11 transitions.
Graph (trivial) has 4 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 1 ms. Remains 4 /7 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-14 12:01:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 12:01:07] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-14 12:01:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 12:01:07] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/14 places, 4/11 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-05000-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s3), p1:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-05000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-13 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G((p0&&F(p1)))&&X(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.
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 12:01:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 12:01:07] [INFO ] Implicit Places using invariants in 24 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 12:01:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 12:01:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 11/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 12:01:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 12:01:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/14 places, 11/11 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-05000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(LEQ s2 s6), p2:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2351 reset in 177 ms.
Stack based approach found an accepted trace after 173 steps with 3 reset with depth 52 and stack size 52 in 1 ms.
FORMULA RobotManipulation-PT-05000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-05000-15 finished in 555 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620993669519

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

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