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.r299-tall-167873953000445.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is PolyORBLF-COL-S06J04T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953000445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 13:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T04-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679490104914

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 13:01:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 13:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:01:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 13:01:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 13:01:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 692 ms
[2023-03-22 13:01:47] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 13:01:47] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-22 13:01:47] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 13:01:47] [INFO ] Computed 26 place invariants in 16 ms
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 13:01:47] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 13:01:47] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-22 13:01:47] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:47] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-22 13:01:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:47] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 13:01:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:01:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:01:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:01:47] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2023-03-22 13:01:47] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:47] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 13:01:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 13:01:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 13:01:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 13:01:47] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 3 ms to minimize.
[2023-03-22 13:01:47] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-22 13:01:47] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2023-03-22 13:01:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2023-03-22 13:01:48] [INFO ] Added : 57 causal constraints over 12 iterations in 296 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 13:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 21 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:01:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:01:48] [INFO ] Added : 12 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 13:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 28 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:01:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 13:01:48] [INFO ] Added : 27 causal constraints over 6 iterations in 47 ms. Result :sat
Minimization took 97 ms.
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 13:01:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:01:48] [INFO ] Added : 60 causal constraints over 12 iterations in 106 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 13:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:48] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:01:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-22 13:01:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:01:49] [INFO ] Added : 28 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 13:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 13:01:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 13:01:49] [INFO ] Added : 10 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:01:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 13:01:49] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 13:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-22 13:01:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:01:49] [INFO ] Added : 60 causal constraints over 12 iterations in 111 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 13:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 13:01:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 13:01:49] [INFO ] Added : 5 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 13:01:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 13:01:50] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
[2023-03-22 13:01:50] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2023-03-22 13:01:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2023-03-22 13:01:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2023-03-22 13:01:50] [INFO ] Added : 59 causal constraints over 14 iterations in 274 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 13:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 13:01:50] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2023-03-22 13:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-22 13:01:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 13:01:50] [INFO ] Added : 23 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 36 ms.
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 19 ms returned sat
[2023-03-22 13:01:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 13:01:50] [INFO ] Added : 10 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:50] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:01:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2023-03-22 13:01:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 13:01:51] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2023-03-22 13:01:51] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2023-03-22 13:01:51] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2023-03-22 13:01:51] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2023-03-22 13:01:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 174 ms
[2023-03-22 13:01:51] [INFO ] Added : 57 causal constraints over 12 iterations in 267 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [1, 4, 33, 5, 4, 4, 33, 1, 1, 87, 4, 4, 5, 4]
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2023-03-22 13:01:51] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 131 ms.
[2023-03-22 13:01:51] [INFO ] Unfolded 14 HLPN properties in 2 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :29
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :26
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :23
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :25
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :24
[2023-03-22 13:01:51] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2023-03-22 13:01:51] [INFO ] Computed 50 place invariants in 68 ms
[2023-03-22 13:01:51] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-22 13:01:51] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-22 13:01:51] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned unsat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2023-03-22 13:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:52] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2023-03-22 13:01:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-22 13:01:53] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2023-03-22 13:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:53] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-22 13:01:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:01:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 1883 ms returned sat
[2023-03-22 13:01:55] [INFO ] Deduced a trap composed of 190 places in 301 ms of which 1 ms to minimize.
[2023-03-22 13:01:57] [INFO ] Deduced a trap composed of 85 places in 314 ms of which 0 ms to minimize.
[2023-03-22 13:01:57] [INFO ] Deduced a trap composed of 85 places in 300 ms of which 0 ms to minimize.
[2023-03-22 13:01:57] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2655 ms
[2023-03-22 13:01:58] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:58] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2023-03-22 13:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:01:58] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-22 13:01:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:01:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:58] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 21 ms returned unsat
[2023-03-22 13:01:58] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-22 13:01:58] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 4, 1, 1, 4, 5, 1, 4, 2, 1] Max seen :[1, 4, 4, 1, 1, 4, 5, 1, 2, 2, 1]
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 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 1 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 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 270 place count 316 transition count 1482
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 278 place count 316 transition count 1474
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 286 place count 308 transition count 1474
Applied a total of 286 rules in 234 ms. Remains 308 /454 variables (removed 146) and now considering 1474/1614 (removed 140) transitions.
[2023-03-22 13:01:59] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 308 cols
[2023-03-22 13:01:59] [INFO ] Computed 44 place invariants in 45 ms
[2023-03-22 13:01:59] [INFO ] Dead Transitions using invariants and state equation in 626 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 : 308/454 places, 862/1614 transitions.
Applied a total of 0 rules in 20 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 884 ms. Remains : 308/454 places, 862/1614 transitions.
Normalized transition count is 838 out of 862 initially.
// Phase 1: matrix 838 rows 308 cols
[2023-03-22 13:01:59] [INFO ] Computed 44 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 10747 resets, run finished after 3616 ms. (steps per millisecond=276 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 516 resets, run finished after 1726 ms. (steps per millisecond=579 ) properties (out of 1) seen :2
[2023-03-22 13:02:05] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 308 cols
[2023-03-22 13:02:05] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-22 13:02:05] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:02:05] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-22 13:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:02:05] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-22 13:02:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:02:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 13:02:05] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-22 13:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:02:05] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2023-03-22 13:02:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:02:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 749 ms returned sat
[2023-03-22 13:02:06] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 0 ms to minimize.
[2023-03-22 13:02:07] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 1 ms to minimize.
[2023-03-22 13:02:07] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2023-03-22 13:02:07] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 0 ms to minimize.
[2023-03-22 13:02:07] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 0 ms to minimize.
[2023-03-22 13:02:08] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 0 ms to minimize.
[2023-03-22 13:02:08] [INFO ] Deduced a trap composed of 126 places in 185 ms of which 0 ms to minimize.
[2023-03-22 13:02:08] [INFO ] Deduced a trap composed of 153 places in 194 ms of which 1 ms to minimize.
[2023-03-22 13:02:08] [INFO ] Deduced a trap composed of 152 places in 197 ms of which 0 ms to minimize.
[2023-03-22 13:02:09] [INFO ] Deduced a trap composed of 140 places in 184 ms of which 1 ms to minimize.
[2023-03-22 13:02:09] [INFO ] Deduced a trap composed of 132 places in 185 ms of which 1 ms to minimize.
[2023-03-22 13:02:09] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 0 ms to minimize.
[2023-03-22 13:02:10] [INFO ] Deduced a trap composed of 152 places in 194 ms of which 0 ms to minimize.
[2023-03-22 13:02:10] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 0 ms to minimize.
[2023-03-22 13:02:10] [INFO ] Deduced a trap composed of 140 places in 183 ms of which 1 ms to minimize.
[2023-03-22 13:02:11] [INFO ] Deduced a trap composed of 134 places in 185 ms of which 0 ms to minimize.
[2023-03-22 13:02:11] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 0 ms to minimize.
[2023-03-22 13:02:12] [INFO ] Deduced a trap composed of 144 places in 161 ms of which 4 ms to minimize.
[2023-03-22 13:02:15] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 9150 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 24 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 862/862 transitions.
Applied a total of 0 rules in 19 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 308/308 places, 862/862 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 862/862 transitions.
Applied a total of 0 rules in 20 ms. Remains 308 /308 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2023-03-22 13:02:15] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
[2023-03-22 13:02:15] [INFO ] Invariant cache hit.
[2023-03-22 13:02:16] [INFO ] Implicit Places using invariants in 277 ms returned [262, 263, 264, 265]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 283 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 304/308 places, 862/862 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 300 transition count 858
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 300 transition count 858
Applied a total of 8 rules in 28 ms. Remains 300 /304 variables (removed 4) and now considering 858/862 (removed 4) transitions.
[2023-03-22 13:02:16] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 13:02:16] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-22 13:02:16] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-22 13:02:16] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 13:02:16] [INFO ] Invariant cache hit.
[2023-03-22 13:02:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:02:19] [INFO ] Implicit Places using invariants and state equation in 3399 ms returned []
Implicit Place search using SMT with State Equation took 3764 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/308 places, 858/862 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4096 ms. Remains : 300/308 places, 858/862 transitions.
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 13:02:20] [INFO ] Computed 40 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 11049 resets, run finished after 3585 ms. (steps per millisecond=278 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 574 resets, run finished after 1754 ms. (steps per millisecond=570 ) properties (out of 1) seen :2
[2023-03-22 13:02:25] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 13:02:25] [INFO ] Computed 40 place invariants in 19 ms
[2023-03-22 13:02:25] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:02:25] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-22 13:02:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:02:25] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-03-22 13:02:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:02:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:02:25] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 16 ms returned sat
[2023-03-22 13:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:02:26] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2023-03-22 13:02:26] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:02:26] [INFO ] [Nat]Added 112 Read/Feed constraints in 519 ms returned sat
[2023-03-22 13:02:26] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 0 ms to minimize.
[2023-03-22 13:02:27] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 1 ms to minimize.
[2023-03-22 13:02:27] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 4 ms to minimize.
[2023-03-22 13:02:27] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 1 ms to minimize.
[2023-03-22 13:02:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1037 ms
[2023-03-22 13:02:27] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 67 ms.
[2023-03-22 13:02:28] [INFO ] Added : 69 causal constraints over 14 iterations in 1135 ms. Result :sat
Minimization took 1060 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 300/300 places, 858/858 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 15 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-22 13:02:30] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 13:02:30] [INFO ] Invariant cache hit.
[2023-03-22 13:02:30] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-22 13:02:30] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 13:02:30] [INFO ] Invariant cache hit.
[2023-03-22 13:02:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:02:34] [INFO ] Implicit Places using invariants and state equation in 3656 ms returned []
Implicit Place search using SMT with State Equation took 3913 ms to find 0 implicit places.
[2023-03-22 13:02:34] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-22 13:02:34] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 13:02:34] [INFO ] Invariant cache hit.
[2023-03-22 13:02:34] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4370 ms. Remains : 300/300 places, 858/858 transitions.
Starting property specific reduction for PolyORBLF-COL-S06J04T04-UpperBounds-13
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 13:02:34] [INFO ] Computed 40 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 122 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :2
[2023-03-22 13:02:34] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 13:02:34] [INFO ] Computed 40 place invariants in 14 ms
[2023-03-22 13:02:34] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 13:02:34] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-22 13:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:02:35] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-22 13:02:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:02:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 13:02:35] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 12 ms returned sat
[2023-03-22 13:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:02:35] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-22 13:02:35] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:02:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 543 ms returned sat
[2023-03-22 13:02:36] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 0 ms to minimize.
[2023-03-22 13:02:36] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 0 ms to minimize.
[2023-03-22 13:02:36] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 0 ms to minimize.
[2023-03-22 13:02:37] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2023-03-22 13:02:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1010 ms
[2023-03-22 13:02:37] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 55 ms.
[2023-03-22 13:02:38] [INFO ] Added : 69 causal constraints over 14 iterations in 1129 ms. Result :sat
Minimization took 1071 ms.
Current structural bounds on expressions (after SMT) : [24] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 15 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-22 13:02:40] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 13:02:40] [INFO ] Invariant cache hit.
[2023-03-22 13:02:40] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 300/300 places, 858/858 transitions.
Normalized transition count is 834 out of 858 initially.
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 13:02:40] [INFO ] Computed 40 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 10788 resets, run finished after 3529 ms. (steps per millisecond=283 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 435 resets, run finished after 1746 ms. (steps per millisecond=572 ) properties (out of 1) seen :2
[2023-03-22 13:02:45] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
// Phase 1: matrix 834 rows 300 cols
[2023-03-22 13:02:45] [INFO ] Computed 40 place invariants in 16 ms
[2023-03-22 13:02:45] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-22 13:02:45] [INFO ] [Real]Absence check using 17 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-22 13:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:02:45] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-03-22 13:02:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:02:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 13:02:46] [INFO ] [Nat]Absence check using 17 positive and 23 generalized place invariants in 11 ms returned sat
[2023-03-22 13:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:02:46] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2023-03-22 13:02:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:02:46] [INFO ] [Nat]Added 112 Read/Feed constraints in 532 ms returned sat
[2023-03-22 13:02:47] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 0 ms to minimize.
[2023-03-22 13:02:47] [INFO ] Deduced a trap composed of 82 places in 172 ms of which 1 ms to minimize.
[2023-03-22 13:02:47] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 1 ms to minimize.
[2023-03-22 13:02:47] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 0 ms to minimize.
[2023-03-22 13:02:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 990 ms
[2023-03-22 13:02:47] [INFO ] Computed and/alt/rep : 526/2545/521 causal constraints (skipped 307 transitions) in 63 ms.
[2023-03-22 13:02:49] [INFO ] Added : 69 causal constraints over 14 iterations in 1239 ms. Result :sat
Minimization took 1072 ms.
Current structural bounds on expressions (after SMT) : [24] Max seen :[2]
Support contains 24 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 15 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 300/300 places, 858/858 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 858/858 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-22 13:02:50] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 13:02:50] [INFO ] Invariant cache hit.
[2023-03-22 13:02:51] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-22 13:02:51] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 13:02:51] [INFO ] Invariant cache hit.
[2023-03-22 13:02:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:02:55] [INFO ] Implicit Places using invariants and state equation in 3884 ms returned []
Implicit Place search using SMT with State Equation took 4181 ms to find 0 implicit places.
[2023-03-22 13:02:55] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 13:02:55] [INFO ] Flow matrix only has 834 transitions (discarded 24 similar events)
[2023-03-22 13:02:55] [INFO ] Invariant cache hit.
[2023-03-22 13:02:55] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4597 ms. Remains : 300/300 places, 858/858 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J04T04-UpperBounds-13 in 20651 ms.
[2023-03-22 13:02:55] [INFO ] Flatten gal took : 121 ms
[2023-03-22 13:02:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 13:02:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 858 transitions and 5294 arcs took 7 ms.
Total runtime 69320 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBLF (COL), instance S06J04T04
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 300 places, 858 transitions, 5294 arcs.
Final Score: 27511.469
Took : 76 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9601548 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101344 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J04T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBLF-COL-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 r299-tall-167873953000445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-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 '' 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 ;