fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075407200582
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Kanban-PT-50000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1974.348 139717.00 190734.00 1141.90 TFFTTTFFFFFTFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407200582.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Kanban-PT-50000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407200582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09: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 14K 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 Kanban-PT-50000-ReachabilityCardinality-00
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-01
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-02
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-03
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-04
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-05
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-06
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-07
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-08
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-09
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-10
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-11
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-12
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-13
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-14
FORMULA_NAME Kanban-PT-50000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620873285839

Running Version 0
[2021-05-13 02:34:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-13 02:34:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 02:34:47] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-13 02:34:47] [INFO ] Transformed 16 places.
[2021-05-13 02:34:47] [INFO ] Transformed 16 transitions.
[2021-05-13 02:34:47] [INFO ] Parsed PT model containing 16 places and 16 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA Kanban-PT-50000-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 50001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=1923 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :1
FORMULA Kanban-PT-50000-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :1
FORMULA Kanban-PT-50000-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
FORMULA Kanban-PT-50000-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 12 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:34:47] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 02:34:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 02:34:47] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-13 02:34:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 02:34:47] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-13 02:34:47] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 02:34:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 02:34:47] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 13 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 02:34:47] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:47] [INFO ] Added : 13 causal constraints over 4 iterations in 51 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 02:34:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-13 02:34:48] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 20 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-13 02:34:48] [INFO ] Added : 10 causal constraints over 3 iterations in 20 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:48] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-13 02:34:48] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:48] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 15 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:48] [INFO ] Added : 10 causal constraints over 3 iterations in 10 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:48] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:48] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:48] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
FORMULA Kanban-PT-50000-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 10 different solutions.
Interrupted Parikh walk after 18436279 steps, including 45 resets, run timeout after 30001 ms. (steps per millisecond=614 ) properties (out of 11) seen :10
FORMULA Kanban-PT-50000-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-50000-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Interrupted Parikh walk after 18911894 steps, including 53 resets, run timeout after 30001 ms. (steps per millisecond=630 ) properties (out of 1) seen :0
Interrupted Parikh walk after 19194680 steps, including 54 resets, run timeout after 30001 ms. (steps per millisecond=639 ) properties (out of 1) seen :0
Interrupted Parikh walk after 19230560 steps, including 84 resets, run timeout after 30001 ms. (steps per millisecond=640 ) properties (out of 1) seen :0
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 157 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test 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 3 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 13 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 11 transition count 12
Applied a total of 7 rules in 192 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
[2021-05-13 02:36:49] [INFO ] Flatten gal took : 17 ms
[2021-05-13 02:36:49] [INFO ] Flatten gal took : 4 ms
[2021-05-13 02:36:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality992509745524477720.gal : 3 ms
[2021-05-13 02:36:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6317555291167026427.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality992509745524477720.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6317555291167026427.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality992509745524477720.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6317555291167026427.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6317555291167026427.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
[2021-05-13 02:36:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:36:49] [INFO ] Applying decomposition
[2021-05-13 02:36:49] [INFO ] Flatten gal took : 4 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/graph12872870463772336722.txt, -o, /tmp/graph12872870463772336722.bin, -w, /tmp/graph12872870463772336722.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/graph12872870463772336722.bin, -l, -1, -v, -w, /tmp/graph12872870463772336722.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:36:49] [INFO ] Decomposing Gal with order
[2021-05-13 02:36:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:36:49] [INFO ] Flatten gal took : 22 ms
[2021-05-13 02:36:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 02:36:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4206133250634066745.gal : 1 ms
[2021-05-13 02:36:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8173163134952479112.prop : 4 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4206133250634066745.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8173163134952479112.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4206133250634066745.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8173163134952479112.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8173163134952479112.prop.
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Built C files in :
/tmp/ltsmin3204727739735808353
[2021-05-13 02:36:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3204727739735808353
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/ltsmin3204727739735808353]
Compilation finished in 170 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3204727739735808353]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, KanbanPT50000ReachabilityCardinality13==true], workingDir=/tmp/ltsmin3204727739735808353]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=5714 ) properties (out of 1) seen :0
Finished Best-First random walk after 300061 steps, including 0 resets, run visited all 1 properties in 157 ms. (steps per millisecond=1911 )
FORMULA Kanban-PT-50000-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620873425556

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Kanban-PT-50000"
export BK_EXAMINATION="ReachabilityCardinality"
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 Kanban-PT-50000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407200582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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