fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for PolyORBLF-COL-S06J06T04

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10941.476 3600000.00 3648698.00 8241.40 3 1 ? 6 4 1 4 1 1 1 4 6 4 3 4 10 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r299-tall-167873953000469.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-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953000469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.3K Feb 26 13:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 14:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S06J06T04-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679493073926

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-S06J06T04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 13:51:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 13:51:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:51:15] [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:51:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 13:51:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 757 ms
[2023-03-22 13:51:16] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 13:51:16] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-22 13:51:16] [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:51:16] [INFO ] Computed 26 place invariants in 16 ms
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 13:51:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 13:51:16] [INFO ] Computed 26 place invariants in 9 ms
[2023-03-22 13:51:16] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:16] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-22 13:51:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 13:51:16] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 13:51:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:16] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2023-03-22 13:51:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-22 13:51:16] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 5 ms to minimize.
[2023-03-22 13:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-22 13:51:16] [INFO ] Added : 40 causal constraints over 9 iterations in 145 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 13:51:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 13:51:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 18 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:16] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 13:51:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:51:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 13:51:17] [INFO ] Added : 22 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:51:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 13:51:17] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2023-03-22 13:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-22 13:51:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-22 13:51:17] [INFO ] Added : 23 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 13:51:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:51:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:51:17] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:17] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-22 13:51:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 31 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:17] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 13:51:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2023-03-22 13:51:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-22 13:51:17] [INFO ] Added : 31 causal constraints over 7 iterations in 214 ms. Result :sat
Minimization took 36 ms.
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:51:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:51:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:51:18] [INFO ] Added : 61 causal constraints over 13 iterations in 116 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 13:51:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 20 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 13:51:18] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 58 ms.
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:51:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:51:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 13:51:18] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:51:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:51:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 13:51:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 13:51:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-22 13:51:18] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2023-03-22 13:51:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-22 13:51:19] [INFO ] Added : 59 causal constraints over 13 iterations in 199 ms. Result :sat
Minimization took 22 ms.
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:51:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-22 13:51:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:51:19] [INFO ] Added : 54 causal constraints over 11 iterations in 97 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 13:51:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 15 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:51:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 13:51:19] [INFO ] Added : 56 causal constraints over 12 iterations in 78 ms. Result :sat
Minimization took 91 ms.
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 13:51:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 33 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 13:51:19] [INFO ] Added : 37 causal constraints over 9 iterations in 63 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:19] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 13:51:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-22 13:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:19] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-22 13:51:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 13:51:20] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-22 13:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 13:51:20] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 13:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:20] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 13:51:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 13:51:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2023-03-22 13:51:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:20] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 13:51:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 13:51:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 13:51:20] [INFO ] Added : 61 causal constraints over 13 iterations in 116 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 4, 6, 40, 1, 36, 1, 4, 1, 4, 6, 3, 4]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2023-03-22 13:51:20] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 131 ms.
[2023-03-22 13:51:20] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :36
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :17
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :15
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :15
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :17
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :12
[2023-03-22 13:51:20] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2023-03-22 13:51:20] [INFO ] Computed 54 place invariants in 80 ms
[2023-03-22 13:51:20] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-22 13:51:20] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 18 ms returned sat
[2023-03-22 13:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:21] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-22 13:51:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-22 13:51:21] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 21 ms returned sat
[2023-03-22 13:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:22] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2023-03-22 13:51:22] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:51:23] [INFO ] [Nat]Added 112 Read/Feed constraints in 679 ms returned sat
[2023-03-22 13:51:23] [INFO ] Deduced a trap composed of 91 places in 290 ms of which 1 ms to minimize.
[2023-03-22 13:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 379 ms
[2023-03-22 13:51:23] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-22 13:51:23] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 18 ms returned sat
[2023-03-22 13:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:24] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2023-03-22 13:51:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-22 13:51:24] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 17 ms returned sat
[2023-03-22 13:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:25] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2023-03-22 13:51:26] [INFO ] [Nat]Added 112 Read/Feed constraints in 1442 ms returned sat
[2023-03-22 13:51:27] [INFO ] Deduced a trap composed of 94 places in 279 ms of which 1 ms to minimize.
[2023-03-22 13:51:27] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 1 ms to minimize.
[2023-03-22 13:51:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1180 ms
[2023-03-22 13:51:27] [INFO ] Computed and/alt/rep : 1378/4930/1373 causal constraints (skipped 371 transitions) in 147 ms.
[2023-03-22 13:51:29] [INFO ] Added : 55 causal constraints over 11 iterations in 1386 ms. Result :unknown
[2023-03-22 13:51:29] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-22 13:51:29] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned unsat
[2023-03-22 13:51:29] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-22 13:51:29] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 20 ms returned unsat
[2023-03-22 13:51:29] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-22 13:51:29] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned unsat
[2023-03-22 13:51:29] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-22 13:51:29] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 4, 4, 4, 1, 4] Max seen :[3, 2, 4, 4, 1, 4]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 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 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
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 286 place count 360 transition count 1634
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 294 place count 360 transition count 1626
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 302 place count 352 transition count 1626
Applied a total of 302 rules in 268 ms. Remains 352 /506 variables (removed 154) and now considering 1626/1774 (removed 148) transitions.
[2023-03-22 13:51:30] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
// Phase 1: matrix 1602 rows 352 cols
[2023-03-22 13:51:30] [INFO ] Computed 48 place invariants in 40 ms
[2023-03-22 13:51:30] [INFO ] Dead Transitions using invariants and state equation in 664 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 : 352/506 places, 1014/1774 transitions.
Applied a total of 0 rules in 36 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 352/506 places, 1014/1774 transitions.
Normalized transition count is 990 out of 1014 initially.
// Phase 1: matrix 990 rows 352 cols
[2023-03-22 13:51:30] [INFO ] Computed 48 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 9949 resets, run finished after 4213 ms. (steps per millisecond=237 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 387 resets, run finished after 1871 ms. (steps per millisecond=534 ) properties (out of 1) seen :2
[2023-03-22 13:51:36] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
// Phase 1: matrix 990 rows 352 cols
[2023-03-22 13:51:36] [INFO ] Computed 48 place invariants in 21 ms
[2023-03-22 13:51:37] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-22 13:51:37] [INFO ] [Real]Absence check using 18 positive and 30 generalized place invariants in 18 ms returned sat
[2023-03-22 13:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:37] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2023-03-22 13:51:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-22 13:51:37] [INFO ] [Nat]Absence check using 18 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-22 13:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:37] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-22 13:51:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:51:39] [INFO ] [Nat]Added 112 Read/Feed constraints in 1374 ms returned sat
[2023-03-22 13:51:39] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 0 ms to minimize.
[2023-03-22 13:51:42] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3214 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 21 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 352/352 places, 1014/1014 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
[2023-03-22 13:51:42] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
[2023-03-22 13:51:42] [INFO ] Invariant cache hit.
[2023-03-22 13:51:43] [INFO ] Implicit Places using invariants in 525 ms returned [306, 307, 308, 309]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 530 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/352 places, 1014/1014 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 344 transition count 1010
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 344 transition count 1010
Applied a total of 8 rules in 29 ms. Remains 344 /348 variables (removed 4) and now considering 1010/1014 (removed 4) transitions.
[2023-03-22 13:51:43] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 13:51:43] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-22 13:51:43] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-22 13:51:43] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 13:51:43] [INFO ] Invariant cache hit.
[2023-03-22 13:51:43] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:51:46] [INFO ] Implicit Places using invariants and state equation in 3499 ms returned []
Implicit Place search using SMT with State Equation took 3829 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 344/352 places, 1010/1014 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4410 ms. Remains : 344/352 places, 1010/1014 transitions.
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 13:51:46] [INFO ] Computed 44 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 9565 resets, run finished after 4297 ms. (steps per millisecond=232 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 280 resets, run finished after 1940 ms. (steps per millisecond=515 ) properties (out of 1) seen :2
[2023-03-22 13:51:53] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 13:51:53] [INFO ] Computed 44 place invariants in 32 ms
[2023-03-22 13:51:53] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-22 13:51:53] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-22 13:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:53] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-03-22 13:51:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:51:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-22 13:51:53] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-22 13:51:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:51:54] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2023-03-22 13:51:54] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:51:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 1138 ms returned sat
[2023-03-22 13:51:55] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 1 ms to minimize.
[2023-03-22 13:51:55] [INFO ] Deduced a trap composed of 176 places in 196 ms of which 1 ms to minimize.
[2023-03-22 13:51:58] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3533 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 22 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 15 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-22 13:51:58] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 13:51:58] [INFO ] Invariant cache hit.
[2023-03-22 13:51:59] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-22 13:51:59] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 13:51:59] [INFO ] Invariant cache hit.
[2023-03-22 13:51:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:52:02] [INFO ] Implicit Places using invariants and state equation in 3462 ms returned []
Implicit Place search using SMT with State Equation took 3785 ms to find 0 implicit places.
[2023-03-22 13:52:02] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-22 13:52:02] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 13:52:02] [INFO ] Invariant cache hit.
[2023-03-22 13:52:03] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4315 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting property specific reduction for PolyORBLF-COL-S06J06T04-UpperBounds-02
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 13:52:03] [INFO ] Computed 44 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 102 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :2
[2023-03-22 13:52:03] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 13:52:03] [INFO ] Computed 44 place invariants in 24 ms
[2023-03-22 13:52:03] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-22 13:52:03] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-22 13:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:52:03] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2023-03-22 13:52:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:52:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-22 13:52:03] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-22 13:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:52:04] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2023-03-22 13:52:04] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:52:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 1154 ms returned sat
[2023-03-22 13:52:05] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 0 ms to minimize.
[2023-03-22 13:52:05] [INFO ] Deduced a trap composed of 176 places in 189 ms of which 1 ms to minimize.
[2023-03-22 13:52:08] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3397 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 14 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-22 13:52:08] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 13:52:08] [INFO ] Invariant cache hit.
[2023-03-22 13:52:09] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 344/344 places, 1010/1010 transitions.
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 13:52:09] [INFO ] Computed 44 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 9705 resets, run finished after 3974 ms. (steps per millisecond=251 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 398 resets, run finished after 1819 ms. (steps per millisecond=549 ) properties (out of 1) seen :2
[2023-03-22 13:52:14] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 13:52:14] [INFO ] Computed 44 place invariants in 24 ms
[2023-03-22 13:52:15] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-22 13:52:15] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-22 13:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:52:15] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-22 13:52:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:52:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-22 13:52:15] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-22 13:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:52:15] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-22 13:52:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:52:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 1151 ms returned sat
[2023-03-22 13:52:17] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 0 ms to minimize.
[2023-03-22 13:52:17] [INFO ] Deduced a trap composed of 176 places in 200 ms of which 1 ms to minimize.
[2023-03-22 13:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3516 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 18 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 14 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-22 13:52:20] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 13:52:20] [INFO ] Invariant cache hit.
[2023-03-22 13:52:20] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-22 13:52:20] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 13:52:20] [INFO ] Invariant cache hit.
[2023-03-22 13:52:21] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:52:24] [INFO ] Implicit Places using invariants and state equation in 3389 ms returned []
Implicit Place search using SMT with State Equation took 3710 ms to find 0 implicit places.
[2023-03-22 13:52:24] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-22 13:52:24] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 13:52:24] [INFO ] Invariant cache hit.
[2023-03-22 13:52:24] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4194 ms. Remains : 344/344 places, 1010/1010 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J06T04-UpperBounds-02 in 21576 ms.
[2023-03-22 13:52:24] [INFO ] Flatten gal took : 133 ms
[2023-03-22 13:52:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 13:52:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 344 places, 1010 transitions and 5974 arcs took 7 ms.
Total runtime 69565 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBLF (COL), instance S06J06T04
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: 344 places, 1010 transitions, 5974 arcs.
Final Score: 40229.692
Took : 84 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5204708 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098880 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-S06J06T04"
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-S06J06T04, 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-167873953000469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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