About the Execution of LTSMin+red for GPPP-PT-C0100N0000010000
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.r169-tall-167838856500869.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 ltsminxred
Input is GPPP-PT-C0100N0000010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856500869
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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-C0100N0000010000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678654624074
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000010000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 20:57:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 20:57:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 20:57:05] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-12 20:57:05] [INFO ] Transformed 33 places.
[2023-03-12 20:57:05] [INFO ] Transformed 22 transitions.
[2023-03-12 20:57:05] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 20:57:05] [INFO ] Computed 12 place invariants in 11 ms
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-12 20000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-09 10000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-01 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10100 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=631 ) properties (out of 12) seen :43432
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-10 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :42504
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :41706
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :41838
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :41824
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :42391
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :41832
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :42514
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :41869
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :42517
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :41706
[2023-03-12 20:57:06] [INFO ] Invariant cache hit.
[2023-03-12 20:57:06] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-12 20:57:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 20:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 20:57:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:06] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2023-03-12 20:57:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 20:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 20:57:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:08] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2069 ms returned sat
[2023-03-12 20:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:09] [INFO ] [Nat]Absence check using state equation in 1137 ms returned sat
[2023-03-12 20:57:09] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 20:57:09] [INFO ] Added : 18 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 49 ms.
[2023-03-12 20:57:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:09] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 20:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 20:57:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-12 20:57:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 20:57:14] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4981 ms returned unknown
[2023-03-12 20:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:14] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 20:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 20:57:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:14] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 34 ms returned sat
[2023-03-12 20:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:15] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-12 20:57:15] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 20:57:15] [INFO ] Added : 17 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 14 ms.
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 20:57:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 124 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:15] [INFO ] [Nat]Absence check using state equation in 40 ms returned unsat
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 20:57:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 35 ms returned sat
[2023-03-12 20:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:16] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2023-03-12 20:57:16] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-12 20:57:16] [INFO ] Added : 18 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 44 ms.
[2023-03-12 20:57:16] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:16] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 20:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 20:57:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 20:57:21] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4580 ms returned sat
[2023-03-12 20:57:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:21] [INFO ] [Nat]Absence check using state equation in 147 ms returned unsat
[2023-03-12 20:57:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:21] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 20:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-12 20:57:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 20:57:21] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [400, 41400, 900, 700, 300, 4, 300, 700, 1104, 400] Max seen :[400, 40000, 8, 8, 300, 4, 300, 8, 1104, 400]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-15 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-14 1104 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-11 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-05 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-00 400 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.
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 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
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 32 transition count 20
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 31 transition count 20
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 2 with 3 rules applied. Total rules applied 7 place count 29 transition count 19
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 2 with 3 rules applied. Total rules applied 10 place count 27 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 26 transition count 17
Applied a total of 12 rules in 18 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 20:57:21] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-12 20:57:22] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 26/33 places, 17/22 transitions.
[2023-03-12 20:57:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000054 steps, including 761 resets, run finished after 287 ms. (steps per millisecond=3484 ) properties (out of 4) seen :40030
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=2824 ) properties (out of 4) seen :40002
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 4) seen :40006
Incomplete Best-First random walk after 1000001 steps, including 154 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 4) seen :40023
Incomplete Best-First random walk after 1000001 steps, including 163 resets, run finished after 355 ms. (steps per millisecond=2816 ) properties (out of 4) seen :40015
[2023-03-12 20:57:23] [INFO ] Invariant cache hit.
[2023-03-12 20:57:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:23] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 20:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 20:57:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 20:57:23] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 20:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:23] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2023-03-12 20:57:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:23] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 20:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 20:57:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 20:57:27] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4015 ms returned sat
[2023-03-12 20:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:33] [INFO ] [Nat]Absence check using state equation in 6021 ms returned unknown
[2023-03-12 20:57:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:33] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 20:57:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 20:57:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:33] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 20:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:33] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
[2023-03-12 20:57:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:34] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-12 20:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 20:57:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:34] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 20:57:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [40007, 900, 10, 10] Max seen :[40007, 10, 10, 10]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-02 40007 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, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 26/26 places, 17/17 transitions.
[2023-03-12 20:57:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000044 steps, including 762 resets, run finished after 255 ms. (steps per millisecond=3921 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 1) seen :6
[2023-03-12 20:57:34] [INFO ] Invariant cache hit.
[2023-03-12 20:57:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:34] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 20:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 20:57:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 20:57:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-12 20:57:40] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 6007 ms returned unknown
Current structural bounds on expressions (after SMT) : [900] Max seen :[10]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 17/17 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 26/26 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 17/17 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-12 20:57:40] [INFO ] Invariant cache hit.
[2023-03-12 20:57:40] [INFO ] Implicit Places using invariants in 46 ms returned [1, 2, 3, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/26 places, 17/17 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 18 transition count 13
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 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 12
Applied a total of 10 rules in 5 ms. Remains 17 /22 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-12 20:57:40] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 20:57:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 20:57:40] [INFO ] Invariant cache hit.
[2023-03-12 20:57:40] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 16/26 places, 12/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 128 ms. Remains : 16/26 places, 12/17 transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-12 20:57:40] [INFO ] Invariants computation overflowed in 0 ms
Incomplete random walk after 1000048 steps, including 1142 resets, run finished after 207 ms. (steps per millisecond=4831 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=3649 ) properties (out of 1) seen :6
// Phase 1: matrix 12 rows 16 cols
[2023-03-12 20:57:41] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 20:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 20:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 20:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 20:57:41] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [10] Max seen :[10]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 35876 ms.
ITS solved all properties within timeout
BK_STOP 1678654662434
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-C0100N0000010000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPPP-PT-C0100N0000010000, 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 r169-tall-167838856500869"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000010000.tgz
mv GPPP-PT-C0100N0000010000 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 ;