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

About the Execution of Smart+red for SieveSingleMsgMbox-PT-d0m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
461.060 29137.00 39139.00 135.00 0 0 0 0 0 0 1 0 0 1 0 0 0 0 1 0 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979600381.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is SieveSingleMsgMbox-PT-d0m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979600381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 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 SieveSingleMsgMbox-PT-d0m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679387365734

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m36
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 08:29:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 08:29:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 08:29:28] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-21 08:29:28] [INFO ] Transformed 262 places.
[2023-03-21 08:29:28] [INFO ] Transformed 73 transitions.
[2023-03-21 08:29:28] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 73 rows 72 cols
[2023-03-21 08:29:28] [INFO ] Computed 6 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1002 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1028 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
[2023-03-21 08:29:28] [INFO ] Invariant cache hit.
[2023-03-21 08:29:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:28] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-21 08:29:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:29:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:28] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-21 08:29:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 08:29:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 8 ms returned sat
[2023-03-21 08:29:28] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 3 ms to minimize.
[2023-03-21 08:29:28] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2023-03-21 08:29:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-21 08:29:28] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 8 ms.
[2023-03-21 08:29:28] [INFO ] Added : 8 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 13 ms.
[2023-03-21 08:29:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:28] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 08:29:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:29:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:28] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-21 08:29:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-21 08:29:28] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-03-21 08:29:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2023-03-21 08:29:28] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2023-03-21 08:29:29] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2023-03-21 08:29:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2023-03-21 08:29:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 215 ms
[2023-03-21 08:29:29] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 7 ms.
[2023-03-21 08:29:29] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2023-03-21 08:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-21 08:29:29] [INFO ] Added : 16 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 70 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 59 transition count 61
Applied a total of 24 rules in 33 ms. Remains 59 /72 variables (removed 13) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 59/72 places, 61/73 transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-21 08:29:29] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223288 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102920 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103194 resets, run finished after 356 ms. (steps per millisecond=2808 ) properties (out of 2) seen :0
[2023-03-21 08:29:30] [INFO ] Invariant cache hit.
[2023-03-21 08:29:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 08:29:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 08:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-21 08:29:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:29:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:29:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 08:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:30] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-21 08:29:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 08:29:30] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-21 08:29:30] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 5 ms.
[2023-03-21 08:29:30] [INFO ] Added : 14 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 15 ms.
[2023-03-21 08:29:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:29:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 08:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-21 08:29:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:29:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 08:29:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 08:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:31] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-21 08:29:31] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-21 08:29:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-03-21 08:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-21 08:29:31] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 7 ms.
[2023-03-21 08:29:31] [INFO ] Added : 7 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/59 places, 61/61 transitions.
[2023-03-21 08:29:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 223564 resets, run finished after 500 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103352 resets, run finished after 258 ms. (steps per millisecond=3875 ) properties (out of 1) seen :0
[2023-03-21 08:29:31] [INFO ] Invariant cache hit.
[2023-03-21 08:29:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 08:29:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 08:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-21 08:29:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:29:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:29:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 08:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:32] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 08:29:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 08:29:32] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-21 08:29:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-21 08:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-21 08:29:32] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 5 ms.
[2023-03-21 08:29:32] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 59/59 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-21 08:29:32] [INFO ] Invariant cache hit.
[2023-03-21 08:29:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-21 08:29:32] [INFO ] Invariant cache hit.
[2023-03-21 08:29:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 08:29:32] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-21 08:29:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 08:29:32] [INFO ] Invariant cache hit.
[2023-03-21 08:29:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 59/59 places, 61/61 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-09
[2023-03-21 08:29:32] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 979 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-21 08:29:32] [INFO ] Invariant cache hit.
[2023-03-21 08:29:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:29:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 08:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-21 08:29:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:29:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:29:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 08:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:32] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-21 08:29:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 08:29:32] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-21 08:29:32] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2023-03-21 08:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-21 08:29:32] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 9 ms.
[2023-03-21 08:29:32] [INFO ] Added : 7 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 59/59 places, 61/61 transitions.
[2023-03-21 08:29:32] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 223757 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103156 resets, run finished after 403 ms. (steps per millisecond=2481 ) properties (out of 1) seen :0
[2023-03-21 08:29:33] [INFO ] Invariant cache hit.
[2023-03-21 08:29:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 08:29:33] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 08:29:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:33] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-21 08:29:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 08:29:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 08:29:33] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 08:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 08:29:33] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-21 08:29:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 08:29:33] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-21 08:29:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-21 08:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-21 08:29:33] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 7 ms.
[2023-03-21 08:29:33] [INFO ] Added : 7 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 59/59 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-21 08:29:33] [INFO ] Invariant cache hit.
[2023-03-21 08:29:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-21 08:29:34] [INFO ] Invariant cache hit.
[2023-03-21 08:29:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 08:29:34] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-21 08:29:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 08:29:34] [INFO ] Invariant cache hit.
[2023-03-21 08:29:34] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 59/59 places, 61/61 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 in 1860 ms.
[2023-03-21 08:29:34] [INFO ] Flatten gal took : 78 ms
[2023-03-21 08:29:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-21 08:29:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 61 transitions and 241 arcs took 1 ms.
Total runtime 6572 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SieveSingleMsgMbox (PT), instance d0m36
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 59 places, 61 transitions, 241 arcs.
Final Score: 636.789
Took : 4 seconds
Bounds file is: UpperBounds.xml
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679387394871

--------------------
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="SieveSingleMsgMbox-PT-d0m36"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is SieveSingleMsgMbox-PT-d0m36, 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 r427-tajo-167905979600381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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