About the Execution of 2023-gold for AirplaneLD-COL-4000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
228.928 | 6378.00 | 10620.00 | 433.40 | 1 1 2 4000 1 1 1 1 8000 1 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 '/data/fkordon/mcc2024-input.r021-smll-171620128000146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AirplaneLD-COL-4000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128000146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K Apr 12 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 06:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 06:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 620K May 18 16:42 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-4000-UpperBounds-00
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-01
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-02
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-03
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-04
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-05
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-06
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-07
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-08
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-09
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-10
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-11
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-12
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-13
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-14
FORMULA_NAME AirplaneLD-COL-4000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716502472438
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-4000
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-23 22:14:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 22:14:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:14:34] [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.
[2024-05-23 22:14:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-23 22:14:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1075 ms
[2024-05-23 22:14:36] [INFO ] Detected 3 constant HL places corresponding to 12002 PT places.
[2024-05-23 22:14:36] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 28019 PT places and 48012.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
[2024-05-23 22:14:36] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 22 ms.
[2024-05-23 22:14:36] [INFO ] Skeletonized 16 HLPN properties in 1 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
[2024-05-23 22:14:36] [INFO ] Computed 3 invariants in 9 ms
FORMULA AirplaneLD-COL-4000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-4000-UpperBounds-08 8000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-4000-UpperBounds-03 4000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-4000-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-23 22:14:36] [INFO ] Invariant cache hit.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 22:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 22:14:36] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 22:14:36] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 7 ms.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 22:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 22:14:36] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 22:14:36] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 22:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-23 22:14:36] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 22:14:36] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 22:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 22:14:36] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 22:14:36] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 4 ms.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 22:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:36] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 22:14:36] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 22:14:37] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 22:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:14:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-23 22:14:37] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 22:14:37] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 22:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:14:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 22:14:37] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 22:14:37] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 22:14:37] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 22:14:37] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, 1]
FORMULA AirplaneLD-COL-4000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-4000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-4000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA AirplaneLD-COL-4000-UpperBounds-01 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:8000) in guard (OR (GEQ $A 3999) (EQ $A 7999))introduces in Altitude(8000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:8000) in guard (AND (LT $A 3999) (NEQ $A 7999))introduces in Altitude(8000) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 8000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 3999) (EQ $A 7999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 3999) (NEQ $A 7999)) -> (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:4000) in guard (OR (LEQ $S 1999) (EQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:4000) in guard (AND (GT $S 1999) (NEQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:4000) in guard (OR (LEQ $S 1999) (EQ $S 3999))introduces in Speed(4000) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:4000) in guard (AND (GT $S 1999) (NEQ $S 3999))introduces in Speed(4000) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 4000 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 1999) (EQ $S 3999)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 1999) (NEQ $S 3999)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 1999) (EQ $S 3999)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 1999) (NEQ $S 3999)) -> (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
[2024-05-23 22:14:37] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 151 ms.
[2024-05-23 22:14:37] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :8
FORMULA AirplaneLD-COL-4000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-4000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-4000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-4000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-4000-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-COL-4000-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 10000 steps, including 245 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :2
// Phase 1: matrix 20 rows 23 cols
[2024-05-23 22:14:37] [INFO ] Computed 3 invariants in 4 ms
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 22:14:37] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[1, 1]
FORMULA AirplaneLD-COL-4000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-COL-4000-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2815 ms.
BK_STOP 1716502478816
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-4000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AirplaneLD-COL-4000, 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 r021-smll-171620128000146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-4000.tgz
mv AirplaneLD-COL-4000 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 '
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 ;