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-167873953300669.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 PolyORBNT-COL-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953300669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679528989958

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=PolyORBNT-COL-S05J80
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 23:49:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 23:49:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:49:51] [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 23:49:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 23:49:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 643 ms
[2023-03-22 23:49:52] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 23:49:52] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-22 23:49:52] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-22 23:49:52] [INFO ] Computed 13 place invariants in 10 ms
FORMULA PolyORBNT-COL-S05J80-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 23:49:52] [INFO ] Invariant cache hit.
[2023-03-22 23:49:52] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 23:49:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:52] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-22 23:49:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:49:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 23:49:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2023-03-22 23:49:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-22 23:49:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 23:49:52] [INFO ] Added : 18 causal constraints over 4 iterations in 275 ms. Result :sat
Minimization took 123 ms.
[2023-03-22 23:49:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 23:49:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 23:49:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 23:49:52] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-22 23:49:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 23:49:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 23:49:53] [INFO ] Added : 22 causal constraints over 5 iterations in 172 ms. Result :sat
Minimization took 33 ms.
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 23:49:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:53] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-22 23:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-22 23:49:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 23:49:53] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
[2023-03-22 23:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-22 23:49:53] [INFO ] Added : 33 causal constraints over 7 iterations in 164 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:49:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 23:49:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2023-03-22 23:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-22 23:49:53] [INFO ] Added : 22 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:49:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:49:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-22 23:49:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-22 23:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-22 23:49:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 23:49:54] [INFO ] Added : 20 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:49:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2023-03-22 23:49:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-22 23:49:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 23:49:54] [INFO ] Added : 21 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 174 ms.
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 23:49:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-22 23:49:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-22 23:49:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 23:49:54] [INFO ] Added : 36 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:49:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 23:49:54] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:49:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:54] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-22 23:49:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:54] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-22 23:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-22 23:49:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 23:49:55] [INFO ] Added : 20 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 23:49:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-22 23:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-22 23:49:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 23:49:55] [INFO ] Added : 18 causal constraints over 4 iterations in 265 ms. Result :sat
Minimization took 52 ms.
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 23:49:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-22 23:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 23:49:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 23:49:55] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-03-22 23:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-22 23:49:55] [INFO ] Added : 36 causal constraints over 8 iterations in 157 ms. Result :sat
Minimization took 12 ms.
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 23:49:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:55] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-22 23:49:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 23:49:55] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-22 23:49:55] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2023-03-22 23:49:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2023-03-22 23:49:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 23:49:56] [INFO ] Added : 36 causal constraints over 8 iterations in 38 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [10, 4, 1, 3, 2, 10, -1, -1, 2, 10, 3, -1, -1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 23:49:56] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 60 ms.
[2023-03-22 23:49:56] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 12 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 12) seen :22
FORMULA PolyORBNT-COL-S05J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :15
FORMULA PolyORBNT-COL-S05J80-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :19
FORMULA PolyORBNT-COL-S05J80-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :18
[2023-03-22 23:49:56] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-22 23:49:56] [INFO ] Computed 182 place invariants in 110 ms
[2023-03-22 23:49:56] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-22 23:49:56] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 19 ms returned unsat
[2023-03-22 23:49:56] [INFO ] [Real]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-22 23:49:56] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 23:49:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:57] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2023-03-22 23:49:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:49:57] [INFO ] [Nat]Absence check using 175 positive place invariants in 50 ms returned sat
[2023-03-22 23:49:57] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 23:49:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:49:58] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2023-03-22 23:49:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:49:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1066 ms returned sat
[2023-03-22 23:49:59] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 148 ms.
[2023-03-22 23:50:01] [INFO ] Deduced a trap composed of 664 places in 490 ms of which 1 ms to minimize.
[2023-03-22 23:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 790 ms
[2023-03-22 23:50:01] [INFO ] Added : 19 causal constraints over 4 iterations in 1618 ms. Result :sat
Minimization took 690 ms.
[2023-03-22 23:50:02] [INFO ] [Real]Absence check using 175 positive place invariants in 55 ms returned sat
[2023-03-22 23:50:02] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-22 23:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:50:02] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2023-03-22 23:50:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:50:03] [INFO ] [Nat]Absence check using 175 positive place invariants in 50 ms returned sat
[2023-03-22 23:50:03] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-22 23:50:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:50:03] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2023-03-22 23:50:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2023-03-22 23:50:04] [INFO ] Deduced a trap composed of 403 places in 463 ms of which 2 ms to minimize.
[2023-03-22 23:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 688 ms
[2023-03-22 23:50:04] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 109 ms.
[2023-03-22 23:50:05] [INFO ] Added : 17 causal constraints over 4 iterations in 733 ms. Result :sat
Minimization took 543 ms.
[2023-03-22 23:50:05] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-22 23:50:05] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned unsat
[2023-03-22 23:50:06] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-22 23:50:06] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 25 ms returned unsat
[2023-03-22 23:50:06] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-22 23:50:06] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 15 ms returned unsat
[2023-03-22 23:50:06] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-22 23:50:06] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned unsat
[2023-03-22 23:50:06] [INFO ] [Real]Absence check using 175 positive place invariants in 53 ms returned sat
[2023-03-22 23:50:06] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 10, 1, 1, 4, 1, 1] Max seen :[4, 3, 3, 1, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 351 place count 1011 transition count 1522
Applied a total of 351 rules in 353 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2023-03-22 23:50:07] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2023-03-22 23:50:07] [INFO ] Computed 177 place invariants in 77 ms
[2023-03-22 23:50:08] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1011/1189 places, 1427/1695 transitions.
Applied a total of 0 rules in 102 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1723 ms. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-22 23:50:08] [INFO ] Computed 177 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 47365 resets, run finished after 5820 ms. (steps per millisecond=171 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2664 resets, run finished after 1602 ms. (steps per millisecond=624 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2622 resets, run finished after 1620 ms. (steps per millisecond=617 ) properties (out of 2) seen :6
[2023-03-22 23:50:17] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-22 23:50:17] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-22 23:50:17] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-22 23:50:17] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 23:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:50:18] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2023-03-22 23:50:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:50:18] [INFO ] [Nat]Absence check using 170 positive place invariants in 38 ms returned sat
[2023-03-22 23:50:18] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-22 23:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:50:18] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2023-03-22 23:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:50:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 578 ms returned sat
[2023-03-22 23:50:19] [INFO ] Deduced a trap composed of 320 places in 308 ms of which 1 ms to minimize.
[2023-03-22 23:50:20] [INFO ] Deduced a trap composed of 305 places in 328 ms of which 1 ms to minimize.
[2023-03-22 23:50:20] [INFO ] Deduced a trap composed of 326 places in 336 ms of which 1 ms to minimize.
[2023-03-22 23:50:20] [INFO ] Deduced a trap composed of 314 places in 319 ms of which 0 ms to minimize.
[2023-03-22 23:50:21] [INFO ] Deduced a trap composed of 314 places in 316 ms of which 1 ms to minimize.
[2023-03-22 23:50:21] [INFO ] Deduced a trap composed of 323 places in 318 ms of which 1 ms to minimize.
[2023-03-22 23:50:22] [INFO ] Deduced a trap composed of 317 places in 307 ms of which 1 ms to minimize.
[2023-03-22 23:50:22] [INFO ] Deduced a trap composed of 323 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:50:23] [INFO ] Deduced a trap composed of 345 places in 343 ms of which 1 ms to minimize.
[2023-03-22 23:50:23] [INFO ] Deduced a trap composed of 324 places in 339 ms of which 1 ms to minimize.
[2023-03-22 23:50:24] [INFO ] Deduced a trap composed of 320 places in 339 ms of which 1 ms to minimize.
[2023-03-22 23:50:24] [INFO ] Deduced a trap composed of 338 places in 334 ms of which 1 ms to minimize.
[2023-03-22 23:50:25] [INFO ] Deduced a trap composed of 335 places in 331 ms of which 1 ms to minimize.
[2023-03-22 23:50:25] [INFO ] Deduced a trap composed of 329 places in 319 ms of which 1 ms to minimize.
[2023-03-22 23:50:25] [INFO ] Deduced a trap composed of 326 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:50:26] [INFO ] Deduced a trap composed of 332 places in 315 ms of which 1 ms to minimize.
[2023-03-22 23:50:26] [INFO ] Deduced a trap composed of 317 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:50:27] [INFO ] Deduced a trap composed of 341 places in 317 ms of which 1 ms to minimize.
[2023-03-22 23:50:27] [INFO ] Deduced a trap composed of 317 places in 331 ms of which 2 ms to minimize.
[2023-03-22 23:50:28] [INFO ] Deduced a trap composed of 353 places in 315 ms of which 0 ms to minimize.
[2023-03-22 23:50:28] [INFO ] Deduced a trap composed of 323 places in 317 ms of which 1 ms to minimize.
[2023-03-22 23:50:29] [INFO ] Deduced a trap composed of 311 places in 305 ms of which 1 ms to minimize.
[2023-03-22 23:50:30] [INFO ] Deduced a trap composed of 326 places in 322 ms of which 1 ms to minimize.
[2023-03-22 23:50:30] [INFO ] Deduced a trap composed of 317 places in 308 ms of which 0 ms to minimize.
[2023-03-22 23:50:31] [INFO ] Deduced a trap composed of 314 places in 311 ms of which 1 ms to minimize.
[2023-03-22 23:50:32] [INFO ] Deduced a trap composed of 329 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:50:32] [INFO ] Deduced a trap composed of 317 places in 303 ms of which 1 ms to minimize.
[2023-03-22 23:50:33] [INFO ] Deduced a trap composed of 326 places in 334 ms of which 0 ms to minimize.
[2023-03-22 23:50:33] [INFO ] Deduced a trap composed of 329 places in 308 ms of which 1 ms to minimize.
[2023-03-22 23:50:34] [INFO ] Deduced a trap composed of 320 places in 302 ms of which 1 ms to minimize.
[2023-03-22 23:50:36] [INFO ] Deduced a trap composed of 317 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:50:39] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 20001 ms
[2023-03-22 23:50:39] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-22 23:50:39] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 23:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:50:40] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-22 23:50:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:50:40] [INFO ] [Nat]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-22 23:50:40] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-22 23:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:50:40] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2023-03-22 23:50:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 117 ms returned sat
[2023-03-22 23:50:41] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 0 ms to minimize.
[2023-03-22 23:50:41] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 0 ms to minimize.
[2023-03-22 23:50:42] [INFO ] Deduced a trap composed of 308 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:50:42] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 1 ms to minimize.
[2023-03-22 23:50:42] [INFO ] Deduced a trap composed of 326 places in 326 ms of which 1 ms to minimize.
[2023-03-22 23:50:43] [INFO ] Deduced a trap composed of 344 places in 337 ms of which 1 ms to minimize.
[2023-03-22 23:50:43] [INFO ] Deduced a trap composed of 320 places in 333 ms of which 0 ms to minimize.
[2023-03-22 23:50:44] [INFO ] Deduced a trap composed of 320 places in 330 ms of which 1 ms to minimize.
[2023-03-22 23:50:44] [INFO ] Deduced a trap composed of 314 places in 314 ms of which 3 ms to minimize.
[2023-03-22 23:50:44] [INFO ] Deduced a trap composed of 329 places in 328 ms of which 1 ms to minimize.
[2023-03-22 23:50:45] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 0 ms to minimize.
[2023-03-22 23:50:45] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 0 ms to minimize.
[2023-03-22 23:50:46] [INFO ] Deduced a trap composed of 329 places in 328 ms of which 1 ms to minimize.
[2023-03-22 23:50:46] [INFO ] Deduced a trap composed of 323 places in 325 ms of which 1 ms to minimize.
[2023-03-22 23:50:47] [INFO ] Deduced a trap composed of 308 places in 319 ms of which 1 ms to minimize.
[2023-03-22 23:50:47] [INFO ] Deduced a trap composed of 323 places in 309 ms of which 1 ms to minimize.
[2023-03-22 23:50:48] [INFO ] Deduced a trap composed of 311 places in 316 ms of which 0 ms to minimize.
[2023-03-22 23:50:48] [INFO ] Deduced a trap composed of 314 places in 300 ms of which 1 ms to minimize.
[2023-03-22 23:50:49] [INFO ] Deduced a trap composed of 320 places in 311 ms of which 3 ms to minimize.
[2023-03-22 23:50:49] [INFO ] Deduced a trap composed of 332 places in 322 ms of which 1 ms to minimize.
[2023-03-22 23:50:49] [INFO ] Deduced a trap composed of 332 places in 309 ms of which 2 ms to minimize.
[2023-03-22 23:50:50] [INFO ] Deduced a trap composed of 305 places in 309 ms of which 3 ms to minimize.
[2023-03-22 23:50:50] [INFO ] Deduced a trap composed of 320 places in 307 ms of which 1 ms to minimize.
[2023-03-22 23:50:51] [INFO ] Deduced a trap composed of 329 places in 312 ms of which 1 ms to minimize.
[2023-03-22 23:50:51] [INFO ] Deduced a trap composed of 320 places in 328 ms of which 1 ms to minimize.
[2023-03-22 23:50:52] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:50:53] [INFO ] Deduced a trap composed of 308 places in 317 ms of which 1 ms to minimize.
[2023-03-22 23:50:53] [INFO ] Deduced a trap composed of 332 places in 300 ms of which 0 ms to minimize.
[2023-03-22 23:50:53] [INFO ] Deduced a trap composed of 329 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:50:54] [INFO ] Deduced a trap composed of 314 places in 330 ms of which 1 ms to minimize.
[2023-03-22 23:50:54] [INFO ] Deduced a trap composed of 305 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:50:54] [INFO ] Deduced a trap composed of 332 places in 366 ms of which 0 ms to minimize.
[2023-03-22 23:50:55] [INFO ] Deduced a trap composed of 320 places in 352 ms of which 0 ms to minimize.
[2023-03-22 23:50:55] [INFO ] Deduced a trap composed of 329 places in 331 ms of which 1 ms to minimize.
[2023-03-22 23:50:56] [INFO ] Deduced a trap composed of 326 places in 333 ms of which 0 ms to minimize.
[2023-03-22 23:50:56] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 1 ms to minimize.
[2023-03-22 23:50:57] [INFO ] Deduced a trap composed of 335 places in 296 ms of which 1 ms to minimize.
[2023-03-22 23:50:57] [INFO ] Deduced a trap composed of 314 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:50:58] [INFO ] Deduced a trap composed of 335 places in 316 ms of which 1 ms to minimize.
[2023-03-22 23:50:58] [INFO ] Deduced a trap composed of 344 places in 319 ms of which 1 ms to minimize.
[2023-03-22 23:50:59] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 1 ms to minimize.
[2023-03-22 23:51:00] [INFO ] Deduced a trap composed of 308 places in 333 ms of which 1 ms to minimize.
[2023-03-22 23:51:01] [INFO ] Deduced a trap composed of 314 places in 311 ms of which 1 ms to minimize.
[2023-03-22 23:51:03] [INFO ] Deduced a trap composed of 299 places in 324 ms of which 0 ms to minimize.
[2023-03-22 23:51:05] [INFO ] Deduced a trap composed of 347 places in 355 ms of which 1 ms to minimize.
[2023-03-22 23:51:08] [INFO ] Deduced a trap composed of 329 places in 325 ms of which 1 ms to minimize.
[2023-03-22 23:51:10] [INFO ] Deduced a trap composed of 323 places in 326 ms of which 1 ms to minimize.
[2023-03-22 23:51:13] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 32224 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[3, 3]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 49 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 74 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-22 23:51:13] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-22 23:51:13] [INFO ] Invariant cache hit.
[2023-03-22 23:51:14] [INFO ] Implicit Places using invariants in 1490 ms returned []
[2023-03-22 23:51:14] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-22 23:51:14] [INFO ] Invariant cache hit.
[2023-03-22 23:51:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:51:20] [INFO ] Implicit Places using invariants and state equation in 6021 ms returned []
Implicit Place search using SMT with State Equation took 7525 ms to find 0 implicit places.
[2023-03-22 23:51:20] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-22 23:51:20] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-22 23:51:20] [INFO ] Invariant cache hit.
[2023-03-22 23:51:21] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8669 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-01
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-22 23:51:21] [INFO ] Computed 177 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 463 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-22 23:51:22] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-22 23:51:22] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-22 23:51:22] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-22 23:51:22] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 23:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:51:22] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-22 23:51:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:51:22] [INFO ] [Nat]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-22 23:51:22] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-22 23:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:51:23] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-22 23:51:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:51:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 561 ms returned sat
[2023-03-22 23:51:24] [INFO ] Deduced a trap composed of 320 places in 318 ms of which 1 ms to minimize.
[2023-03-22 23:51:24] [INFO ] Deduced a trap composed of 305 places in 321 ms of which 0 ms to minimize.
[2023-03-22 23:51:24] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 0 ms to minimize.
[2023-03-22 23:51:25] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 1 ms to minimize.
[2023-03-22 23:51:25] [INFO ] Deduced a trap composed of 314 places in 303 ms of which 1 ms to minimize.
[2023-03-22 23:51:26] [INFO ] Deduced a trap composed of 323 places in 306 ms of which 1 ms to minimize.
[2023-03-22 23:51:26] [INFO ] Deduced a trap composed of 317 places in 306 ms of which 1 ms to minimize.
[2023-03-22 23:51:26] [INFO ] Deduced a trap composed of 323 places in 299 ms of which 1 ms to minimize.
[2023-03-22 23:51:27] [INFO ] Deduced a trap composed of 345 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:51:27] [INFO ] Deduced a trap composed of 324 places in 318 ms of which 1 ms to minimize.
[2023-03-22 23:51:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1011 transition count 1426
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1010 transition count 1426
Applied a total of 2 rules in 51 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2023-03-22 23:51:27] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-22 23:51:27] [INFO ] Computed 177 place invariants in 28 ms
[2023-03-22 23:51:28] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1069 ms. Remains : 1010/1011 places, 1426/1427 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-22 23:51:28] [INFO ] Computed 177 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 52213 resets, run finished after 6138 ms. (steps per millisecond=162 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2667 resets, run finished after 1573 ms. (steps per millisecond=635 ) properties (out of 1) seen :3
[2023-03-22 23:51:36] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-22 23:51:36] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-22 23:51:36] [INFO ] [Real]Absence check using 170 positive place invariants in 38 ms returned sat
[2023-03-22 23:51:36] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 23:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:51:37] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-22 23:51:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:51:37] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-22 23:51:37] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-22 23:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:51:37] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-03-22 23:51:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:51:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 295 ms returned sat
[2023-03-22 23:51:38] [INFO ] Deduced a trap composed of 326 places in 328 ms of which 1 ms to minimize.
[2023-03-22 23:51:39] [INFO ] Deduced a trap composed of 305 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:51:39] [INFO ] Deduced a trap composed of 329 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:51:39] [INFO ] Deduced a trap composed of 329 places in 323 ms of which 0 ms to minimize.
[2023-03-22 23:51:40] [INFO ] Deduced a trap composed of 326 places in 325 ms of which 1 ms to minimize.
[2023-03-22 23:51:40] [INFO ] Deduced a trap composed of 323 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:51:41] [INFO ] Deduced a trap composed of 332 places in 288 ms of which 1 ms to minimize.
[2023-03-22 23:51:41] [INFO ] Deduced a trap composed of 293 places in 313 ms of which 1 ms to minimize.
[2023-03-22 23:51:42] [INFO ] Deduced a trap composed of 326 places in 302 ms of which 1 ms to minimize.
[2023-03-22 23:51:42] [INFO ] Deduced a trap composed of 338 places in 306 ms of which 1 ms to minimize.
[2023-03-22 23:51:42] [INFO ] Deduced a trap composed of 326 places in 305 ms of which 1 ms to minimize.
[2023-03-22 23:51:43] [INFO ] Deduced a trap composed of 314 places in 309 ms of which 1 ms to minimize.
[2023-03-22 23:51:44] [INFO ] Deduced a trap composed of 332 places in 309 ms of which 1 ms to minimize.
[2023-03-22 23:51:44] [INFO ] Deduced a trap composed of 305 places in 307 ms of which 0 ms to minimize.
[2023-03-22 23:51:45] [INFO ] Deduced a trap composed of 320 places in 328 ms of which 1 ms to minimize.
[2023-03-22 23:51:45] [INFO ] Deduced a trap composed of 323 places in 326 ms of which 1 ms to minimize.
[2023-03-22 23:51:46] [INFO ] Deduced a trap composed of 329 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:51:46] [INFO ] Deduced a trap composed of 329 places in 311 ms of which 1 ms to minimize.
[2023-03-22 23:51:46] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2023-03-22 23:51:47] [INFO ] Deduced a trap composed of 308 places in 307 ms of which 1 ms to minimize.
[2023-03-22 23:51:47] [INFO ] Deduced a trap composed of 317 places in 321 ms of which 0 ms to minimize.
[2023-03-22 23:51:47] [INFO ] Deduced a trap composed of 329 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:51:48] [INFO ] Deduced a trap composed of 329 places in 300 ms of which 1 ms to minimize.
[2023-03-22 23:51:48] [INFO ] Deduced a trap composed of 314 places in 306 ms of which 0 ms to minimize.
[2023-03-22 23:51:49] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 1 ms to minimize.
[2023-03-22 23:51:50] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 1 ms to minimize.
[2023-03-22 23:51:50] [INFO ] Deduced a trap composed of 356 places in 308 ms of which 1 ms to minimize.
[2023-03-22 23:51:51] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 1 ms to minimize.
[2023-03-22 23:51:51] [INFO ] Deduced a trap composed of 335 places in 306 ms of which 0 ms to minimize.
[2023-03-22 23:51:51] [INFO ] Deduced a trap composed of 324 places in 316 ms of which 0 ms to minimize.
[2023-03-22 23:51:52] [INFO ] Deduced a trap composed of 323 places in 306 ms of which 1 ms to minimize.
[2023-03-22 23:51:53] [INFO ] Deduced a trap composed of 314 places in 309 ms of which 1 ms to minimize.
[2023-03-22 23:51:54] [INFO ] Deduced a trap composed of 329 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:51:54] [INFO ] Deduced a trap composed of 332 places in 306 ms of which 1 ms to minimize.
[2023-03-22 23:51:55] [INFO ] Deduced a trap composed of 305 places in 313 ms of which 0 ms to minimize.
[2023-03-22 23:51:55] [INFO ] Deduced a trap composed of 299 places in 314 ms of which 1 ms to minimize.
[2023-03-22 23:51:56] [INFO ] Deduced a trap composed of 314 places in 327 ms of which 1 ms to minimize.
[2023-03-22 23:51:56] [INFO ] Deduced a trap composed of 305 places in 305 ms of which 0 ms to minimize.
[2023-03-22 23:51:57] [INFO ] Deduced a trap composed of 329 places in 324 ms of which 1 ms to minimize.
[2023-03-22 23:51:57] [INFO ] Deduced a trap composed of 314 places in 320 ms of which 0 ms to minimize.
[2023-03-22 23:51:58] [INFO ] Deduced a trap composed of 332 places in 319 ms of which 1 ms to minimize.
[2023-03-22 23:52:00] [INFO ] Deduced a trap composed of 320 places in 338 ms of which 1 ms to minimize.
[2023-03-22 23:52:01] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 1 ms to minimize.
[2023-03-22 23:52:04] [INFO ] Deduced a trap composed of 338 places in 302 ms of which 1 ms to minimize.
[2023-03-22 23:52:05] [INFO ] Deduced a trap composed of 311 places in 340 ms of which 0 ms to minimize.
[2023-03-22 23:52:05] [INFO ] Deduced a trap composed of 311 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:52:08] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 30512 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 43 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 35 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-22 23:52:08] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 23:52:08] [INFO ] Invariant cache hit.
[2023-03-22 23:52:10] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2023-03-22 23:52:10] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 23:52:10] [INFO ] Invariant cache hit.
[2023-03-22 23:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:52:14] [INFO ] Implicit Places using invariants and state equation in 4612 ms returned []
Implicit Place search using SMT with State Equation took 5887 ms to find 0 implicit places.
[2023-03-22 23:52:14] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 23:52:14] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-22 23:52:14] [INFO ] Invariant cache hit.
[2023-03-22 23:52:15] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6978 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-01 in 53891 ms.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-07
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-22 23:52:15] [INFO ] Computed 177 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 493 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-22 23:52:15] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-22 23:52:15] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-22 23:52:16] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-22 23:52:16] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 23:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:52:16] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2023-03-22 23:52:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:52:16] [INFO ] [Nat]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-22 23:52:16] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-22 23:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:52:17] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2023-03-22 23:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:52:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 126 ms returned sat
[2023-03-22 23:52:17] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 1 ms to minimize.
[2023-03-22 23:52:18] [INFO ] Deduced a trap composed of 317 places in 323 ms of which 0 ms to minimize.
[2023-03-22 23:52:18] [INFO ] Deduced a trap composed of 308 places in 320 ms of which 1 ms to minimize.
[2023-03-22 23:52:19] [INFO ] Deduced a trap composed of 302 places in 322 ms of which 1 ms to minimize.
[2023-03-22 23:52:19] [INFO ] Deduced a trap composed of 326 places in 308 ms of which 1 ms to minimize.
[2023-03-22 23:52:19] [INFO ] Deduced a trap composed of 344 places in 302 ms of which 1 ms to minimize.
[2023-03-22 23:52:20] [INFO ] Deduced a trap composed of 320 places in 315 ms of which 1 ms to minimize.
[2023-03-22 23:52:20] [INFO ] Deduced a trap composed of 320 places in 314 ms of which 1 ms to minimize.
[2023-03-22 23:52:20] [INFO ] Deduced a trap composed of 314 places in 305 ms of which 1 ms to minimize.
[2023-03-22 23:52:21] [INFO ] Deduced a trap composed of 329 places in 309 ms of which 1 ms to minimize.
[2023-03-22 23:52:21] [INFO ] Deduced a trap composed of 326 places in 300 ms of which 1 ms to minimize.
[2023-03-22 23:52:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 40 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-22 23:52:21] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-22 23:52:21] [INFO ] Invariant cache hit.
[2023-03-22 23:52:22] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1026 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-22 23:52:22] [INFO ] Computed 177 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 47417 resets, run finished after 5741 ms. (steps per millisecond=174 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2581 resets, run finished after 1573 ms. (steps per millisecond=635 ) properties (out of 1) seen :3
[2023-03-22 23:52:30] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-22 23:52:30] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-22 23:52:30] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-22 23:52:30] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 23:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 23:52:30] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2023-03-22 23:52:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 23:52:31] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-22 23:52:31] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-22 23:52:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 23:52:31] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2023-03-22 23:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:52:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 123 ms returned sat
[2023-03-22 23:52:32] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-22 23:52:32] [INFO ] Deduced a trap composed of 317 places in 308 ms of which 0 ms to minimize.
[2023-03-22 23:52:32] [INFO ] Deduced a trap composed of 308 places in 316 ms of which 1 ms to minimize.
[2023-03-22 23:52:33] [INFO ] Deduced a trap composed of 302 places in 317 ms of which 0 ms to minimize.
[2023-03-22 23:52:33] [INFO ] Deduced a trap composed of 326 places in 326 ms of which 1 ms to minimize.
[2023-03-22 23:52:34] [INFO ] Deduced a trap composed of 344 places in 327 ms of which 1 ms to minimize.
[2023-03-22 23:52:34] [INFO ] Deduced a trap composed of 320 places in 317 ms of which 1 ms to minimize.
[2023-03-22 23:52:34] [INFO ] Deduced a trap composed of 320 places in 314 ms of which 1 ms to minimize.
[2023-03-22 23:52:35] [INFO ] Deduced a trap composed of 314 places in 315 ms of which 1 ms to minimize.
[2023-03-22 23:52:35] [INFO ] Deduced a trap composed of 329 places in 332 ms of which 1 ms to minimize.
[2023-03-22 23:52:36] [INFO ] Deduced a trap composed of 326 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:52:36] [INFO ] Deduced a trap composed of 308 places in 294 ms of which 1 ms to minimize.
[2023-03-22 23:52:36] [INFO ] Deduced a trap composed of 329 places in 298 ms of which 1 ms to minimize.
[2023-03-22 23:52:37] [INFO ] Deduced a trap composed of 323 places in 294 ms of which 1 ms to minimize.
[2023-03-22 23:52:37] [INFO ] Deduced a trap composed of 308 places in 309 ms of which 1 ms to minimize.
[2023-03-22 23:52:38] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:52:38] [INFO ] Deduced a trap composed of 311 places in 308 ms of which 1 ms to minimize.
[2023-03-22 23:52:39] [INFO ] Deduced a trap composed of 314 places in 307 ms of which 1 ms to minimize.
[2023-03-22 23:52:39] [INFO ] Deduced a trap composed of 320 places in 323 ms of which 1 ms to minimize.
[2023-03-22 23:52:40] [INFO ] Deduced a trap composed of 332 places in 317 ms of which 0 ms to minimize.
[2023-03-22 23:52:40] [INFO ] Deduced a trap composed of 332 places in 304 ms of which 1 ms to minimize.
[2023-03-22 23:52:40] [INFO ] Deduced a trap composed of 305 places in 298 ms of which 0 ms to minimize.
[2023-03-22 23:52:41] [INFO ] Deduced a trap composed of 320 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:52:41] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 1 ms to minimize.
[2023-03-22 23:52:42] [INFO ] Deduced a trap composed of 320 places in 316 ms of which 1 ms to minimize.
[2023-03-22 23:52:43] [INFO ] Deduced a trap composed of 326 places in 333 ms of which 0 ms to minimize.
[2023-03-22 23:52:43] [INFO ] Deduced a trap composed of 308 places in 321 ms of which 1 ms to minimize.
[2023-03-22 23:52:44] [INFO ] Deduced a trap composed of 332 places in 319 ms of which 1 ms to minimize.
[2023-03-22 23:52:44] [INFO ] Deduced a trap composed of 329 places in 330 ms of which 1 ms to minimize.
[2023-03-22 23:52:44] [INFO ] Deduced a trap composed of 314 places in 316 ms of which 1 ms to minimize.
[2023-03-22 23:52:45] [INFO ] Deduced a trap composed of 305 places in 316 ms of which 0 ms to minimize.
[2023-03-22 23:52:45] [INFO ] Deduced a trap composed of 332 places in 303 ms of which 0 ms to minimize.
[2023-03-22 23:52:45] [INFO ] Deduced a trap composed of 320 places in 306 ms of which 1 ms to minimize.
[2023-03-22 23:52:46] [INFO ] Deduced a trap composed of 329 places in 313 ms of which 1 ms to minimize.
[2023-03-22 23:52:46] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 1 ms to minimize.
[2023-03-22 23:52:47] [INFO ] Deduced a trap composed of 317 places in 320 ms of which 1 ms to minimize.
[2023-03-22 23:52:47] [INFO ] Deduced a trap composed of 335 places in 315 ms of which 0 ms to minimize.
[2023-03-22 23:52:48] [INFO ] Deduced a trap composed of 314 places in 316 ms of which 1 ms to minimize.
[2023-03-22 23:52:48] [INFO ] Deduced a trap composed of 335 places in 318 ms of which 1 ms to minimize.
[2023-03-22 23:52:49] [INFO ] Deduced a trap composed of 344 places in 310 ms of which 1 ms to minimize.
[2023-03-22 23:52:49] [INFO ] Deduced a trap composed of 317 places in 325 ms of which 0 ms to minimize.
[2023-03-22 23:52:50] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 1 ms to minimize.
[2023-03-22 23:52:52] [INFO ] Deduced a trap composed of 314 places in 332 ms of which 1 ms to minimize.
[2023-03-22 23:52:54] [INFO ] Deduced a trap composed of 299 places in 319 ms of which 1 ms to minimize.
[2023-03-22 23:52:56] [INFO ] Deduced a trap composed of 347 places in 331 ms of which 1 ms to minimize.
[2023-03-22 23:52:59] [INFO ] Deduced a trap composed of 329 places in 319 ms of which 1 ms to minimize.
[2023-03-22 23:53:00] [INFO ] Deduced a trap composed of 323 places in 318 ms of which 1 ms to minimize.
[2023-03-22 23:53:03] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 31923 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 36 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 34 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-22 23:53:03] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-22 23:53:03] [INFO ] Invariant cache hit.
[2023-03-22 23:53:05] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2023-03-22 23:53:05] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-22 23:53:05] [INFO ] Invariant cache hit.
[2023-03-22 23:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 23:53:11] [INFO ] Implicit Places using invariants and state equation in 6448 ms returned []
Implicit Place search using SMT with State Equation took 7833 ms to find 0 implicit places.
[2023-03-22 23:53:11] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-22 23:53:11] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-22 23:53:11] [INFO ] Invariant cache hit.
[2023-03-22 23:53:12] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8912 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-07 in 56810 ms.
[2023-03-22 23:53:12] [INFO ] Flatten gal took : 176 ms
[2023-03-22 23:53:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 23:53:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1011 places, 1427 transitions and 7211 arcs took 8 ms.
Total runtime 201526 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S05J80
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: 1011 places, 1427 transitions, 7211 arcs.
Final Score: 174985.436
Took : 117 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10438752 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099692 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="PolyORBNT-COL-S05J80"
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 PolyORBNT-COL-S05J80, 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-167873953300669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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