fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r159-oct2-162089268300382
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for PolyORBNT-COL-S05J40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
242.088 5529.00 11449.00 66.80 FFTTTTFTTTTTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268300382.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 PolyORBNT-COL-S05J40, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268300382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 12:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 12:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S05J40-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621212845317

Running Version 0
[2021-05-17 00:54:07] [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-17 00:54:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 00:54:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 00:54:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 00:54:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 515 ms
[2021-05-17 00:54:07] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2021-05-17 00:54:07] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-17 00:54:07] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2021-05-17 00:54:07] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2021-05-17 00:54:07] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2021-05-17 00:54:07] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-17 00:54:07] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 00:54:07] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 4 ms.
[2021-05-17 00:54:07] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12473544457731720454.dot
Incomplete random walk after 100000 steps, including 7984 resets, run finished after 157 ms. (steps per millisecond=636 ) properties (out of 16) seen :3
Running SMT prover for 13 properties.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 00:54:08] [INFO ] Computed 13 place invariants in 7 ms
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-17 00:54:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:54:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:08] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-17 00:54:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 00:54:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:54:08] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2021-05-17 00:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-17 00:54:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 00:54:08] [INFO ] Added : 19 causal constraints over 4 iterations in 102 ms. Result :sat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive place invariants in 31 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-17 00:54:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:54:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:08] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:54:08] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2021-05-17 00:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-17 00:54:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:54:08] [INFO ] Added : 20 causal constraints over 4 iterations in 224 ms. Result :sat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:54:08] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2021-05-17 00:54:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2021-05-17 00:54:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 00:54:09] [INFO ] Added : 16 causal constraints over 4 iterations in 34 ms. Result :sat
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2021-05-17 00:54:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 14 places in 7 ms of which 0 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 43 ms
[2021-05-17 00:54:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:54:09] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-17 00:54:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2021-05-17 00:54:09] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2021-05-17 00:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-17 00:54:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:54:09] [INFO ] Added : 22 causal constraints over 5 iterations in 50 ms. Result :sat
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 00:54:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:09] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-17 00:54:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:54:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 00:54:10] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 4 ms to minimize.
[2021-05-17 00:54:10] [INFO ] Deduced a trap composed of 11 places in 10 ms of which 0 ms to minimize.
[2021-05-17 00:54:10] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2021-05-17 00:54:10] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2021-05-17 00:54:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 187 ms
[2021-05-17 00:54:10] [INFO ] Added : 36 causal constraints over 8 iterations in 223 ms. Result :sat
[2021-05-17 00:54:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:54:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2021-05-17 00:54:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2021-05-17 00:54:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 00:54:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 00:54:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 00:54:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 00:54:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 00:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 00:54:10] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-17 00:54:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 00:54:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 00:54:10] [INFO ] Added : 18 causal constraints over 5 iterations in 26 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 00:54:10] [INFO ] Flatten gal took : 31 ms
[2021-05-17 00:54:10] [INFO ] Flatten gal took : 6 ms
[2021-05-17 00:54:10] [INFO ] Unfolded HLPN to a Petri net with 669 places and 975 transitions in 27 ms.
[2021-05-17 00:54:10] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_8270607243186424633.dot
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 40 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :9
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 1844 steps, including 30 resets, run visited all 1 properties in 7 ms. (steps per millisecond=263 )
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621212850846

--------------------
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="PolyORBNT-COL-S05J40"
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 PolyORBNT-COL-S05J40, 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 r159-oct2-162089268300382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 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 ;