fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r197-tall-171640625100216
Last Updated
July 7, 2024

About the Execution of 2023-gold for GPPP-PT-C0001N0000000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
442.403 10125.00 13950.00 877.10 7 7 1 14 7 407 7 7 200 200 1 7 7 1 2 7 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.r197-tall-171640625100216.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 GPPP-PT-C0001N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625100216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716541968364

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=GPPP-PT-C0001N0000000100
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 09:12:49] [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-24 09:12:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:12:49] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2024-05-24 09:12:49] [INFO ] Transformed 33 places.
[2024-05-24 09:12:49] [INFO ] Transformed 22 transitions.
[2024-05-24 09:12:49] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 09:12:49] [INFO ] Computed 13 invariants in 11 ms
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :487
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :430
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :464
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :461
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :465
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :473
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :441
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :460
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :466
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :540
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :432
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :462
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :432
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :426
[2024-05-24 09:12:50] [INFO ] Invariant cache hit.
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 09:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 09:12:50] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 09:12:50] [INFO ] Added : 19 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 13 ms.
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 09:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 21 ms returned unsat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 09:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-24 09:12:50] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 09:12:50] [INFO ] Added : 20 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 42 ms.
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 09:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-24 09:12:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-24 09:12:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 09:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 09:12:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-24 09:12:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-24 09:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 09:12:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 7, -1, 14, 7, 407, 7, 7, 200, 1, 7, 1, 2] Max seen :[7, 7, 1, 14, 7, 407, 7, 7, 84, 1, 7, 1, 2]
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-05 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-03 14 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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 2 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 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 9 place count 28 transition count 16
Applied a total of 9 rules in 21 ms. Remains 28 /33 variables (removed 5) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 28 cols
[2024-05-24 09:12:51] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 09:12:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 28/33 places, 16/22 transitions.
[2024-05-24 09:12:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 2) seen :25
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 2) seen :201
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 09:12:52] [INFO ] Invariant cache hit.
[2024-05-24 09:12:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:53] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 09:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-24 09:12:53] [INFO ] [Nat]Absence check using 8 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-24 09:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 09:12:53] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:12:53] [INFO ] Added : 13 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [16] Max seen :[1]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 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 26 transition count 15
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 6 place count 24 transition count 14
Applied a total of 6 rules in 3 ms. Remains 24 /28 variables (removed 4) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 24/28 places, 14/16 transitions.
// Phase 1: matrix 14 rows 24 cols
[2024-05-24 09:12:53] [INFO ] Computed 11 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 1) seen :1
[2024-05-24 09:12:53] [INFO ] Invariant cache hit.
[2024-05-24 09:12:53] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-24 09:12:53] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 09:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 09:12:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:53] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 09:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 09:12:53] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 09:12:53] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-24 09:12:53] [INFO ] Invariant cache hit.
[2024-05-24 09:12:54] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 3, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 40 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 19/24 places, 14/14 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 19 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 17 transition count 11
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 6 place count 16 transition count 11
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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 14 transition count 9
Applied a total of 10 rules in 3 ms. Remains 14 /19 variables (removed 5) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 14 cols
[2024-05-24 09:12:54] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 09:12:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
[2024-05-24 09:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:12:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 14/24 places, 9/14 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 102 ms. Remains : 14/24 places, 9/14 transitions.
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=3846 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=4237 ) properties (out of 1) seen :1
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
[2024-05-24 09:12:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 09:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 09:12:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 09:12:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 09:12:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 09:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:12:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 09:12:54] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:12:54] [INFO ] Added : 8 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
[2024-05-24 09:12:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
[2024-05-24 09:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:12:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-24 09:12:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
[2024-05-24 09:12:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 14/14 places, 9/9 transitions.
Starting property specific reduction for GPPP-PT-C0001N0000000100-UpperBounds-02
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :1
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
[2024-05-24 09:12:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 09:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 09:12:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 09:12:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 09:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:12:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 09:12:54] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:12:54] [INFO ] Added : 8 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
[2024-05-24 09:12:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 14/14 places, 9/9 transitions.
[2024-05-24 09:12:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=3717 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=4237 ) properties (out of 1) seen :1
[2024-05-24 09:12:55] [INFO ] Invariant cache hit.
[2024-05-24 09:12:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:55] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 09:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 09:12:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:12:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:12:55] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-24 09:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:12:55] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 09:12:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:12:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 09:12:55] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-24 09:12:55] [INFO ] Added : 8 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-24 09:12:55] [INFO ] Invariant cache hit.
[2024-05-24 09:12:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 09:12:55] [INFO ] Invariant cache hit.
[2024-05-24 09:12:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:12:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-24 09:12:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 09:12:55] [INFO ] Invariant cache hit.
[2024-05-24 09:12:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 14/14 places, 9/9 transitions.
Ending property specific reduction for GPPP-PT-C0001N0000000100-UpperBounds-02 in 833 ms.
[2024-05-24 09:12:55] [INFO ] Flatten gal took : 22 ms
[2024-05-24 09:12:55] [INFO ] Applying decomposition
[2024-05-24 09:12:55] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12908654408349766570.txt' '-o' '/tmp/graph12908654408349766570.bin' '-w' '/tmp/graph12908654408349766570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12908654408349766570.bin' '-l' '-1' '-v' '-w' '/tmp/graph12908654408349766570.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:12:55] [INFO ] Decomposing Gal with order
[2024-05-24 09:12:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:12:55] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-24 09:12:55] [INFO ] Flatten gal took : 23 ms
[2024-05-24 09:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 09:12:55] [INFO ] Time to serialize gal into /tmp/UpperBounds18394742766700010688.gal : 1 ms
[2024-05-24 09:12:55] [INFO ] Time to serialize properties into /tmp/UpperBounds1263478425952725054.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18394742766700010688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1263478425952725054.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds1263478425952725054.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,37,0.015316,3492,139,80,366,159,68,433,46,336,0
Total reachable state count : 37

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property GPPP-PT-C0001N0000000100-UpperBounds-02 :0 <= i0.u0.E4P <= 1
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
GPPP-PT-C0001N0000000100-UpperBounds-02,0,0.016123,3492,1,0,366,159,98,433,62,336,102
Total runtime 6073 ms.

BK_STOP 1716541978489

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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 r197-tall-171640625100216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;