fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245689000205
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AirplaneLD-COL-0200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
195.607 3088.00 6327.00 59.10 1 200 1 1 2 1 1 1 1 400 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689000205.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 AirplaneLD-COL-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689000205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 6.8K Apr 29 21:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 21:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 21:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 21:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 67K May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652658209961

Running Version 202205111006
[2022-05-15 23:43:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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]
[2022-05-15 23:43:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:43:31] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-15 23:43:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 23:43:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2022-05-15 23:43:31] [INFO ] Detected 3 constant HL places corresponding to 602 PT places.
[2022-05-15 23:43:31] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 1419 PT places and 2412.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-15 23:43:31] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 4 ms.
[2022-05-15 23:43:31] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 14 rows 17 cols
[2022-05-15 23:43:31] [INFO ] Computed 3 place invariants in 4 ms
FORMULA AirplaneLD-COL-0200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-0200-UpperBounds-09 400 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-0200-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-0200-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-0200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 17 cols
[2022-05-15 23:43:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-15 23:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 23:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 18 ms.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-15 23:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 23:43:32] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 2 ms.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-15 23:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 23:43:32] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-15 23:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-15 23:43:32] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-15 23:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 8 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-15 23:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-15 23:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 23:43:32] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-15 23:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 23:43:32] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 23:43:32] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-15 23:43:32] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 23:43:32] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, -1, -1, 1, 1]
FORMULA AirplaneLD-COL-0200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-0200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:400) in guard (OR (GEQ $A 199) (EQ $A 399))introduces in Altitude(400) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:400) in guard (AND (LT $A 199) (NEQ $A 399))introduces in Altitude(400) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition Partition [nbSubs=2, partition=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 400 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 199) (EQ $A 399)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 199) (NEQ $A 399)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:200) in guard (OR (LEQ $S 99) (EQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:200) in guard (AND (GT $S 99) (NEQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:200) in guard (OR (LEQ $S 99) (EQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:200) in guard (AND (GT $S 99) (NEQ $S 199))introduces in Speed(200) partition with 2 elements
Sort wr.t. initial and guards Speed has partition Partition [nbSubs=2, partition=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 200 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 99) (EQ $S 199)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 99) (NEQ $S 199)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 99) (EQ $S 199)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 99) (NEQ $S 199)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2022-05-15 23:43:32] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 33 ms.
[2022-05-15 23:43:32] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :9
FORMULA AirplaneLD-COL-0200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-0200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-0200-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-0200-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-0200-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-0200-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-0200-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :2
// Phase 1: matrix 20 rows 23 cols
[2022-05-15 23:43:32] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:33] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[1, 1]
FORMULA AirplaneLD-COL-0200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-COL-0200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1865 ms.

BK_STOP 1652658213049

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -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=@none -Xss128m -Xms40m -Xmx8192m

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="AirplaneLD-COL-0200"
export BK_EXAMINATION="UpperBounds"
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 AirplaneLD-COL-0200, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689000205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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