About the Execution of ITS-Tools 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/mcc2021-input.r102-smll-162075331300259.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C0100N0000010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331300259
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of 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 1621226755759
Running Version 0
[2021-05-17 04:45:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 04:45:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:45:59] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-17 04:45:59] [INFO ] Transformed 33 places.
[2021-05-17 04:45:59] [INFO ] Transformed 22 transitions.
[2021-05-17 04:45:59] [INFO ] Parsed PT model containing 33 places and 22 transitions in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:45:59] [INFO ] Computed 12 place invariants in 15 ms
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-00 20000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10068 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=402 ) properties (out of 13) seen :42945
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-15 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-07 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :41134
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :40705
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 :40827
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 :40795
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 :40807
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 :40812
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 :40801
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :40705
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :40705
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :40826
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 04:45:59] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-17 04:45:59] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-17 04:45:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 04:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:45:59] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-17 04:45:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:45:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 04:45:59] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2021-05-17 04:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:45:59] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-17 04:45:59] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 04:45:59] [INFO ] Added : 5 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 98 ms.
[2021-05-17 04:45:59] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:45:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-17 04:45:59] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 04:45:59] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-17 04:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:45:59] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-17 04:45:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:45:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-17 04:46:00] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 04:46:00] [INFO ] Added : 11 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 18 ms.
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 04:46:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-17 04:46:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using state equation in 32 ms returned unsat
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:00] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-17 04:46:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 104 ms returned sat
[2021-05-17 04:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:01] [INFO ] [Nat]Absence check using state equation in 687 ms returned unsat
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-17 04:46:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 12 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:01] [INFO ] [Nat]Absence check using state equation in 30 ms returned unsat
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 04:46:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 04:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 04:46:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 04:46:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 04:46:06] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4443 ms returned sat
[2021-05-17 04:46:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:06] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2021-05-17 04:46:06] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 04:46:06] [INFO ] Added : 18 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 15 ms.
[2021-05-17 04:46:06] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 04:46:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 04:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:06] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 04:46:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 04:46:06] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 120 ms returned sat
[2021-05-17 04:46:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:06] [INFO ] [Nat]Absence check using state equation in 133 ms returned unsat
Current structural bounds on expressions (after SMT) : [20000, 300, 450, 2, 10, 10, 10, 400, 41400, 10] Max seen :[600, 300, 3, 2, 10, 10, 10, 400, 40000, 10]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-10 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-02 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 111300 steps, including 99 resets, run finished after 261 ms. (steps per millisecond=426 ) properties (out of 3) seen :40800 could not realise parikh vector
Incomplete Parikh walk after 80500 steps, including 98 resets, run finished after 147 ms. (steps per millisecond=547 ) properties (out of 3) seen :40798 could not realise parikh vector
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
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 5 place count 30 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 2 with 3 rules applied. Total rules applied 8 place count 28 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 2 with 2 rules applied. Total rules applied 10 place count 27 transition count 16
Applied a total of 10 rules in 39 ms. Remains 27 /33 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 27 cols
[2021-05-17 04:46:07] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-17 04:46:07] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/33 places, 16/22 transitions.
// Phase 1: matrix 16 rows 27 cols
[2021-05-17 04:46:07] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000223 steps, including 484 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 3) seen :40800
Incomplete Best-First random walk after 1000001 steps, including 156 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 3) seen :40802
Incomplete Best-First random walk after 1000001 steps, including 92 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 3) seen :40438
Incomplete Best-First random walk after 1000001 steps, including 166 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 3) seen :40010
// Phase 1: matrix 16 rows 27 cols
[2021-05-17 04:46:09] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 04:46:09] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-17 04:46:09] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 04:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-17 04:46:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 04:46:09] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 04:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:10] [INFO ] [Nat]Absence check using state equation in 292 ms returned unsat
[2021-05-17 04:46:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 04:46:10] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 04:46:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-17 04:46:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 04:46:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 04:46:19] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 9007 ms returned unknown
[2021-05-17 04:46:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-17 04:46:19] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 04:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:19] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 04:46:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-17 04:46:19] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 04:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [796, 450, 40007] Max seen :[796, 4, 40007]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-12 40007 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-01 796 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 16/16 transitions.
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 3 place count 25 transition count 15
Applied a total of 3 rules in 3 ms. Remains 25 /27 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/27 places, 15/16 transitions.
// Phase 1: matrix 15 rows 25 cols
[2021-05-17 04:46:19] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000015 steps, including 789 resets, run finished after 303 ms. (steps per millisecond=3300 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 165 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 1) seen :4
// Phase 1: matrix 15 rows 25 cols
[2021-05-17 04:46:20] [INFO ] Computed 10 place invariants in 13 ms
[2021-05-17 04:46:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-17 04:46:20] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 04:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:20] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 04:46:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 04:46:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-17 04:46:20] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 04:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 04:46:20] [INFO ] [Nat]Absence check using state equation in 62 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1621226781171
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000010000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r102-smll-162075331300259"
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 ;