About the Execution of 2023-gold for PolyORBLF-PT-S06J04T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16221.439 | 3600000.00 | 3529323.00 | 153099.60 | 1 4 1 4 1 1 6 3 1 1 1 1 10 4 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460600196.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-PT-S06J04T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460600196
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M May 18 16:43 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 PolyORBLF-PT-S06J04T04-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717122071567
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 02:21:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 02:21:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 02:21:13] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-05-31 02:21:13] [INFO ] Transformed 454 places.
[2024-05-31 02:21:13] [INFO ] Transformed 6994 transitions.
[2024-05-31 02:21:13] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Normalized transition count is 1590 out of 1614 initially.
// Phase 1: matrix 1590 rows 454 cols
[2024-05-31 02:21:13] [INFO ] Computed 50 invariants in 93 ms
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 49 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :29
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :28
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :27
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :27
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :24
[2024-05-31 02:21:14] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-05-31 02:21:14] [INFO ] Computed 50 invariants in 84 ms
[2024-05-31 02:21:14] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-31 02:21:14] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2024-05-31 02:21:14] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-31 02:21:14] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned unsat
[2024-05-31 02:21:14] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 02:21:14] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned unsat
[2024-05-31 02:21:14] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 02:21:14] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2024-05-31 02:21:15] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 02:21:15] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2024-05-31 02:21:15] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 02:21:15] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2024-05-31 02:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:21:16] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2024-05-31 02:21:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:21:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 02:21:16] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 32 ms returned sat
[2024-05-31 02:21:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:21:20] [INFO ] [Nat]Absence check using state equation in 4263 ms returned sat
[2024-05-31 02:21:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:21:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 02:21:21] [INFO ] [Nat]Added 112 Read/Feed constraints in 589 ms returned unknown
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned unsat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 4 ms returned unsat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned unsat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 02:21:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2024-05-31 02:21:22] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 02:21:22] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2024-05-31 02:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:21:23] [INFO ] [Real]Absence check using state equation in 1445 ms returned sat
[2024-05-31 02:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:21:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 02:21:23] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2024-05-31 02:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:21:28] [INFO ] [Nat]Absence check using state equation in 4910 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 1, 4, 1, 6, 6780, 1, 1, 1, 1, 4, 1, 1695] Max seen :[4, 1, 4, 1, 6, 3, 1, 1, 1, 1, 4, 1, 1]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 268 place count 317 transition count 1483
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 276 place count 317 transition count 1475
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 284 place count 309 transition count 1475
Applied a total of 284 rules in 354 ms. Remains 309 /454 variables (removed 145) and now considering 1475/1614 (removed 139) transitions.
[2024-05-31 02:21:28] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
// Phase 1: matrix 1451 rows 309 cols
[2024-05-31 02:21:29] [INFO ] Computed 44 invariants in 44 ms
[2024-05-31 02:21:29] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 309/454 places, 863/1614 transitions.
Applied a total of 0 rules in 24 ms. Remains 309 /309 variables (removed 0) and now considering 863/863 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1294 ms. Remains : 309/454 places, 863/1614 transitions.
Normalized transition count is 839 out of 863 initially.
// Phase 1: matrix 839 rows 309 cols
[2024-05-31 02:21:29] [INFO ] Computed 44 invariants in 28 ms
Incomplete random walk after 1000000 steps, including 10789 resets, run finished after 4285 ms. (steps per millisecond=233 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 8806 resets, run finished after 1662 ms. (steps per millisecond=601 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 3497 resets, run finished after 1728 ms. (steps per millisecond=578 ) properties (out of 2) seen :4
[2024-05-31 02:21:37] [INFO ] Flow matrix only has 839 transitions (discarded 24 similar events)
// Phase 1: matrix 839 rows 309 cols
[2024-05-31 02:21:37] [INFO ] Computed 44 invariants in 14 ms
[2024-05-31 02:21:37] [INFO ] [Real]Absence check using 17 positive place invariants in 64 ms returned sat
[2024-05-31 02:21:37] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-31 02:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:21:38] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2024-05-31 02:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:21:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-31 02:21:38] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 25 ms returned sat
[2024-05-31 02:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:21:40] [INFO ] [Nat]Absence check using state equation in 1731 ms returned sat
[2024-05-31 02:21:40] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:21:40] [INFO ] [Nat]Added 112 Read/Feed constraints in 603 ms returned sat
[2024-05-31 02:21:40] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 4 ms to minimize.
[2024-05-31 02:21:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 328 ms
[2024-05-31 02:21:41] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2024-05-31 02:21:41] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 25 ms returned sat
[2024-05-31 02:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:21:42] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2024-05-31 02:21:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:21:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-31 02:21:42] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-31 02:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:21:43] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2024-05-31 02:21:44] [INFO ] [Nat]Added 112 Read/Feed constraints in 1067 ms returned sat
[2024-05-31 02:21:44] [INFO ] Deduced a trap composed of 80 places in 233 ms of which 1 ms to minimize.
[2024-05-31 02:21:44] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-31 02:21:45] [INFO ] Deduced a trap composed of 141 places in 293 ms of which 2 ms to minimize.
[2024-05-31 02:21:45] [INFO ] Deduced a trap composed of 151 places in 294 ms of which 1 ms to minimize.
[2024-05-31 02:21:46] [INFO ] Deduced a trap composed of 157 places in 271 ms of which 1 ms to minimize.
[2024-05-31 02:21:46] [INFO ] Deduced a trap composed of 166 places in 268 ms of which 0 ms to minimize.
[2024-05-31 02:21:46] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 2 ms to minimize.
[2024-05-31 02:21:47] [INFO ] Deduced a trap composed of 159 places in 279 ms of which 0 ms to minimize.
[2024-05-31 02:21:47] [INFO ] Deduced a trap composed of 151 places in 267 ms of which 1 ms to minimize.
[2024-05-31 02:21:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3453 ms
[2024-05-31 02:21:48] [INFO ] Computed and/alt/rep : 531/2551/526 causal constraints (skipped 307 transitions) in 116 ms.
[2024-05-31 02:21:50] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 0 ms to minimize.
[2024-05-31 02:21:51] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 0 ms to minimize.
[2024-05-31 02:21:51] [INFO ] Deduced a trap composed of 134 places in 271 ms of which 1 ms to minimize.
[2024-05-31 02:21:52] [INFO ] Deduced a trap composed of 136 places in 276 ms of which 1 ms to minimize.
[2024-05-31 02:21:52] [INFO ] Deduced a trap composed of 136 places in 256 ms of which 0 ms to minimize.
[2024-05-31 02:21:52] [INFO ] Deduced a trap composed of 128 places in 263 ms of which 1 ms to minimize.
[2024-05-31 02:21:53] [INFO ] Deduced a trap composed of 130 places in 257 ms of which 1 ms to minimize.
[2024-05-31 02:21:53] [INFO ] Deduced a trap composed of 144 places in 279 ms of which 1 ms to minimize.
[2024-05-31 02:21:54] [INFO ] Deduced a trap composed of 151 places in 238 ms of which 1 ms to minimize.
[2024-05-31 02:21:54] [INFO ] Deduced a trap composed of 150 places in 235 ms of which 1 ms to minimize.
[2024-05-31 02:21:54] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 1 ms to minimize.
[2024-05-31 02:21:55] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2024-05-31 02:21:55] [INFO ] Deduced a trap composed of 165 places in 280 ms of which 3 ms to minimize.
[2024-05-31 02:21:55] [INFO ] Deduced a trap composed of 152 places in 267 ms of which 1 ms to minimize.
[2024-05-31 02:21:56] [INFO ] Deduced a trap composed of 145 places in 267 ms of which 1 ms to minimize.
[2024-05-31 02:21:56] [INFO ] Deduced a trap composed of 133 places in 287 ms of which 0 ms to minimize.
[2024-05-31 02:21:56] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6310 ms
[2024-05-31 02:21:57] [INFO ] Added : 85 causal constraints over 18 iterations in 9386 ms. Result :sat
Minimization took 1398 ms.
Current structural bounds on expressions (after SMT) : [3, 105] Max seen :[3, 1]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 863/863 transitions.
Applied a total of 0 rules in 22 ms. Remains 309 /309 variables (removed 0) and now considering 863/863 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 309/309 places, 863/863 transitions.
Normalized transition count is 839 out of 863 initially.
// Phase 1: matrix 839 rows 309 cols
[2024-05-31 02:22:00] [INFO ] Computed 44 invariants in 31 ms
Incomplete random walk after 1000000 steps, including 10950 resets, run finished after 3953 ms. (steps per millisecond=252 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 3653 resets, run finished after 1601 ms. (steps per millisecond=624 ) properties (out of 1) seen :1
[2024-05-31 02:22:05] [INFO ] Flow matrix only has 839 transitions (discarded 24 similar events)
// Phase 1: matrix 839 rows 309 cols
[2024-05-31 02:22:05] [INFO ] Computed 44 invariants in 29 ms
[2024-05-31 02:22:05] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-31 02:22:05] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-31 02:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:22:06] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2024-05-31 02:22:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:22:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-31 02:22:06] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-31 02:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:22:07] [INFO ] [Nat]Absence check using state equation in 1056 ms returned sat
[2024-05-31 02:22:07] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:22:09] [INFO ] [Nat]Added 112 Read/Feed constraints in 1361 ms returned sat
[2024-05-31 02:22:09] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 1 ms to minimize.
[2024-05-31 02:22:09] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-31 02:22:10] [INFO ] Deduced a trap composed of 141 places in 256 ms of which 0 ms to minimize.
[2024-05-31 02:22:10] [INFO ] Deduced a trap composed of 151 places in 234 ms of which 0 ms to minimize.
[2024-05-31 02:22:10] [INFO ] Deduced a trap composed of 157 places in 215 ms of which 1 ms to minimize.
[2024-05-31 02:22:11] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 1 ms to minimize.
[2024-05-31 02:22:11] [INFO ] Deduced a trap composed of 156 places in 255 ms of which 0 ms to minimize.
[2024-05-31 02:22:11] [INFO ] Deduced a trap composed of 159 places in 257 ms of which 0 ms to minimize.
[2024-05-31 02:22:12] [INFO ] Deduced a trap composed of 151 places in 284 ms of which 0 ms to minimize.
[2024-05-31 02:22:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3235 ms
[2024-05-31 02:22:12] [INFO ] Computed and/alt/rep : 531/2551/526 causal constraints (skipped 307 transitions) in 70 ms.
[2024-05-31 02:22:14] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-31 02:22:14] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2024-05-31 02:22:15] [INFO ] Deduced a trap composed of 134 places in 251 ms of which 1 ms to minimize.
[2024-05-31 02:22:15] [INFO ] Deduced a trap composed of 136 places in 257 ms of which 0 ms to minimize.
[2024-05-31 02:22:16] [INFO ] Deduced a trap composed of 136 places in 259 ms of which 1 ms to minimize.
[2024-05-31 02:22:16] [INFO ] Deduced a trap composed of 128 places in 231 ms of which 1 ms to minimize.
[2024-05-31 02:22:16] [INFO ] Deduced a trap composed of 130 places in 217 ms of which 1 ms to minimize.
[2024-05-31 02:22:17] [INFO ] Deduced a trap composed of 144 places in 218 ms of which 1 ms to minimize.
[2024-05-31 02:22:17] [INFO ] Deduced a trap composed of 151 places in 239 ms of which 1 ms to minimize.
[2024-05-31 02:22:18] [INFO ] Deduced a trap composed of 150 places in 226 ms of which 1 ms to minimize.
[2024-05-31 02:22:18] [INFO ] Deduced a trap composed of 158 places in 250 ms of which 1 ms to minimize.
[2024-05-31 02:22:18] [INFO ] Deduced a trap composed of 164 places in 262 ms of which 1 ms to minimize.
[2024-05-31 02:22:19] [INFO ] Deduced a trap composed of 165 places in 241 ms of which 0 ms to minimize.
[2024-05-31 02:22:19] [INFO ] Deduced a trap composed of 152 places in 255 ms of which 1 ms to minimize.
[2024-05-31 02:22:19] [INFO ] Deduced a trap composed of 145 places in 230 ms of which 0 ms to minimize.
[2024-05-31 02:22:20] [INFO ] Deduced a trap composed of 133 places in 223 ms of which 1 ms to minimize.
[2024-05-31 02:22:20] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6162 ms
[2024-05-31 02:22:20] [INFO ] Added : 85 causal constraints over 18 iterations in 8387 ms. Result :sat
Minimization took 1490 ms.
Current structural bounds on expressions (after SMT) : [105] Max seen :[1]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 863/863 transitions.
Applied a total of 0 rules in 18 ms. Remains 309 /309 variables (removed 0) and now considering 863/863 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 309/309 places, 863/863 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 863/863 transitions.
Applied a total of 0 rules in 18 ms. Remains 309 /309 variables (removed 0) and now considering 863/863 (removed 0) transitions.
[2024-05-31 02:22:23] [INFO ] Flow matrix only has 839 transitions (discarded 24 similar events)
[2024-05-31 02:22:23] [INFO ] Invariant cache hit.
[2024-05-31 02:22:24] [INFO ] Implicit Places using invariants in 425 ms returned [29, 202, 241]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 428 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/309 places, 863/863 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 303 transition count 860
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 303 transition count 860
Applied a total of 6 rules in 24 ms. Remains 303 /306 variables (removed 3) and now considering 860/863 (removed 3) transitions.
[2024-05-31 02:22:24] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
// Phase 1: matrix 836 rows 303 cols
[2024-05-31 02:22:24] [INFO ] Computed 41 invariants in 13 ms
[2024-05-31 02:22:24] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-31 02:22:24] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
[2024-05-31 02:22:24] [INFO ] Invariant cache hit.
[2024-05-31 02:22:24] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:22:32] [INFO ] Implicit Places using invariants and state equation in 7711 ms returned []
Implicit Place search using SMT with State Equation took 8056 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 303/309 places, 860/863 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8528 ms. Remains : 303/309 places, 860/863 transitions.
Normalized transition count is 836 out of 860 initially.
// Phase 1: matrix 836 rows 303 cols
[2024-05-31 02:22:32] [INFO ] Computed 41 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 10859 resets, run finished after 4609 ms. (steps per millisecond=216 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 3541 resets, run finished after 1789 ms. (steps per millisecond=558 ) properties (out of 1) seen :1
[2024-05-31 02:22:38] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
// Phase 1: matrix 836 rows 303 cols
[2024-05-31 02:22:38] [INFO ] Computed 41 invariants in 34 ms
[2024-05-31 02:22:38] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-31 02:22:38] [INFO ] [Real]Absence check using 18 positive and 23 generalized place invariants in 16 ms returned sat
[2024-05-31 02:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:22:39] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2024-05-31 02:22:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:22:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-31 02:22:39] [INFO ] [Nat]Absence check using 18 positive and 23 generalized place invariants in 19 ms returned sat
[2024-05-31 02:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:22:40] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2024-05-31 02:22:40] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:22:42] [INFO ] [Nat]Added 112 Read/Feed constraints in 1622 ms returned sat
[2024-05-31 02:22:42] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2024-05-31 02:22:42] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-31 02:22:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 537 ms
[2024-05-31 02:22:42] [INFO ] Computed and/alt/rep : 528/2547/523 causal constraints (skipped 307 transitions) in 75 ms.
[2024-05-31 02:22:44] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2024-05-31 02:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 467 ms
[2024-05-31 02:22:45] [INFO ] Added : 28 causal constraints over 6 iterations in 2371 ms. Result :sat
Minimization took 782 ms.
Current structural bounds on expressions (after SMT) : [105] Max seen :[1]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 860/860 transitions.
Applied a total of 0 rules in 31 ms. Remains 303 /303 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 303/303 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 860/860 transitions.
Applied a total of 0 rules in 18 ms. Remains 303 /303 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2024-05-31 02:22:46] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
[2024-05-31 02:22:46] [INFO ] Invariant cache hit.
[2024-05-31 02:22:47] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-31 02:22:47] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
[2024-05-31 02:22:47] [INFO ] Invariant cache hit.
[2024-05-31 02:22:47] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:22:54] [INFO ] Implicit Places using invariants and state equation in 7215 ms returned []
Implicit Place search using SMT with State Equation took 7615 ms to find 0 implicit places.
[2024-05-31 02:22:54] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-31 02:22:54] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
[2024-05-31 02:22:54] [INFO ] Invariant cache hit.
[2024-05-31 02:22:54] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8251 ms. Remains : 303/303 places, 860/860 transitions.
Starting property specific reduction for PolyORBLF-PT-S06J04T04-UpperBounds-15
Normalized transition count is 836 out of 860 initially.
// Phase 1: matrix 836 rows 303 cols
[2024-05-31 02:22:54] [INFO ] Computed 41 invariants in 11 ms
Incomplete random walk after 10000 steps, including 100 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :1
[2024-05-31 02:22:54] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
// Phase 1: matrix 836 rows 303 cols
[2024-05-31 02:22:55] [INFO ] Computed 41 invariants in 27 ms
[2024-05-31 02:22:55] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-31 02:22:55] [INFO ] [Real]Absence check using 18 positive and 23 generalized place invariants in 11 ms returned sat
[2024-05-31 02:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:22:56] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2024-05-31 02:22:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:22:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-31 02:22:56] [INFO ] [Nat]Absence check using 18 positive and 23 generalized place invariants in 19 ms returned sat
[2024-05-31 02:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:22:56] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2024-05-31 02:22:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:22:58] [INFO ] [Nat]Added 112 Read/Feed constraints in 1359 ms returned sat
[2024-05-31 02:22:58] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-31 02:22:58] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2024-05-31 02:22:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2024-05-31 02:22:58] [INFO ] Computed and/alt/rep : 528/2547/523 causal constraints (skipped 307 transitions) in 72 ms.
[2024-05-31 02:23:00] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 4 ms to minimize.
[2024-05-31 02:23:01] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 397 ms
[2024-05-31 02:23:01] [INFO ] Deduced a trap composed of 2 places in 283 ms of which 0 ms to minimize.
[2024-05-31 02:23:01] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [-1] Max seen :[1]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 860/860 transitions.
Applied a total of 0 rules in 17 ms. Remains 303 /303 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2024-05-31 02:23:01] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
[2024-05-31 02:23:01] [INFO ] Invariant cache hit.
[2024-05-31 02:23:01] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 303/303 places, 860/860 transitions.
Normalized transition count is 836 out of 860 initially.
// Phase 1: matrix 836 rows 303 cols
[2024-05-31 02:23:01] [INFO ] Computed 41 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 11060 resets, run finished after 3975 ms. (steps per millisecond=251 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 3500 resets, run finished after 1661 ms. (steps per millisecond=602 ) properties (out of 1) seen :1
[2024-05-31 02:23:07] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
// Phase 1: matrix 836 rows 303 cols
[2024-05-31 02:23:07] [INFO ] Computed 41 invariants in 29 ms
[2024-05-31 02:23:07] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-31 02:23:07] [INFO ] [Real]Absence check using 18 positive and 23 generalized place invariants in 11 ms returned sat
[2024-05-31 02:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:23:08] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2024-05-31 02:23:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:23:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-31 02:23:08] [INFO ] [Nat]Absence check using 18 positive and 23 generalized place invariants in 20 ms returned sat
[2024-05-31 02:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:23:09] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2024-05-31 02:23:09] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:23:11] [INFO ] [Nat]Added 112 Read/Feed constraints in 1622 ms returned sat
[2024-05-31 02:23:11] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2024-05-31 02:23:11] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-31 02:23:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 437 ms
[2024-05-31 02:23:11] [INFO ] Computed and/alt/rep : 528/2547/523 causal constraints (skipped 307 transitions) in 68 ms.
[2024-05-31 02:23:13] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2024-05-31 02:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2024-05-31 02:23:13] [INFO ] Added : 28 causal constraints over 6 iterations in 2304 ms. Result :sat
Minimization took 683 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 860/860 transitions.
Applied a total of 0 rules in 16 ms. Remains 303 /303 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 303/303 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 860/860 transitions.
Applied a total of 0 rules in 16 ms. Remains 303 /303 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2024-05-31 02:23:15] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
[2024-05-31 02:23:15] [INFO ] Invariant cache hit.
[2024-05-31 02:23:15] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-31 02:23:15] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
[2024-05-31 02:23:15] [INFO ] Invariant cache hit.
[2024-05-31 02:23:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-31 02:23:24] [INFO ] Implicit Places using invariants and state equation in 9095 ms returned []
Implicit Place search using SMT with State Equation took 9521 ms to find 0 implicit places.
[2024-05-31 02:23:24] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-31 02:23:24] [INFO ] Flow matrix only has 836 transitions (discarded 24 similar events)
[2024-05-31 02:23:24] [INFO ] Invariant cache hit.
[2024-05-31 02:23:25] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10133 ms. Remains : 303/303 places, 860/860 transitions.
Ending property specific reduction for PolyORBLF-PT-S06J04T04-UpperBounds-15 in 30382 ms.
[2024-05-31 02:23:25] [INFO ] Flatten gal took : 132 ms
[2024-05-31 02:23:25] [INFO ] Applying decomposition
[2024-05-31 02:23:25] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16270585678503666717.txt' '-o' '/tmp/graph16270585678503666717.bin' '-w' '/tmp/graph16270585678503666717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16270585678503666717.bin' '-l' '-1' '-v' '-w' '/tmp/graph16270585678503666717.weights' '-q' '0' '-e' '0.001'
[2024-05-31 02:23:25] [INFO ] Decomposing Gal with order
[2024-05-31 02:23:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 02:23:26] [INFO ] Removed a total of 585 redundant transitions.
[2024-05-31 02:23:26] [INFO ] Flatten gal took : 229 ms
[2024-05-31 02:23:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 21 ms.
[2024-05-31 02:23:26] [INFO ] Time to serialize gal into /tmp/UpperBounds14275159464112978571.gal : 18 ms
[2024-05-31 02:23:26] [INFO ] Time to serialize properties into /tmp/UpperBounds5761735029221479889.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14275159464112978571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5761735029221479889.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds5761735029221479889.prop.
Detected timeout of ITS tools.
[2024-05-31 02:44:15] [INFO ] Flatten gal took : 672 ms
[2024-05-31 02:44:15] [INFO ] Time to serialize gal into /tmp/UpperBounds10265960249866092090.gal : 84 ms
[2024-05-31 02:44:15] [INFO ] Time to serialize properties into /tmp/UpperBounds10000719996739440570.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10265960249866092090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10000719996739440570.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds10000719996739440570.prop.
Detected timeout of ITS tools.
[2024-05-31 03:05:02] [INFO ] Flatten gal took : 556 ms
[2024-05-31 03:05:04] [INFO ] Input system was already deterministic with 860 transitions.
[2024-05-31 03:05:04] [INFO ] Transformed 303 places.
[2024-05-31 03:05:04] [INFO ] Transformed 860 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 03:05:34] [INFO ] Time to serialize gal into /tmp/UpperBounds12172061437174834290.gal : 59 ms
[2024-05-31 03:05:34] [INFO ] Time to serialize properties into /tmp/UpperBounds5129734285708655769.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12172061437174834290.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5129734285708655769.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5129734285708655769.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 153880 kB
After kill :
MemTotal: 16393356 kB
MemFree: 12229528 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBLF-PT-S06J04T04, 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 r307-tajo-171654460600196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 ;