About the Execution of ITS-Tools for GPPP-PT-C0100N0000000010
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r165-tall-167838851000845.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is GPPP-PT-C0100N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838851000845
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C0100N0000000010-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000000010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679593990859
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000010
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-23 17:53:12] [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]
[2023-03-23 17:53:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 17:53:12] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-23 17:53:12] [INFO ] Transformed 33 places.
[2023-03-23 17:53:12] [INFO ] Transformed 22 transitions.
[2023-03-23 17:53:12] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-23 17:53:12] [INFO ] Computed 12 place invariants in 11 ms
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-04 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10003 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :1988
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-05 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :1000
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :1037
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :1058
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :1064
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :1064
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :1067
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :1067
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :1000
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :1063
[2023-03-23 17:53:12] [INFO ] Invariant cache hit.
[2023-03-23 17:53:12] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-23 17:53:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2023-03-23 17:53:12] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 17:53:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-23 17:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-23 17:53:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 17:53:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4974 ms returned unknown
[2023-03-23 17:53:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:17] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 17:53:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 17:53:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 24 ms returned sat
[2023-03-23 17:53:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:17] [INFO ] [Nat]Absence check using state equation in 47 ms returned unsat
[2023-03-23 17:53:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:17] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 17:53:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 17:53:23] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4990 ms returned unknown
[2023-03-23 17:53:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:23] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:23] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 17:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:28] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4923 ms returned sat
[2023-03-23 17:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned unknown
[2023-03-23 17:53:28] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 17:53:28] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-23 17:53:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 17:53:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 17:53:33] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4983 ms returned unknown
[2023-03-23 17:53:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:33] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 17:53:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 17:53:34] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 901 ms returned sat
[2023-03-23 17:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:34] [INFO ] [Nat]Absence check using state equation in 41 ms returned unsat
[2023-03-23 17:53:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:34] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:34] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 17:53:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:34] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
[2023-03-23 17:53:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:34] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [300, 600, 1, 20, 20, 20, 7, 400, 300] Max seen :[300, 47, 1, 7, 7, 7, 7, 400, 300]
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-15 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-14 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-06 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 26 transition count 16
Applied a total of 11 rules in 27 ms. Remains 26 /33 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-23 17:53:34] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-23 17:53:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 26/33 places, 16/22 transitions.
[2023-03-23 17:53:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000019 steps, including 5182 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 4) seen :66
Incomplete Best-First random walk after 1000001 steps, including 1261 resets, run finished after 407 ms. (steps per millisecond=2457 ) properties (out of 4) seen :59
Incomplete Best-First random walk after 1000000 steps, including 1220 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 4) seen :56
Incomplete Best-First random walk after 1000001 steps, including 1164 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 4) seen :56
Incomplete Best-First random walk after 1000000 steps, including 1052 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 4) seen :68
[2023-03-23 17:53:36] [INFO ] Invariant cache hit.
[2023-03-23 17:53:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-23 17:53:36] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-23 17:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-23 17:53:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:36] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-23 17:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:39] [INFO ] [Nat]Absence check using state equation in 3429 ms returned sat
[2023-03-23 17:53:39] [INFO ] Computed and/alt/rep : 15/30/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 17:53:39] [INFO ] Added : 9 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 3002 ms.
[2023-03-23 17:53:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 17:53:42] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:42] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-23 17:53:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 17:53:42] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-23 17:53:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-23 17:53:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [600, 7, 7, 7] Max seen :[47, 7, 7, 7]
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 16/16 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 25 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 24 transition count 14
Applied a total of 4 rules in 4 ms. Remains 24 /26 variables (removed 2) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 24/26 places, 14/16 transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-23 17:53:43] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000025 steps, including 5711 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :47
Incomplete Best-First random walk after 1000001 steps, including 1377 resets, run finished after 344 ms. (steps per millisecond=2906 ) properties (out of 1) seen :47
[2023-03-23 17:53:43] [INFO ] Invariant cache hit.
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-23 17:53:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 26 ms returned sat
[2023-03-23 17:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 17:53:43] [INFO ] [Nat]Absence check using state equation in 59 ms returned unsat
Current structural bounds on expressions (after SMT) : [47] Max seen :[47]
FORMULA GPPP-PT-C0100N0000000010-UpperBounds-08 47 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31627 ms.
BK_STOP 1679594025674
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="GPPP-PT-C0100N0000000010"
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-5348"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0100N0000000010, 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 r165-tall-167838851000845"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 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 ;