About the Execution of Marcie+red for PolyORBNT-PT-S10J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6998.020 | 3600000.00 | 3660543.00 | 9884.80 | 1 2 1 1 4 10 1 1 3 ? 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.r298-tall-167873952200765.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 PolyORBNT-PT-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952200765
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 20K Feb 26 00:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 00:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 973K Feb 26 00:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 00:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 306K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 245K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 26 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J30-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679664623994
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=PolyORBNT-PT-S10J30
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 13:30:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 13:30:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 13:30:26] [INFO ] Load time of PNML (sax parser for PT used): 568 ms
[2023-03-24 13:30:26] [INFO ] Transformed 664 places.
[2023-03-24 13:30:26] [INFO ] Transformed 12050 transitions.
[2023-03-24 13:30:26] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 717 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1931 out of 1940 initially.
// Phase 1: matrix 1931 rows 664 cols
[2023-03-24 13:30:26] [INFO ] Computed 92 place invariants in 130 ms
FORMULA PolyORBNT-PT-S10J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 561 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :20
FORMULA PolyORBNT-PT-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :13
[2023-03-24 13:30:27] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-24 13:30:27] [INFO ] Computed 92 place invariants in 57 ms
[2023-03-24 13:30:27] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2023-03-24 13:30:27] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 26 ms returned unsat
[2023-03-24 13:30:27] [INFO ] [Real]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 13:30:27] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 13:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:28] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2023-03-24 13:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:30:28] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 13:30:28] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 13:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:31] [INFO ] [Nat]Absence check using state equation in 3376 ms returned sat
[2023-03-24 13:30:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:30:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 92 ms returned sat
[2023-03-24 13:30:32] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 208 ms.
[2023-03-24 13:30:32] [INFO ] Added : 35 causal constraints over 7 iterations in 918 ms. Result :sat
Minimization took 403 ms.
[2023-03-24 13:30:33] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:30:33] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 13 ms returned unsat
[2023-03-24 13:30:33] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:30:33] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 13:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:34] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-24 13:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:30:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 13:30:34] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 13:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:35] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2023-03-24 13:30:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 246 ms returned sat
[2023-03-24 13:30:35] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 126 ms.
[2023-03-24 13:30:39] [INFO ] Added : 5 causal constraints over 1 iterations in 3550 ms. Result :unknown
[2023-03-24 13:30:39] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:30:39] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 13:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:39] [INFO ] [Real]Absence check using state equation in 365 ms returned unsat
[2023-03-24 13:30:39] [INFO ] [Real]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 13:30:39] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned unsat
[2023-03-24 13:30:39] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:30:39] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned unsat
[2023-03-24 13:30:40] [INFO ] [Real]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-24 13:30:40] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 13:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:40] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2023-03-24 13:30:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:30:40] [INFO ] [Nat]Absence check using 63 positive place invariants in 18 ms returned sat
[2023-03-24 13:30:40] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-24 13:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:41] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2023-03-24 13:30:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 13:30:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 3811 ms returned unknown
[2023-03-24 13:30:45] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 13:30:45] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 13:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:46] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2023-03-24 13:30:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:30:46] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 13:30:46] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-24 13:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:48] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2023-03-24 13:30:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 172 ms returned sat
[2023-03-24 13:30:48] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 129 ms.
[2023-03-24 13:30:48] [INFO ] Added : 12 causal constraints over 3 iterations in 459 ms. Result :sat
Minimization took 791 ms.
[2023-03-24 13:30:49] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 13:30:49] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-24 13:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:50] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-24 13:30:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:30:50] [INFO ] [Nat]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 13:30:50] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-24 13:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:55] [INFO ] [Nat]Absence check using state equation in 4908 ms returned unknown
[2023-03-24 13:30:55] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2023-03-24 13:30:55] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned unsat
[2023-03-24 13:30:55] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:30:55] [INFO ] [Real]Absence check using 63 positive and 29 generalized place invariants in 28 ms returned sat
[2023-03-24 13:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:56] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2023-03-24 13:30:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:30:56] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-24 13:30:56] [INFO ] [Nat]Absence check using 63 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-24 13:30:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:30:57] [INFO ] [Nat]Absence check using state equation in 1075 ms returned sat
[2023-03-24 13:30:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 438 ms returned sat
[2023-03-24 13:30:58] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 139 ms.
[2023-03-24 13:30:58] [INFO ] Added : 12 causal constraints over 3 iterations in 469 ms. Result :sat
Minimization took 1428 ms.
Current structural bounds on expressions (after SMT) : [1, 151, 1, 280, 10, 1, 1, 226, 302, 4, 1, 302] Max seen :[1, 0, 1, 1, 10, 1, 1, 0, 1, 0, 1, 1]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 81 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 82 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 150 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 583 transition count 1869
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 3 with 4 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 344 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
[2023-03-24 13:31:00] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2023-03-24 13:31:00] [INFO ] Computed 82 place invariants in 30 ms
[2023-03-24 13:31:01] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 581/664 places, 1252/1940 transitions.
Applied a total of 0 rules in 57 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1259 ms. Remains : 581/664 places, 1252/1940 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:31:01] [INFO ] Computed 82 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 70232 resets, run finished after 6834 ms. (steps per millisecond=146 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8881 resets, run finished after 1419 ms. (steps per millisecond=704 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 6102 resets, run finished after 1515 ms. (steps per millisecond=660 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 8862 resets, run finished after 1416 ms. (steps per millisecond=706 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8920 resets, run finished after 1403 ms. (steps per millisecond=712 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 1000001 steps, including 8724 resets, run finished after 1397 ms. (steps per millisecond=715 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 8845 resets, run finished after 1407 ms. (steps per millisecond=710 ) properties (out of 6) seen :14
[2023-03-24 13:31:17] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:31:17] [INFO ] Computed 82 place invariants in 25 ms
[2023-03-24 13:31:17] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:31:17] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-24 13:31:17] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:31:17] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 5 ms returned unsat
[2023-03-24 13:31:17] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-24 13:31:17] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 4 ms returned unsat
[2023-03-24 13:31:17] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-24 13:31:17] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 13:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:31:18] [INFO ] [Real]Absence check using state equation in 1124 ms returned sat
[2023-03-24 13:31:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:31:18] [INFO ] [Nat]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-24 13:31:18] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-24 13:31:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:31:19] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2023-03-24 13:31:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:31:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1087 ms returned sat
[2023-03-24 13:31:20] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 4 ms to minimize.
[2023-03-24 13:31:20] [INFO ] Deduced a trap composed of 216 places in 271 ms of which 1 ms to minimize.
[2023-03-24 13:31:21] [INFO ] Deduced a trap composed of 243 places in 268 ms of which 1 ms to minimize.
[2023-03-24 13:31:21] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:31:21] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 2 ms to minimize.
[2023-03-24 13:31:22] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 1 ms to minimize.
[2023-03-24 13:31:22] [INFO ] Deduced a trap composed of 222 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:31:22] [INFO ] Deduced a trap composed of 240 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:31:23] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:31:23] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:31:23] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:31:24] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:31:24] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:31:24] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:31:25] [INFO ] Deduced a trap composed of 239 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:31:26] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 1 ms to minimize.
[2023-03-24 13:31:27] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-24 13:31:27] [INFO ] Deduced a trap composed of 222 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:31:28] [INFO ] Deduced a trap composed of 238 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:31:28] [INFO ] Deduced a trap composed of 226 places in 275 ms of which 0 ms to minimize.
[2023-03-24 13:31:29] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 0 ms to minimize.
[2023-03-24 13:31:29] [INFO ] Deduced a trap composed of 216 places in 270 ms of which 0 ms to minimize.
[2023-03-24 13:31:29] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 1 ms to minimize.
[2023-03-24 13:31:30] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 0 ms to minimize.
[2023-03-24 13:31:30] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 1 ms to minimize.
[2023-03-24 13:31:31] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:31:31] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:31:31] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:31:32] [INFO ] Deduced a trap composed of 238 places in 268 ms of which 0 ms to minimize.
[2023-03-24 13:31:32] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 0 ms to minimize.
[2023-03-24 13:31:33] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:31:33] [INFO ] Deduced a trap composed of 243 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:31:33] [INFO ] Deduced a trap composed of 238 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:31:34] [INFO ] Deduced a trap composed of 238 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:31:34] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:31:34] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:31:35] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:31:35] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-24 13:31:36] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:31:36] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 1 ms to minimize.
[2023-03-24 13:31:36] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 0 ms to minimize.
[2023-03-24 13:31:37] [INFO ] Deduced a trap composed of 237 places in 274 ms of which 1 ms to minimize.
[2023-03-24 13:31:37] [INFO ] Deduced a trap composed of 244 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:31:38] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:31:38] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:31:38] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:31:38] [INFO ] Deduced a trap composed of 224 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:31:39] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 1 ms to minimize.
[2023-03-24 13:31:39] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:31:40] [INFO ] Deduced a trap composed of 222 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:31:40] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:31:41] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:31:41] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:31:41] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:31:42] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:31:42] [INFO ] Deduced a trap composed of 229 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:31:43] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 2 ms to minimize.
[2023-03-24 13:31:43] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:31:43] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:31:44] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:31:44] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:31:44] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:31:45] [INFO ] Deduced a trap composed of 242 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:31:45] [INFO ] Deduced a trap composed of 222 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:31:45] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 3 ms to minimize.
[2023-03-24 13:31:46] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:31:46] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:31:46] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:31:47] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:31:47] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:31:49] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:31:49] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:31:50] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:31:50] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2023-03-24 13:31:51] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:31:51] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:31:51] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:31:52] [INFO ] Deduced a trap composed of 231 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:31:52] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:31:53] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:31:53] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:31:53] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:31:54] [INFO ] Deduced a trap composed of 239 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:31:57] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 36853 ms
[2023-03-24 13:31:57] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:31:57] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 2 ms returned unsat
[2023-03-24 13:31:57] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-24 13:31:57] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 16 ms returned sat
[2023-03-24 13:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:31:58] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2023-03-24 13:31:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:31:58] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:31:58] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 13:31:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:31:59] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2023-03-24 13:31:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 453 ms returned sat
[2023-03-24 13:32:00] [INFO ] Deduced a trap composed of 250 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:32:00] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 0 ms to minimize.
[2023-03-24 13:32:00] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:32:01] [INFO ] Deduced a trap composed of 238 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:32:01] [INFO ] Deduced a trap composed of 237 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:32:01] [INFO ] Deduced a trap composed of 241 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:32:01] [INFO ] Deduced a trap composed of 222 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:32:02] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:32:02] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:32:02] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:32:03] [INFO ] Deduced a trap composed of 249 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:32:03] [INFO ] Deduced a trap composed of 233 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:32:04] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:32:04] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:32:04] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:32:05] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:32:05] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:32:05] [INFO ] Deduced a trap composed of 234 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:32:06] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:32:06] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:32:06] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-24 13:32:07] [INFO ] Deduced a trap composed of 251 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:32:08] [INFO ] Deduced a trap composed of 253 places in 251 ms of which 0 ms to minimize.
[2023-03-24 13:32:08] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:32:08] [INFO ] Deduced a trap composed of 241 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:32:09] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:32:09] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:32:09] [INFO ] Deduced a trap composed of 225 places in 274 ms of which 1 ms to minimize.
[2023-03-24 13:32:10] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-24 13:32:10] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:32:10] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:32:11] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:32:11] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:32:11] [INFO ] Deduced a trap composed of 229 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:32:12] [INFO ] Deduced a trap composed of 233 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:32:12] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:32:13] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:32:13] [INFO ] Deduced a trap composed of 229 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:32:13] [INFO ] Deduced a trap composed of 241 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:32:14] [INFO ] Deduced a trap composed of 224 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:32:14] [INFO ] Deduced a trap composed of 245 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:32:15] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:32:16] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2023-03-24 13:32:17] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:32:17] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-24 13:32:17] [INFO ] Deduced a trap composed of 238 places in 271 ms of which 0 ms to minimize.
[2023-03-24 13:32:18] [INFO ] Deduced a trap composed of 237 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:32:18] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:32:18] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:32:19] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:32:19] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:32:20] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:32:20] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:32:20] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:32:21] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 0 ms to minimize.
[2023-03-24 13:32:21] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:32:21] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 2 ms to minimize.
[2023-03-24 13:32:22] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 0 ms to minimize.
[2023-03-24 13:32:22] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:32:22] [INFO ] Deduced a trap composed of 250 places in 262 ms of which 2 ms to minimize.
[2023-03-24 13:32:23] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:32:23] [INFO ] Deduced a trap composed of 228 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:32:24] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:32:24] [INFO ] Deduced a trap composed of 244 places in 271 ms of which 0 ms to minimize.
[2023-03-24 13:32:25] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:32:27] [INFO ] Deduced a trap composed of 237 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:32:28] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:32:28] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:32:29] [INFO ] Deduced a trap composed of 240 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:32:30] [INFO ] Deduced a trap composed of 243 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:32:30] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:32:30] [INFO ] Deduced a trap composed of 241 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:32:31] [INFO ] Deduced a trap composed of 245 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:32:31] [INFO ] Deduced a trap composed of 231 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:32:34] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 34704 ms
Current structural bounds on expressions (after SMT) : [2, 4, 3, 60, 1, 60] Max seen :[2, 4, 3, 3, 1, 3]
FORMULA PolyORBNT-PT-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 33 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:32:34] [INFO ] Computed 82 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 70451 resets, run finished after 6314 ms. (steps per millisecond=158 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8761 resets, run finished after 1375 ms. (steps per millisecond=727 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 8858 resets, run finished after 1391 ms. (steps per millisecond=718 ) properties (out of 2) seen :4
[2023-03-24 13:32:43] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:32:43] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-24 13:32:43] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-24 13:32:43] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-24 13:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:32:44] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2023-03-24 13:32:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:32:45] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:32:45] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 13:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:32:45] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2023-03-24 13:32:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:32:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1107 ms returned sat
[2023-03-24 13:32:47] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 0 ms to minimize.
[2023-03-24 13:32:47] [INFO ] Deduced a trap composed of 216 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:32:47] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:32:47] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:32:48] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:32:48] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 1 ms to minimize.
[2023-03-24 13:32:48] [INFO ] Deduced a trap composed of 222 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:32:49] [INFO ] Deduced a trap composed of 240 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:32:49] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:32:49] [INFO ] Deduced a trap composed of 228 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:32:50] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 1 ms to minimize.
[2023-03-24 13:32:50] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2023-03-24 13:32:50] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:32:51] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:32:51] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:32:52] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2023-03-24 13:32:53] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:32:54] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:32:54] [INFO ] Deduced a trap composed of 238 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:32:55] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:32:55] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 0 ms to minimize.
[2023-03-24 13:32:55] [INFO ] Deduced a trap composed of 216 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:32:56] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 1 ms to minimize.
[2023-03-24 13:32:56] [INFO ] Deduced a trap composed of 224 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:32:57] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:32:57] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:32:57] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:32:58] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 0 ms to minimize.
[2023-03-24 13:32:59] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:32:59] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:32:59] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:32:59] [INFO ] Deduced a trap composed of 243 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:33:00] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:33:00] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:33:00] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:33:01] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 1 ms to minimize.
[2023-03-24 13:33:01] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:33:02] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:33:02] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:33:02] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:33:03] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-24 13:33:03] [INFO ] Deduced a trap composed of 237 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:33:04] [INFO ] Deduced a trap composed of 244 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:33:04] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:33:04] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:33:04] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:33:05] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:33:05] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:33:06] [INFO ] Deduced a trap composed of 228 places in 257 ms of which 1 ms to minimize.
[2023-03-24 13:33:06] [INFO ] Deduced a trap composed of 222 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:33:07] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:33:07] [INFO ] Deduced a trap composed of 226 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:33:07] [INFO ] Deduced a trap composed of 226 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:33:08] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:08] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:33:09] [INFO ] Deduced a trap composed of 229 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:33:09] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:33:09] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:33:10] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 1 ms to minimize.
[2023-03-24 13:33:10] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:33:10] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:33:11] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:33:11] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 0 ms to minimize.
[2023-03-24 13:33:11] [INFO ] Deduced a trap composed of 222 places in 269 ms of which 0 ms to minimize.
[2023-03-24 13:33:12] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 0 ms to minimize.
[2023-03-24 13:33:12] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:33:12] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:13] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:33:13] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:33:13] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-24 13:33:15] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:33:16] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:33:16] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:33:17] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:33:17] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:33:17] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:18] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-24 13:33:18] [INFO ] Deduced a trap composed of 231 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:33:19] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:33:19] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-24 13:33:19] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:33:20] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:33:20] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:33:23] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 36822 ms
[2023-03-24 13:33:23] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-24 13:33:23] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-24 13:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:33:24] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2023-03-24 13:33:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:33:24] [INFO ] [Nat]Absence check using 63 positive place invariants in 16 ms returned sat
[2023-03-24 13:33:24] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 11 ms returned sat
[2023-03-24 13:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:33:25] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2023-03-24 13:33:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 457 ms returned sat
[2023-03-24 13:33:26] [INFO ] Deduced a trap composed of 250 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:33:26] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:33:27] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:33:27] [INFO ] Deduced a trap composed of 238 places in 270 ms of which 0 ms to minimize.
[2023-03-24 13:33:27] [INFO ] Deduced a trap composed of 237 places in 265 ms of which 0 ms to minimize.
[2023-03-24 13:33:27] [INFO ] Deduced a trap composed of 241 places in 254 ms of which 0 ms to minimize.
[2023-03-24 13:33:28] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:33:28] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-24 13:33:28] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 2 ms to minimize.
[2023-03-24 13:33:29] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:33:29] [INFO ] Deduced a trap composed of 249 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:33:29] [INFO ] Deduced a trap composed of 233 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:33:30] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-24 13:33:30] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:31] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 1 ms to minimize.
[2023-03-24 13:33:31] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:33:31] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-24 13:33:32] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:33:32] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:33:32] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:33:33] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:33:34] [INFO ] Deduced a trap composed of 251 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:33:34] [INFO ] Deduced a trap composed of 253 places in 268 ms of which 0 ms to minimize.
[2023-03-24 13:33:34] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2023-03-24 13:33:35] [INFO ] Deduced a trap composed of 241 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:33:35] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:33:35] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:33:36] [INFO ] Deduced a trap composed of 225 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:33:36] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:36] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:37] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 0 ms to minimize.
[2023-03-24 13:33:37] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:33:37] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:38] [INFO ] Deduced a trap composed of 229 places in 256 ms of which 1 ms to minimize.
[2023-03-24 13:33:38] [INFO ] Deduced a trap composed of 233 places in 254 ms of which 0 ms to minimize.
[2023-03-24 13:33:38] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 0 ms to minimize.
[2023-03-24 13:33:39] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:33:39] [INFO ] Deduced a trap composed of 229 places in 256 ms of which 1 ms to minimize.
[2023-03-24 13:33:40] [INFO ] Deduced a trap composed of 241 places in 254 ms of which 1 ms to minimize.
[2023-03-24 13:33:40] [INFO ] Deduced a trap composed of 224 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:33:40] [INFO ] Deduced a trap composed of 245 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:41] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:33:43] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:33:43] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-24 13:33:43] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:33:44] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2023-03-24 13:33:44] [INFO ] Deduced a trap composed of 237 places in 255 ms of which 1 ms to minimize.
[2023-03-24 13:33:44] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:33:45] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 1 ms to minimize.
[2023-03-24 13:33:45] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:33:45] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:33:46] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 0 ms to minimize.
[2023-03-24 13:33:46] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:33:47] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:33:47] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:33:47] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:48] [INFO ] Deduced a trap composed of 234 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:33:48] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 0 ms to minimize.
[2023-03-24 13:33:48] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:33:49] [INFO ] Deduced a trap composed of 250 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:33:49] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:33:49] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:33:50] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:33:50] [INFO ] Deduced a trap composed of 244 places in 267 ms of which 0 ms to minimize.
[2023-03-24 13:33:52] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:33:53] [INFO ] Deduced a trap composed of 237 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:33:54] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:33:54] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-24 13:33:55] [INFO ] Deduced a trap composed of 240 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:33:56] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:33:56] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:33:57] [INFO ] Deduced a trap composed of 241 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:33:57] [INFO ] Deduced a trap composed of 245 places in 253 ms of which 0 ms to minimize.
[2023-03-24 13:33:57] [INFO ] Deduced a trap composed of 231 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:34:00] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 34637 ms
Current structural bounds on expressions (after SMT) : [60, 60] Max seen :[3, 3]
Support contains 2 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 31 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 13:34:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:34:00] [INFO ] Invariant cache hit.
[2023-03-24 13:34:01] [INFO ] Implicit Places using invariants in 673 ms returned []
[2023-03-24 13:34:01] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:34:01] [INFO ] Invariant cache hit.
[2023-03-24 13:34:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:34:09] [INFO ] Implicit Places using invariants and state equation in 7484 ms returned []
Implicit Place search using SMT with State Equation took 8159 ms to find 0 implicit places.
[2023-03-24 13:34:09] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-24 13:34:09] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:34:09] [INFO ] Invariant cache hit.
[2023-03-24 13:34:09] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8912 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:34:09] [INFO ] Computed 82 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 702 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-24 13:34:09] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:34:09] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-24 13:34:09] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:34:10] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 18 ms returned sat
[2023-03-24 13:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:34:11] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2023-03-24 13:34:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:34:11] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:34:11] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 13:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:34:11] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2023-03-24 13:34:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:34:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1110 ms returned sat
[2023-03-24 13:34:13] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:34:13] [INFO ] Deduced a trap composed of 216 places in 257 ms of which 1 ms to minimize.
[2023-03-24 13:34:13] [INFO ] Deduced a trap composed of 243 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:34:14] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:34:14] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:34:14] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:34:15] [INFO ] Deduced a trap composed of 222 places in 269 ms of which 0 ms to minimize.
[2023-03-24 13:34:15] [INFO ] Deduced a trap composed of 240 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:34:15] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:34:16] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:34:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 31 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 13:34:16] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:34:16] [INFO ] Invariant cache hit.
[2023-03-24 13:34:16] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:34:16] [INFO ] Computed 82 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 70353 resets, run finished after 6364 ms. (steps per millisecond=157 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8768 resets, run finished after 1370 ms. (steps per millisecond=729 ) properties (out of 1) seen :3
[2023-03-24 13:34:24] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:34:24] [INFO ] Computed 82 place invariants in 28 ms
[2023-03-24 13:34:24] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-24 13:34:24] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 13:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:34:25] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2023-03-24 13:34:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:34:25] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2023-03-24 13:34:26] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-24 13:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:34:26] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2023-03-24 13:34:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:34:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1114 ms returned sat
[2023-03-24 13:34:27] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:34:28] [INFO ] Deduced a trap composed of 216 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:34:28] [INFO ] Deduced a trap composed of 243 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:34:28] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 0 ms to minimize.
[2023-03-24 13:34:29] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:34:29] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:34:29] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:34:30] [INFO ] Deduced a trap composed of 240 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:34:30] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:34:30] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-24 13:34:31] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:34:31] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:34:31] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:34:32] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2023-03-24 13:34:32] [INFO ] Deduced a trap composed of 239 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:34:33] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:34:34] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-24 13:34:35] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:34:35] [INFO ] Deduced a trap composed of 238 places in 271 ms of which 0 ms to minimize.
[2023-03-24 13:34:36] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:34:36] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 0 ms to minimize.
[2023-03-24 13:34:36] [INFO ] Deduced a trap composed of 216 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:34:37] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:34:37] [INFO ] Deduced a trap composed of 224 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:34:38] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:34:38] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:34:38] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 0 ms to minimize.
[2023-03-24 13:34:39] [INFO ] Deduced a trap composed of 230 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:34:40] [INFO ] Deduced a trap composed of 238 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:34:40] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:34:40] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:34:40] [INFO ] Deduced a trap composed of 243 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:34:41] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 1 ms to minimize.
[2023-03-24 13:34:41] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:34:41] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:34:42] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 1 ms to minimize.
[2023-03-24 13:34:42] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:34:43] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:34:43] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:34:43] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:34:44] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 0 ms to minimize.
[2023-03-24 13:34:44] [INFO ] Deduced a trap composed of 237 places in 275 ms of which 1 ms to minimize.
[2023-03-24 13:34:44] [INFO ] Deduced a trap composed of 244 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:34:45] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:34:45] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:34:45] [INFO ] Deduced a trap composed of 236 places in 269 ms of which 0 ms to minimize.
[2023-03-24 13:34:46] [INFO ] Deduced a trap composed of 224 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:34:46] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 0 ms to minimize.
[2023-03-24 13:34:47] [INFO ] Deduced a trap composed of 228 places in 276 ms of which 0 ms to minimize.
[2023-03-24 13:34:47] [INFO ] Deduced a trap composed of 222 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:34:48] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:34:48] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:34:48] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 1 ms to minimize.
[2023-03-24 13:34:49] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:34:49] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:34:50] [INFO ] Deduced a trap composed of 229 places in 271 ms of which 1 ms to minimize.
[2023-03-24 13:34:50] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:34:50] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:34:51] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 0 ms to minimize.
[2023-03-24 13:34:51] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:34:51] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:34:52] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 1 ms to minimize.
[2023-03-24 13:34:52] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:34:52] [INFO ] Deduced a trap composed of 222 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:34:53] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2023-03-24 13:34:53] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:34:53] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 0 ms to minimize.
[2023-03-24 13:34:54] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:34:54] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:34:54] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:34:56] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:34:57] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-24 13:34:57] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:34:58] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:34:58] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:34:58] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 0 ms to minimize.
[2023-03-24 13:34:59] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 1 ms to minimize.
[2023-03-24 13:34:59] [INFO ] Deduced a trap composed of 231 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:35:00] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 0 ms to minimize.
[2023-03-24 13:35:00] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:35:00] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:35:01] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:35:01] [INFO ] Deduced a trap composed of 239 places in 254 ms of which 1 ms to minimize.
[2023-03-24 13:35:04] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 36787 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 30 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 13:35:04] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:35:04] [INFO ] Invariant cache hit.
[2023-03-24 13:35:05] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-24 13:35:05] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:35:05] [INFO ] Invariant cache hit.
[2023-03-24 13:35:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:35:12] [INFO ] Implicit Places using invariants and state equation in 6935 ms returned []
Implicit Place search using SMT with State Equation took 7577 ms to find 0 implicit places.
[2023-03-24 13:35:12] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-24 13:35:12] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:35:12] [INFO ] Invariant cache hit.
[2023-03-24 13:35:12] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8249 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-09 in 62988 ms.
Starting property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:35:12] [INFO ] Computed 82 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 692 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2023-03-24 13:35:12] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:35:12] [INFO ] Computed 82 place invariants in 25 ms
[2023-03-24 13:35:12] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:35:12] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-24 13:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:35:14] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2023-03-24 13:35:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:35:14] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:35:14] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-24 13:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:35:15] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2023-03-24 13:35:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:35:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 466 ms returned sat
[2023-03-24 13:35:15] [INFO ] Deduced a trap composed of 250 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:35:16] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:35:16] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:35:16] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:35:17] [INFO ] Deduced a trap composed of 237 places in 258 ms of which 0 ms to minimize.
[2023-03-24 13:35:17] [INFO ] Deduced a trap composed of 241 places in 254 ms of which 1 ms to minimize.
[2023-03-24 13:35:17] [INFO ] Deduced a trap composed of 222 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:35:17] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:35:18] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:35:18] [INFO ] Deduced a trap composed of 234 places in 268 ms of which 1 ms to minimize.
[2023-03-24 13:35:18] [INFO ] Deduced a trap composed of 249 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:35:19] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:35:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 13:35:19] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:35:19] [INFO ] Invariant cache hit.
[2023-03-24 13:35:19] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 641 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:35:19] [INFO ] Computed 82 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 70376 resets, run finished after 6355 ms. (steps per millisecond=157 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 8858 resets, run finished after 1375 ms. (steps per millisecond=727 ) properties (out of 1) seen :3
[2023-03-24 13:35:27] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 13:35:27] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-24 13:35:27] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:35:27] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 20 ms returned sat
[2023-03-24 13:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:35:28] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2023-03-24 13:35:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:35:28] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 13:35:28] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-24 13:35:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:35:29] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2023-03-24 13:35:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:35:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 461 ms returned sat
[2023-03-24 13:35:30] [INFO ] Deduced a trap composed of 250 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:35:30] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2023-03-24 13:35:31] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:35:31] [INFO ] Deduced a trap composed of 238 places in 268 ms of which 0 ms to minimize.
[2023-03-24 13:35:31] [INFO ] Deduced a trap composed of 237 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:35:32] [INFO ] Deduced a trap composed of 241 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:35:32] [INFO ] Deduced a trap composed of 222 places in 265 ms of which 0 ms to minimize.
[2023-03-24 13:35:32] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 0 ms to minimize.
[2023-03-24 13:35:32] [INFO ] Deduced a trap composed of 232 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:35:33] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:35:33] [INFO ] Deduced a trap composed of 249 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:35:33] [INFO ] Deduced a trap composed of 233 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:35:34] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:35:34] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:35:35] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-24 13:35:35] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 0 ms to minimize.
[2023-03-24 13:35:35] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2023-03-24 13:35:36] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:35:36] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 1 ms to minimize.
[2023-03-24 13:35:36] [INFO ] Deduced a trap composed of 234 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:35:37] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2023-03-24 13:35:38] [INFO ] Deduced a trap composed of 251 places in 267 ms of which 1 ms to minimize.
[2023-03-24 13:35:38] [INFO ] Deduced a trap composed of 253 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:35:38] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:35:39] [INFO ] Deduced a trap composed of 241 places in 255 ms of which 0 ms to minimize.
[2023-03-24 13:35:39] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:35:39] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 1 ms to minimize.
[2023-03-24 13:35:40] [INFO ] Deduced a trap composed of 225 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:35:40] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:35:41] [INFO ] Deduced a trap composed of 226 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:35:41] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:35:41] [INFO ] Deduced a trap composed of 226 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:35:42] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:35:42] [INFO ] Deduced a trap composed of 229 places in 256 ms of which 1 ms to minimize.
[2023-03-24 13:35:42] [INFO ] Deduced a trap composed of 233 places in 258 ms of which 1 ms to minimize.
[2023-03-24 13:35:43] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-24 13:35:43] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 1 ms to minimize.
[2023-03-24 13:35:44] [INFO ] Deduced a trap composed of 229 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:35:44] [INFO ] Deduced a trap composed of 241 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:35:44] [INFO ] Deduced a trap composed of 224 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:35:45] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 0 ms to minimize.
[2023-03-24 13:35:45] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 1 ms to minimize.
[2023-03-24 13:35:47] [INFO ] Deduced a trap composed of 232 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:35:47] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:35:48] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 0 ms to minimize.
[2023-03-24 13:35:48] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 1 ms to minimize.
[2023-03-24 13:35:48] [INFO ] Deduced a trap composed of 237 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:35:48] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:35:49] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:35:49] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:35:50] [INFO ] Deduced a trap composed of 239 places in 257 ms of which 0 ms to minimize.
[2023-03-24 13:35:50] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:35:50] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:35:51] [INFO ] Deduced a trap composed of 228 places in 260 ms of which 0 ms to minimize.
[2023-03-24 13:35:51] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 0 ms to minimize.
[2023-03-24 13:35:51] [INFO ] Deduced a trap composed of 224 places in 264 ms of which 0 ms to minimize.
[2023-03-24 13:35:52] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-24 13:35:52] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:35:52] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:35:53] [INFO ] Deduced a trap composed of 250 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:35:53] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:35:54] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 1 ms to minimize.
[2023-03-24 13:35:54] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 1 ms to minimize.
[2023-03-24 13:35:55] [INFO ] Deduced a trap composed of 244 places in 262 ms of which 1 ms to minimize.
[2023-03-24 13:35:56] [INFO ] Deduced a trap composed of 248 places in 257 ms of which 1 ms to minimize.
[2023-03-24 13:35:58] [INFO ] Deduced a trap composed of 237 places in 259 ms of which 0 ms to minimize.
[2023-03-24 13:35:58] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 1 ms to minimize.
[2023-03-24 13:35:59] [INFO ] Deduced a trap composed of 234 places in 264 ms of which 1 ms to minimize.
[2023-03-24 13:35:59] [INFO ] Deduced a trap composed of 240 places in 256 ms of which 0 ms to minimize.
[2023-03-24 13:36:00] [INFO ] Deduced a trap composed of 243 places in 261 ms of which 0 ms to minimize.
[2023-03-24 13:36:00] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-24 13:36:01] [INFO ] Deduced a trap composed of 241 places in 263 ms of which 0 ms to minimize.
[2023-03-24 13:36:01] [INFO ] Deduced a trap composed of 245 places in 254 ms of which 0 ms to minimize.
[2023-03-24 13:36:01] [INFO ] Deduced a trap composed of 231 places in 261 ms of which 1 ms to minimize.
[2023-03-24 13:36:04] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 34801 ms
Current structural bounds on expressions (after SMT) : [60] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 27 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 26 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-24 13:36:05] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:36:05] [INFO ] Invariant cache hit.
[2023-03-24 13:36:05] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-24 13:36:05] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:36:05] [INFO ] Invariant cache hit.
[2023-03-24 13:36:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 13:36:13] [INFO ] Implicit Places using invariants and state equation in 7423 ms returned []
Implicit Place search using SMT with State Equation took 8095 ms to find 0 implicit places.
[2023-03-24 13:36:13] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-24 13:36:13] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 13:36:13] [INFO ] Invariant cache hit.
[2023-03-24 13:36:13] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8821 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J30-UpperBounds-14 in 61097 ms.
[2023-03-24 13:36:14] [INFO ] Flatten gal took : 175 ms
[2023-03-24 13:36:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-24 13:36:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 581 places, 1252 transitions and 7921 arcs took 13 ms.
Total runtime 348873 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: PolyORBNT_PT_S10J30
(NrP: 581 NrTr: 1252 NrArc: 7921)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.101sec
net check time: 0m 0.001sec
init dd package: 0m 2.730sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9128232 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16078840 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.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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.017sec
1376452
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="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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 r298-tall-167873952200765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;