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

About the Execution of Smart+red for Anderson-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7450.432 3600000.00 3653460.00 8604.10 1 1 1 1 1 1 1 1 1 1 1 1 1 ? 1 1 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.r523-tall-167987247500053.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 smartxred
Input is Anderson-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247500053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 31 16:48 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 Anderson-PT-10-UpperBounds-00
FORMULA_NAME Anderson-PT-10-UpperBounds-01
FORMULA_NAME Anderson-PT-10-UpperBounds-02
FORMULA_NAME Anderson-PT-10-UpperBounds-03
FORMULA_NAME Anderson-PT-10-UpperBounds-04
FORMULA_NAME Anderson-PT-10-UpperBounds-05
FORMULA_NAME Anderson-PT-10-UpperBounds-06
FORMULA_NAME Anderson-PT-10-UpperBounds-07
FORMULA_NAME Anderson-PT-10-UpperBounds-08
FORMULA_NAME Anderson-PT-10-UpperBounds-09
FORMULA_NAME Anderson-PT-10-UpperBounds-10
FORMULA_NAME Anderson-PT-10-UpperBounds-11
FORMULA_NAME Anderson-PT-10-UpperBounds-12
FORMULA_NAME Anderson-PT-10-UpperBounds-13
FORMULA_NAME Anderson-PT-10-UpperBounds-14
FORMULA_NAME Anderson-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680825640331

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=Anderson-PT-10
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-07 00:00:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 00:00:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:00:42] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-04-07 00:00:42] [INFO ] Transformed 621 places.
[2023-04-07 00:00:42] [INFO ] Transformed 2480 transitions.
[2023-04-07 00:00:42] [INFO ] Found NUPN structural information;
[2023-04-07 00:00:42] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 2480 rows 621 cols
[2023-04-07 00:00:42] [INFO ] Computed 23 invariants in 80 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 16) seen :12
FORMULA Anderson-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :2
FORMULA Anderson-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
[2023-04-07 00:00:42] [INFO ] Invariant cache hit.
[2023-04-07 00:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2023-04-07 00:00:43] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 10 ms returned sat
[2023-04-07 00:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:00:43] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2023-04-07 00:00:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:00:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2023-04-07 00:00:44] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 00:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:00:44] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2023-04-07 00:00:44] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:00:45] [INFO ] [Nat]Added 90 Read/Feed constraints in 625 ms returned sat
[2023-04-07 00:00:45] [INFO ] Computed and/alt/rep : 110/120/110 causal constraints (skipped 2360 transitions) in 303 ms.
[2023-04-07 00:00:46] [INFO ] Deduced a trap composed of 194 places in 477 ms of which 6 ms to minimize.
[2023-04-07 00:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2023-04-07 00:00:46] [INFO ] Added : 2 causal constraints over 2 iterations in 1383 ms. Result :sat
Minimization took 460 ms.
[2023-04-07 00:00:47] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-04-07 00:00:47] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 00:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:00:48] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2023-04-07 00:00:48] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:00:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-04-07 00:00:48] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 9 ms returned sat
[2023-04-07 00:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:00:49] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2023-04-07 00:00:49] [INFO ] [Nat]Added 90 Read/Feed constraints in 389 ms returned sat
[2023-04-07 00:00:50] [INFO ] Computed and/alt/rep : 110/120/110 causal constraints (skipped 2360 transitions) in 256 ms.
[2023-04-07 00:00:50] [INFO ] Deduced a trap composed of 304 places in 623 ms of which 6 ms to minimize.
[2023-04-07 00:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 803 ms
[2023-04-07 00:00:51] [INFO ] Added : 2 causal constraints over 1 iterations in 1404 ms. Result :sat
Minimization took 417 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 88 Pre rules applied. Total rules applied 0 place count 621 transition count 2392
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 0 with 176 rules applied. Total rules applied 176 place count 533 transition count 2392
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 354 place count 355 transition count 594
Iterating global reduction 0 with 178 rules applied. Total rules applied 532 place count 355 transition count 594
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 536 place count 353 transition count 592
Applied a total of 536 rules in 278 ms. Remains 353 /621 variables (removed 268) and now considering 592/2480 (removed 1888) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 353/621 places, 592/2480 transitions.
// Phase 1: matrix 592 rows 353 cols
[2023-04-07 00:00:51] [INFO ] Computed 23 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3040 ms. (steps per millisecond=328 ) properties (out of 2) seen :1
FORMULA Anderson-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1485 ms. (steps per millisecond=673 ) properties (out of 1) seen :0
[2023-04-07 00:00:56] [INFO ] Invariant cache hit.
[2023-04-07 00:00:56] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-04-07 00:00:56] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 00:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:00:56] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-04-07 00:00:56] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:00:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 00:00:56] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 00:00:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:00:57] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-04-07 00:00:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:00:57] [INFO ] [Nat]Added 90 Read/Feed constraints in 39 ms returned sat
[2023-04-07 00:00:57] [INFO ] Computed and/alt/rep : 22/32/22 causal constraints (skipped 560 transitions) in 41 ms.
[2023-04-07 00:00:57] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 1 ms to minimize.
[2023-04-07 00:00:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-04-07 00:00:57] [INFO ] Added : 2 causal constraints over 2 iterations in 380 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 592/592 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 591
Applied a total of 2 rules in 28 ms. Remains 352 /353 variables (removed 1) and now considering 591/592 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 352/353 places, 591/592 transitions.
// Phase 1: matrix 591 rows 352 cols
[2023-04-07 00:00:57] [INFO ] Computed 23 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2836 ms. (steps per millisecond=352 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties (out of 1) seen :0
[2023-04-07 00:01:01] [INFO ] Invariant cache hit.
[2023-04-07 00:01:02] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-04-07 00:01:02] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 00:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:01:02] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-04-07 00:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:01:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-04-07 00:01:02] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 13 ms returned sat
[2023-04-07 00:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:01:02] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-04-07 00:01:02] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:01:02] [INFO ] [Nat]Added 90 Read/Feed constraints in 60 ms returned sat
[2023-04-07 00:01:02] [INFO ] Computed and/alt/rep : 21/31/21 causal constraints (skipped 560 transitions) in 40 ms.
[2023-04-07 00:01:02] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 1 ms to minimize.
[2023-04-07 00:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-04-07 00:01:02] [INFO ] Added : 2 causal constraints over 1 iterations in 378 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 352/352 places, 591/591 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2023-04-07 00:01:03] [INFO ] Invariant cache hit.
[2023-04-07 00:01:03] [INFO ] Implicit Places using invariants in 412 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 414 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 351/352 places, 591/591 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 351 transition count 491
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 251 transition count 491
Applied a total of 200 rules in 14 ms. Remains 251 /351 variables (removed 100) and now considering 491/591 (removed 100) transitions.
// Phase 1: matrix 491 rows 251 cols
[2023-04-07 00:01:03] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 00:01:03] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-04-07 00:01:03] [INFO ] Invariant cache hit.
[2023-04-07 00:01:04] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:01:04] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 251/352 places, 491/591 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1437 ms. Remains : 251/352 places, 491/591 transitions.
[2023-04-07 00:01:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2225 ms. (steps per millisecond=449 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 1) seen :0
[2023-04-07 00:01:07] [INFO ] Invariant cache hit.
[2023-04-07 00:01:07] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 00:01:07] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 00:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:01:08] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-04-07 00:01:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:01:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-04-07 00:01:08] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 00:01:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:01:08] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-04-07 00:01:08] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:01:08] [INFO ] [Nat]Added 90 Read/Feed constraints in 51 ms returned sat
[2023-04-07 00:01:08] [INFO ] Computed and/alt/rep : 21/31/21 causal constraints (skipped 460 transitions) in 27 ms.
[2023-04-07 00:01:08] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2023-04-07 00:01:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-04-07 00:01:08] [INFO ] Added : 2 causal constraints over 2 iterations in 268 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 491/491 transitions.
Applied a total of 0 rules in 14 ms. Remains 251 /251 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 251/251 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 491/491 transitions.
Applied a total of 0 rules in 12 ms. Remains 251 /251 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2023-04-07 00:01:08] [INFO ] Invariant cache hit.
[2023-04-07 00:01:09] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-04-07 00:01:09] [INFO ] Invariant cache hit.
[2023-04-07 00:01:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:01:09] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-04-07 00:01:09] [INFO ] Redundant transitions in 34 ms returned []
[2023-04-07 00:01:09] [INFO ] Invariant cache hit.
[2023-04-07 00:01:10] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1305 ms. Remains : 251/251 places, 491/491 transitions.
Starting property specific reduction for Anderson-PT-10-UpperBounds-13
[2023-04-07 00:01:10] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-04-07 00:01:10] [INFO ] Invariant cache hit.
[2023-04-07 00:01:10] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 00:01:10] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 00:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:01:10] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-04-07 00:01:10] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:01:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 00:01:10] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-07 00:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:01:10] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-04-07 00:01:10] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:01:10] [INFO ] [Nat]Added 90 Read/Feed constraints in 49 ms returned sat
[2023-04-07 00:01:10] [INFO ] Computed and/alt/rep : 21/31/21 causal constraints (skipped 460 transitions) in 32 ms.
[2023-04-07 00:01:10] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 0 ms to minimize.
[2023-04-07 00:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-04-07 00:01:10] [INFO ] Added : 2 causal constraints over 2 iterations in 282 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 491/491 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 251/251 places, 491/491 transitions.
[2023-04-07 00:01:10] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2228 ms. (steps per millisecond=448 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 1) seen :0
[2023-04-07 00:01:14] [INFO ] Invariant cache hit.
[2023-04-07 00:01:14] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 00:01:14] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 00:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:01:14] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-04-07 00:01:14] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:01:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 00:01:14] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 00:01:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:01:14] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-04-07 00:01:14] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:01:14] [INFO ] [Nat]Added 90 Read/Feed constraints in 54 ms returned sat
[2023-04-07 00:01:14] [INFO ] Computed and/alt/rep : 21/31/21 causal constraints (skipped 460 transitions) in 29 ms.
[2023-04-07 00:01:14] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2023-04-07 00:01:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-07 00:01:14] [INFO ] Added : 2 causal constraints over 2 iterations in 291 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 491/491 transitions.
Applied a total of 0 rules in 16 ms. Remains 251 /251 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 251/251 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 491/491 transitions.
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2023-04-07 00:01:15] [INFO ] Invariant cache hit.
[2023-04-07 00:01:15] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-04-07 00:01:15] [INFO ] Invariant cache hit.
[2023-04-07 00:01:15] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 00:01:15] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2023-04-07 00:01:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 00:01:16] [INFO ] Invariant cache hit.
[2023-04-07 00:01:16] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1329 ms. Remains : 251/251 places, 491/491 transitions.
Ending property specific reduction for Anderson-PT-10-UpperBounds-13 in 6303 ms.
[2023-04-07 00:01:16] [INFO ] Flatten gal took : 99 ms
[2023-04-07 00:01:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-04-07 00:01:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 251 places, 491 transitions and 1962 arcs took 4 ms.
Total runtime 34584 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Anderson (PT), instance 10
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: 251 places, 491 transitions, 1962 arcs.
Final Score: 16588.7
Took : 23 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8705016 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16108012 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="Anderson-PT-10"
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 Anderson-PT-10, 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 r523-tall-167987247500053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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