fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r074-smll-167814400100325
Last Updated
May 14, 2023

About the Execution of Marcie+red for ClientsAndServers-PT-N0200P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
321.491 14156.00 20891.00 423.70 400 800 1600 400 400 400 400 400 400 800 400 400 800 1600 400 600 normal

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.r074-smll-167814400100325.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 marciexred
Input is ClientsAndServers-PT-N0200P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400100325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 13:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 13:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0200P0-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N0200P0-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678437401573

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0200P0
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 08:36:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 08:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:36:45] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-10 08:36:45] [INFO ] Transformed 25 places.
[2023-03-10 08:36:45] [INFO ] Transformed 18 transitions.
[2023-03-10 08:36:45] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 18 rows 25 cols
[2023-03-10 08:36:45] [INFO ] Computed 8 place invariants in 9 ms
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-15 600 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10018 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 15) seen :3600
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-13 1600 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-11 400 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-08 400 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-06 400 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-05 400 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-03 400 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :57
[2023-03-10 08:36:45] [INFO ] Invariant cache hit.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-10 08:36:46] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-10 08:36:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-10 08:36:46] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 08:36:46] [INFO ] Added : 13 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 14 ms.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-10 08:36:46] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 08:36:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-10 08:36:46] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 08:36:46] [INFO ] Added : 8 causal constraints over 2 iterations in 38 ms. Result :sat
Minimization took 9 ms.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-10 08:36:46] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 08:36:46] [INFO ] Added : 16 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 10 ms.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-10 08:36:46] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 08:36:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:46] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-10 08:36:46] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 08:36:46] [INFO ] Added : 16 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 8 ms.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-10 08:36:46] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 08:36:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 08:36:47] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 08:36:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 08:36:47] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 08:36:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 08:36:47] [INFO ] Added : 14 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 11 ms.
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 08:36:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 08:36:47] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 5 ms.
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 08:36:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 08:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 08:36:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-10 08:36:47] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 08:36:47] [INFO ] Added : 11 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [400, 800, 1600, 400, 400, 800, 400, 800, 400] Max seen :[16, 36, 32, 10, 26, 32, 16, 45, 22]
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-14 400 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-07 400 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-12 800 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-10 400 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-00 400 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-09 800 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-01 800 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-04 400 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
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 19 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 11 transition count 7
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 11 transition count 4
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 6 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 33 place count 6 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 5 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 2 transition count 2
Applied a total of 39 rules in 28 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 2/25 places, 2/18 transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 08:36:54] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000629 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=5621 ) properties (out of 1) seen :1600
FORMULA ClientsAndServers-PT-N0200P0-UpperBounds-02 1600 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9461 ms.
ITS solved all properties within timeout

BK_STOP 1678437415729

--------------------
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="ClientsAndServers-PT-N0200P0"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ClientsAndServers-PT-N0200P0, 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 r074-smll-167814400100325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0200P0.tgz
mv ClientsAndServers-PT-N0200P0 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 ;