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.r511-tall-167912735600060.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 gold2022
Input is Szymanski-PT-b08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r511-tall-167912735600060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b08-UpperBounds-00
FORMULA_NAME Szymanski-PT-b08-UpperBounds-01
FORMULA_NAME Szymanski-PT-b08-UpperBounds-02
FORMULA_NAME Szymanski-PT-b08-UpperBounds-03
FORMULA_NAME Szymanski-PT-b08-UpperBounds-04
FORMULA_NAME Szymanski-PT-b08-UpperBounds-05
FORMULA_NAME Szymanski-PT-b08-UpperBounds-06
FORMULA_NAME Szymanski-PT-b08-UpperBounds-07
FORMULA_NAME Szymanski-PT-b08-UpperBounds-08
FORMULA_NAME Szymanski-PT-b08-UpperBounds-09
FORMULA_NAME Szymanski-PT-b08-UpperBounds-10
FORMULA_NAME Szymanski-PT-b08-UpperBounds-11
FORMULA_NAME Szymanski-PT-b08-UpperBounds-12
FORMULA_NAME Szymanski-PT-b08-UpperBounds-13
FORMULA_NAME Szymanski-PT-b08-UpperBounds-14
FORMULA_NAME Szymanski-PT-b08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679319961431

Running Version 202205111006
[2023-03-20 13:46:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 13:46:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:46:02] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2023-03-20 13:46:02] [INFO ] Transformed 568 places.
[2023-03-20 13:46:02] [INFO ] Transformed 8320 transitions.
[2023-03-20 13:46:02] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 467 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2023-03-20 13:46:03] [INFO ] Computed 3 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :2
FORMULA Szymanski-PT-b08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
FORMULA Szymanski-PT-b08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :1
FORMULA Szymanski-PT-b08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
[2023-03-20 13:46:03] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-20 13:46:03] [INFO ] Computed 3 place invariants in 26 ms
[2023-03-20 13:46:03] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-20 13:46:03] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:04] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-20 13:46:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-20 13:46:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:04] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-20 13:46:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:46:07] [INFO ] [Nat]Added 147 Read/Feed constraints in 2544 ms returned sat
[2023-03-20 13:46:08] [INFO ] Deduced a trap composed of 47 places in 602 ms of which 8 ms to minimize.
[2023-03-20 13:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 791 ms
[2023-03-20 13:46:08] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 637 ms.
[2023-03-20 13:46:09] [INFO ] Added : 0 causal constraints over 0 iterations in 842 ms. Result :sat
Minimization took 220 ms.
[2023-03-20 13:46:09] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-20 13:46:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:09] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-20 13:46:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:46:09] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:10] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2023-03-20 13:46:10] [INFO ] [Nat]Added 147 Read/Feed constraints in 523 ms returned sat
[2023-03-20 13:46:11] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 391 ms.
[2023-03-20 13:46:11] [INFO ] Added : 0 causal constraints over 0 iterations in 566 ms. Result :sat
Minimization took 503 ms.
[2023-03-20 13:46:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 13:46:12] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:12] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-20 13:46:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-20 13:46:12] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:13] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-20 13:46:14] [INFO ] [Nat]Added 147 Read/Feed constraints in 872 ms returned sat
[2023-03-20 13:46:14] [INFO ] Deduced a trap composed of 79 places in 536 ms of which 2 ms to minimize.
[2023-03-20 13:46:15] [INFO ] Deduced a trap composed of 130 places in 577 ms of which 2 ms to minimize.
[2023-03-20 13:46:15] [INFO ] Deduced a trap composed of 130 places in 564 ms of which 3 ms to minimize.
[2023-03-20 13:46:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1930 ms
[2023-03-20 13:46:16] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 374 ms.
[2023-03-20 13:46:16] [INFO ] Added : 0 causal constraints over 0 iterations in 541 ms. Result :sat
Minimization took 1041 ms.
[2023-03-20 13:46:17] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-20 13:46:17] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:18] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2023-03-20 13:46:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-20 13:46:18] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:18] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2023-03-20 13:46:21] [INFO ] [Nat]Added 147 Read/Feed constraints in 2408 ms returned sat
[2023-03-20 13:46:21] [INFO ] Deduced a trap composed of 137 places in 509 ms of which 1 ms to minimize.
[2023-03-20 13:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 716 ms
[2023-03-20 13:46:22] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 405 ms.
[2023-03-20 13:46:22] [INFO ] Added : 0 causal constraints over 0 iterations in 585 ms. Result :sat
Minimization took 650 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA Szymanski-PT-b08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 486 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:23] [INFO ] Computed 3 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1157 ms. (steps per millisecond=864 ) properties (out of 3) seen :1
FORMULA Szymanski-PT-b08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 2) seen :0
[2023-03-20 13:46:26] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:27] [INFO ] Computed 3 place invariants in 21 ms
[2023-03-20 13:46:27] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-20 13:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:27] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2023-03-20 13:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:27] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-20 13:46:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:46:28] [INFO ] [Nat]Added 147 Read/Feed constraints in 979 ms returned sat
[2023-03-20 13:46:29] [INFO ] Deduced a trap composed of 129 places in 489 ms of which 1 ms to minimize.
[2023-03-20 13:46:30] [INFO ] Deduced a trap composed of 129 places in 468 ms of which 0 ms to minimize.
[2023-03-20 13:46:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1143 ms
[2023-03-20 13:46:30] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 335 ms.
[2023-03-20 13:46:30] [INFO ] Added : 0 causal constraints over 0 iterations in 492 ms. Result :sat
Minimization took 802 ms.
[2023-03-20 13:46:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:46:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:31] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-20 13:46:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:32] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2023-03-20 13:46:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 679 ms returned sat
[2023-03-20 13:46:33] [INFO ] Deduced a trap composed of 51 places in 471 ms of which 1 ms to minimize.
[2023-03-20 13:46:34] [INFO ] Deduced a trap composed of 50 places in 454 ms of which 0 ms to minimize.
[2023-03-20 13:46:34] [INFO ] Deduced a trap composed of 78 places in 472 ms of which 1 ms to minimize.
[2023-03-20 13:46:35] [INFO ] Deduced a trap composed of 135 places in 468 ms of which 1 ms to minimize.
[2023-03-20 13:46:35] [INFO ] Deduced a trap composed of 140 places in 462 ms of which 0 ms to minimize.
[2023-03-20 13:46:36] [INFO ] Deduced a trap composed of 138 places in 446 ms of which 0 ms to minimize.
[2023-03-20 13:46:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3176 ms
[2023-03-20 13:46:36] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 314 ms.
[2023-03-20 13:46:36] [INFO ] Added : 0 causal constraints over 0 iterations in 466 ms. Result :sat
Minimization took 746 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 248 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:37] [INFO ] Computed 3 place invariants in 24 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 2) seen :0
[2023-03-20 13:46:40] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:40] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-20 13:46:40] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:40] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2023-03-20 13:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:41] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-20 13:46:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:46:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 969 ms returned sat
[2023-03-20 13:46:42] [INFO ] Deduced a trap composed of 129 places in 464 ms of which 0 ms to minimize.
[2023-03-20 13:46:43] [INFO ] Deduced a trap composed of 129 places in 464 ms of which 1 ms to minimize.
[2023-03-20 13:46:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1120 ms
[2023-03-20 13:46:43] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 343 ms.
[2023-03-20 13:46:43] [INFO ] Added : 0 causal constraints over 0 iterations in 514 ms. Result :sat
Minimization took 802 ms.
[2023-03-20 13:46:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:45] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-20 13:46:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:45] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2023-03-20 13:46:46] [INFO ] [Nat]Added 147 Read/Feed constraints in 678 ms returned sat
[2023-03-20 13:46:46] [INFO ] Deduced a trap composed of 51 places in 461 ms of which 0 ms to minimize.
[2023-03-20 13:46:47] [INFO ] Deduced a trap composed of 50 places in 459 ms of which 3 ms to minimize.
[2023-03-20 13:46:47] [INFO ] Deduced a trap composed of 78 places in 452 ms of which 0 ms to minimize.
[2023-03-20 13:46:48] [INFO ] Deduced a trap composed of 135 places in 460 ms of which 0 ms to minimize.
[2023-03-20 13:46:48] [INFO ] Deduced a trap composed of 140 places in 471 ms of which 1 ms to minimize.
[2023-03-20 13:46:49] [INFO ] Deduced a trap composed of 138 places in 470 ms of which 0 ms to minimize.
[2023-03-20 13:46:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3163 ms
[2023-03-20 13:46:49] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 364 ms.
[2023-03-20 13:46:49] [INFO ] Added : 0 causal constraints over 0 iterations in 521 ms. Result :sat
Minimization took 761 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-20 13:46:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:51] [INFO ] Computed 3 place invariants in 17 ms
[2023-03-20 13:46:51] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-20 13:46:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:51] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-20 13:46:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:46:54] [INFO ] Implicit Places using invariants and state equation in 2798 ms returned []
Implicit Place search using SMT with State Equation took 3326 ms to find 0 implicit places.
[2023-03-20 13:46:55] [INFO ] Redundant transitions in 941 ms returned []
[2023-03-20 13:46:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:55] [INFO ] Computed 3 place invariants in 23 ms
[2023-03-20 13:46:57] [INFO ] Dead Transitions using invariants and state equation in 2103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b08-UpperBounds-00
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:57] [INFO ] Computed 3 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-20 13:46:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:46:57] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-20 13:46:57] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:58] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-20 13:46:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:46:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:46:58] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-20 13:46:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:46:59] [INFO ] [Nat]Added 147 Read/Feed constraints in 1025 ms returned sat
[2023-03-20 13:47:00] [INFO ] Deduced a trap composed of 129 places in 482 ms of which 1 ms to minimize.
[2023-03-20 13:47:00] [INFO ] Deduced a trap composed of 129 places in 491 ms of which 1 ms to minimize.
[2023-03-20 13:47:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1152 ms
[2023-03-20 13:47:01] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 350 ms.
[2023-03-20 13:47:01] [INFO ] Added : 0 causal constraints over 0 iterations in 522 ms. Result :sat
Minimization took 837 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 314 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:02] [INFO ] Computed 3 place invariants in 12 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 1) seen :0
[2023-03-20 13:47:04] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:04] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-20 13:47:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:47:04] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-20 13:47:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:47:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:47:05] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-20 13:47:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:47:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 1037 ms returned sat
[2023-03-20 13:47:06] [INFO ] Deduced a trap composed of 129 places in 479 ms of which 0 ms to minimize.
[2023-03-20 13:47:07] [INFO ] Deduced a trap composed of 129 places in 470 ms of which 0 ms to minimize.
[2023-03-20 13:47:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1132 ms
[2023-03-20 13:47:07] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 331 ms.
[2023-03-20 13:47:08] [INFO ] Added : 0 causal constraints over 0 iterations in 496 ms. Result :sat
Minimization took 850 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 194 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 208 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-20 13:47:09] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:09] [INFO ] Computed 3 place invariants in 11 ms
[2023-03-20 13:47:09] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-20 13:47:09] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:09] [INFO ] Computed 3 place invariants in 15 ms
[2023-03-20 13:47:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:47:12] [INFO ] Implicit Places using invariants and state equation in 2215 ms returned []
Implicit Place search using SMT with State Equation took 2722 ms to find 0 implicit places.
[2023-03-20 13:47:12] [INFO ] Redundant transitions in 671 ms returned []
[2023-03-20 13:47:12] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:12] [INFO ] Computed 3 place invariants in 23 ms
[2023-03-20 13:47:14] [INFO ] Dead Transitions using invariants and state equation in 2091 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b08-UpperBounds-00 in 17211 ms.
Starting property specific reduction for Szymanski-PT-b08-UpperBounds-12
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:14] [INFO ] Computed 3 place invariants in 18 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-20 13:47:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:15] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-20 13:47:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:47:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:47:15] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2023-03-20 13:47:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:47:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:47:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:47:15] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2023-03-20 13:47:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:47:16] [INFO ] [Nat]Added 147 Read/Feed constraints in 734 ms returned sat
[2023-03-20 13:47:17] [INFO ] Deduced a trap composed of 51 places in 466 ms of which 0 ms to minimize.
[2023-03-20 13:47:17] [INFO ] Deduced a trap composed of 50 places in 471 ms of which 0 ms to minimize.
[2023-03-20 13:47:18] [INFO ] Deduced a trap composed of 78 places in 464 ms of which 0 ms to minimize.
[2023-03-20 13:47:18] [INFO ] Deduced a trap composed of 135 places in 475 ms of which 1 ms to minimize.
[2023-03-20 13:47:19] [INFO ] Deduced a trap composed of 140 places in 477 ms of which 0 ms to minimize.
[2023-03-20 13:47:19] [INFO ] Deduced a trap composed of 138 places in 464 ms of which 1 ms to minimize.
[2023-03-20 13:47:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3214 ms
[2023-03-20 13:47:20] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 335 ms.
[2023-03-20 13:47:20] [INFO ] Added : 0 causal constraints over 0 iterations in 493 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:20] [INFO ] Computed 3 place invariants in 16 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 1) seen :0
[2023-03-20 13:47:22] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:22] [INFO ] Computed 3 place invariants in 17 ms
[2023-03-20 13:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:47:22] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-20 13:47:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 13:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:47:23] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-20 13:47:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:47:24] [INFO ] [Nat]Added 147 Read/Feed constraints in 716 ms returned sat
[2023-03-20 13:47:24] [INFO ] Deduced a trap composed of 51 places in 471 ms of which 0 ms to minimize.
[2023-03-20 13:47:25] [INFO ] Deduced a trap composed of 50 places in 456 ms of which 0 ms to minimize.
[2023-03-20 13:47:25] [INFO ] Deduced a trap composed of 78 places in 471 ms of which 1 ms to minimize.
[2023-03-20 13:47:26] [INFO ] Deduced a trap composed of 135 places in 458 ms of which 4 ms to minimize.
[2023-03-20 13:47:26] [INFO ] Deduced a trap composed of 140 places in 458 ms of which 0 ms to minimize.
[2023-03-20 13:47:27] [INFO ] Deduced a trap composed of 138 places in 452 ms of which 1 ms to minimize.
[2023-03-20 13:47:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3157 ms
[2023-03-20 13:47:27] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 337 ms.
[2023-03-20 13:47:27] [INFO ] Added : 0 causal constraints over 0 iterations in 488 ms. Result :sat
Minimization took 768 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-20 13:47:28] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:28] [INFO ] Computed 3 place invariants in 16 ms
[2023-03-20 13:47:29] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-20 13:47:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:29] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-20 13:47:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 13:47:32] [INFO ] Implicit Places using invariants and state equation in 3028 ms returned []
Implicit Place search using SMT with State Equation took 3532 ms to find 0 implicit places.
[2023-03-20 13:47:33] [INFO ] Redundant transitions in 864 ms returned []
[2023-03-20 13:47:33] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 13:47:33] [INFO ] Computed 3 place invariants in 18 ms
[2023-03-20 13:47:35] [INFO ] Dead Transitions using invariants and state equation in 2117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b08-UpperBounds-12 in 20553 ms.
[2023-03-20 13:47:36] [INFO ] Flatten gal took : 463 ms
[2023-03-20 13:47:36] [INFO ] Applying decomposition
[2023-03-20 13:47:36] [INFO ] Flatten gal took : 254 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8805504265413345811.txt' '-o' '/tmp/graph8805504265413345811.bin' '-w' '/tmp/graph8805504265413345811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8805504265413345811.bin' '-l' '-1' '-v' '-w' '/tmp/graph8805504265413345811.weights' '-q' '0' '-e' '0.001'
[2023-03-20 13:47:37] [INFO ] Decomposing Gal with order
[2023-03-20 13:47:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 13:47:37] [INFO ] Removed a total of 18109 redundant transitions.
[2023-03-20 13:47:38] [INFO ] Flatten gal took : 731 ms
[2023-03-20 13:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1088 labels/synchronizations in 241 ms.
[2023-03-20 13:47:38] [INFO ] Time to serialize gal into /tmp/UpperBounds13759286865573778958.gal : 52 ms
[2023-03-20 13:47:38] [INFO ] Time to serialize properties into /tmp/UpperBounds7697960500049062829.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13759286865573778958.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7697960500049062829.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds7697960500049062829.prop.
Detected timeout of ITS tools.
[2023-03-20 14:08:27] [INFO ] Flatten gal took : 1054 ms
[2023-03-20 14:08:27] [INFO ] Time to serialize gal into /tmp/UpperBounds3367582370677114553.gal : 130 ms
[2023-03-20 14:08:27] [INFO ] Time to serialize properties into /tmp/UpperBounds18305860827847628384.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3367582370677114553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18305860827847628384.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds18305860827847628384.prop.
Detected timeout of ITS tools.
[2023-03-20 14:29:10] [INFO ] Flatten gal took : 685 ms
[2023-03-20 14:29:11] [INFO ] Input system was already deterministic with 7808 transitions.
[2023-03-20 14:29:11] [INFO ] Transformed 305 places.
[2023-03-20 14:29:12] [INFO ] Transformed 7808 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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
[2023-03-20 14:29:12] [INFO ] Time to serialize gal into /tmp/UpperBounds1027850574281446790.gal : 110 ms
[2023-03-20 14:29:12] [INFO ] Time to serialize properties into /tmp/UpperBounds5445794828050587146.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1027850574281446790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5445794828050587146.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5445794828050587146.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Szymanski-PT-b08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is Szymanski-PT-b08, 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 r511-tall-167912735600060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b08.tgz
mv Szymanski-PT-b08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;