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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679533484898

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-S10J60
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 01:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 01:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 01:04:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-23 01:04:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 01:04:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 684 ms
[2023-03-23 01:04:47] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-23 01:04:47] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-23 01:04:47] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 01:04:47] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-23 01:04:47] [INFO ] Invariant cache hit.
[2023-03-23 01:04:47] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 01:04:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:47] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 01:04:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:04:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:47] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
[2023-03-23 01:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-23 01:04:47] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 01:04:47] [INFO ] Added : 21 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 70 ms.
[2023-03-23 01:04:47] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 01:04:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:47] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-23 01:04:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 01:04:47] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-23 01:04:48] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2023-03-23 01:04:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2023-03-23 01:04:48] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 01:04:48] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 01:04:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-23 01:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 01:04:48] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 01:04:48] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 9 ms.
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 01:04:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 01:04:48] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2023-03-23 01:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-23 01:04:48] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 01:04:48] [INFO ] Added : 15 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 10 ms.
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 01:04:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-23 01:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-23 01:04:48] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 01:04:48] [INFO ] Added : 14 causal constraints over 4 iterations in 237 ms. Result :sat
Minimization took 81 ms.
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 01:04:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:48] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-23 01:04:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-23 01:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 01:04:48] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 01:04:49] [INFO ] Added : 20 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 01:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-23 01:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-23 01:04:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 01:04:49] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2023-03-23 01:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-23 01:04:49] [INFO ] Added : 33 causal constraints over 7 iterations in 151 ms. Result :sat
Minimization took 25 ms.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 01:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 01:04:49] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 01:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-23 01:04:49] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2023-03-23 01:04:49] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2023-03-23 01:04:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 87 ms
[2023-03-23 01:04:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 01:04:49] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 12 ms.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 01:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-23 01:04:49] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2023-03-23 01:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-23 01:04:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 01:04:49] [INFO ] Added : 20 causal constraints over 5 iterations in 94 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-23 01:04:49] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 01:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 01:04:50] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-23 01:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 01:04:50] [INFO ] Added : 36 causal constraints over 8 iterations in 149 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-23 01:04:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 01:04:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 01:04:50] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2023-03-23 01:04:50] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-23 01:04:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-23 01:04:50] [INFO ] Added : 36 causal constraints over 8 iterations in 181 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-23 01:04:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 01:04:50] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-23 01:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-23 01:04:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 01:04:50] [INFO ] Added : 20 causal constraints over 4 iterations in 213 ms. Result :sat
Minimization took 83 ms.
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 01:04:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 01:04:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 01:04:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 01:04:51] [INFO ] Added : 36 causal constraints over 8 iterations in 95 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 01:04:51] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 01:04:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-23 01:04:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 01:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 01:04:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 01:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:51] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 01:04:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 01:04:51] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-23 01:04:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-23 01:04:51] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 01:04:51] [INFO ] Added : 19 causal constraints over 4 iterations in 260 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [10, -1, 1, 1, 10, 2, 1, -1, -1, 2, 1, 1, 4, -1, 1, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 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-23 01:04:51] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 214 ms.
[2023-03-23 01:04:51] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 26 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 15) seen :3
FORMULA PolyORBNT-COL-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :15
FORMULA PolyORBNT-COL-S10J60-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :1
[2023-03-23 01:04:52] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-23 01:04:52] [INFO ] Computed 152 place invariants in 209 ms
[2023-03-23 01:04:52] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-23 01:04:52] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-23 01:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:53] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2023-03-23 01:04:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:04:54] [INFO ] [Nat]Absence check using 145 positive place invariants in 49 ms returned sat
[2023-03-23 01:04:54] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-23 01:04:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:55] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2023-03-23 01:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:04:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1109 ms returned sat
[2023-03-23 01:04:56] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 334 ms.
[2023-03-23 01:04:58] [INFO ] Deduced a trap composed of 596 places in 740 ms of which 2 ms to minimize.
[2023-03-23 01:04:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 952 ms
[2023-03-23 01:04:58] [INFO ] Added : 17 causal constraints over 4 iterations in 2115 ms. Result :sat
Minimization took 299 ms.
[2023-03-23 01:04:59] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-23 01:04:59] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-23 01:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:04:59] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2023-03-23 01:05:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:05:00] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-23 01:05:00] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-23 01:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:01] [INFO ] [Nat]Absence check using state equation in 1744 ms returned sat
[2023-03-23 01:05:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1280 ms returned sat
[2023-03-23 01:05:03] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 636 ms.
[2023-03-23 01:05:05] [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 1
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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:714)
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)
[2023-03-23 01:05:05] [INFO ] [Real]Absence check using 145 positive place invariants in 93 ms returned sat
[2023-03-23 01:05:05] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 44 ms returned sat
[2023-03-23 01:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:06] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2023-03-23 01:05:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:05:06] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-23 01:05:06] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-23 01:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:08] [INFO ] [Nat]Absence check using state equation in 1688 ms returned sat
[2023-03-23 01:05:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2023-03-23 01:05:08] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 201 ms.
[2023-03-23 01:05:08] [INFO ] Added : 6 causal constraints over 2 iterations in 581 ms. Result :sat
Minimization took 517 ms.
[2023-03-23 01:05:09] [INFO ] [Real]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-23 01:05:09] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-23 01:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:10] [INFO ] [Real]Absence check using state equation in 892 ms returned sat
[2023-03-23 01:05:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:05:10] [INFO ] [Nat]Absence check using 145 positive place invariants in 47 ms returned sat
[2023-03-23 01:05:10] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-23 01:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:13] [INFO ] [Nat]Absence check using state equation in 2246 ms returned sat
[2023-03-23 01:05:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 73 ms returned sat
[2023-03-23 01:05:13] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 226 ms.
[2023-03-23 01:05:13] [INFO ] Added : 7 causal constraints over 2 iterations in 584 ms. Result :sat
Minimization took 799 ms.
[2023-03-23 01:05:15] [INFO ] [Real]Absence check using 145 positive place invariants in 67 ms returned sat
[2023-03-23 01:05:15] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-23 01:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:15] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2023-03-23 01:05:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:05:16] [INFO ] [Nat]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-23 01:05:16] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-23 01:05:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:18] [INFO ] [Nat]Absence check using state equation in 1977 ms returned sat
[2023-03-23 01:05:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 602 ms returned sat
[2023-03-23 01:05:19] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 234 ms.
[2023-03-23 01:05:20] [INFO ] Deduced a trap composed of 328 places in 711 ms of which 1 ms to minimize.
[2023-03-23 01:05:20] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1461 ms
[2023-03-23 01:05:21] [INFO ] Deduced a trap composed of 11 places in 1011 ms of which 1 ms to minimize.
[2023-03-23 01:05: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 4
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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:714)
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)
[2023-03-23 01:05:22] [INFO ] [Real]Absence check using 145 positive place invariants in 47 ms returned sat
[2023-03-23 01:05:22] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-23 01:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:22] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2023-03-23 01:05:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:05:23] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-23 01:05:23] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-23 01:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:28] [INFO ] [Nat]Absence check using state equation in 4832 ms returned unknown
[2023-03-23 01:05:28] [INFO ] [Real]Absence check using 145 positive place invariants in 44 ms returned sat
[2023-03-23 01:05:28] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned unsat
[2023-03-23 01:05:28] [INFO ] [Real]Absence check using 145 positive place invariants in 42 ms returned sat
[2023-03-23 01:05:28] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-23 01:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:29] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2023-03-23 01:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:05:29] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2023-03-23 01:05:29] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-23 01:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:31] [INFO ] [Nat]Absence check using state equation in 1515 ms returned sat
[2023-03-23 01:05:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 267 ms returned sat
[2023-03-23 01:05:31] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 199 ms.
[2023-03-23 01:05:33] [INFO ] Deduced a trap composed of 19 places in 692 ms of which 4 ms to minimize.
[2023-03-23 01:05:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 882 ms
[2023-03-23 01:05:33] [INFO ] Added : 23 causal constraints over 5 iterations in 1923 ms. Result :sat
Minimization took 993 ms.
[2023-03-23 01:05:34] [INFO ] [Real]Absence check using 145 positive place invariants in 40 ms returned sat
[2023-03-23 01:05:34] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-23 01:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:35] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2023-03-23 01:05:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:05:35] [INFO ] [Nat]Absence check using 145 positive place invariants in 48 ms returned sat
[2023-03-23 01:05:35] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-23 01:05:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:38] [INFO ] [Nat]Absence check using state equation in 2980 ms returned sat
[2023-03-23 01:05:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2023-03-23 01:05:39] [INFO ] Deduced a trap composed of 506 places in 683 ms of which 1 ms to minimize.
[2023-03-23 01:05:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1007 ms
[2023-03-23 01:05:39] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 192 ms.
[2023-03-23 01:05:41] [INFO ] Deduced a trap composed of 11 places in 833 ms of which 17 ms to minimize.
[2023-03-23 01:05:41] [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 8
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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:714)
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)
[2023-03-23 01:05:41] [INFO ] [Real]Absence check using 145 positive place invariants in 41 ms returned sat
[2023-03-23 01:05:41] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-23 01:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:42] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2023-03-23 01:05:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:05:42] [INFO ] [Nat]Absence check using 145 positive place invariants in 51 ms returned sat
[2023-03-23 01:05:42] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-23 01:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:05:43] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2023-03-23 01:05:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 541 ms returned sat
[2023-03-23 01:05:44] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 194 ms.
[2023-03-23 01:05:45] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 0 ms to minimize.
[2023-03-23 01:05:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 547 ms
[2023-03-23 01:05:46] [INFO ] Added : 27 causal constraints over 6 iterations in 1915 ms. Result :sat
Minimization took 1170 ms.
[2023-03-23 01:05:47] [INFO ] [Real]Absence check using 145 positive place invariants in 45 ms returned sat
[2023-03-23 01:05:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 2147483647, 1, 1, 10, 2, 1, 2147483647, 2, 2147483647, 4] Max seen :[3, 0, 0, 0, 2, 0, 1, 0, 0, 0, 4]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 1224 transition count 2747
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 138 place count 1161 transition count 2745
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 1159 transition count 2745
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 140 place count 1159 transition count 2681
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 268 place count 1095 transition count 2681
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 1094 transition count 2680
Applied a total of 270 rules in 679 ms. Remains 1094 /1234 variables (removed 140) and now considering 2680/2810 (removed 130) transitions.
[2023-03-23 01:05:48] [INFO ] Flow matrix only has 2671 transitions (discarded 9 similar events)
// Phase 1: matrix 2671 rows 1094 cols
[2023-03-23 01:05:48] [INFO ] Computed 142 place invariants in 141 ms
[2023-03-23 01:05:50] [INFO ] Dead Transitions using invariants and state equation in 1689 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1094/1234 places, 2065/2810 transitions.
Applied a total of 0 rules in 82 ms. Remains 1094 /1094 variables (removed 0) and now considering 2065/2065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2468 ms. Remains : 1094/1234 places, 2065/2810 transitions.
Normalized transition count is 2056 out of 2065 initially.
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-23 01:05:50] [INFO ] Computed 142 place invariants in 80 ms
Incomplete random walk after 1000000 steps, including 69117 resets, run finished after 10155 ms. (steps per millisecond=98 ) properties (out of 7) seen :13
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7132 resets, run finished after 1985 ms. (steps per millisecond=503 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 7475 resets, run finished after 2001 ms. (steps per millisecond=499 ) properties (out of 5) seen :9
Incomplete Best-First random walk after 1000001 steps, including 7212 resets, run finished after 1987 ms. (steps per millisecond=503 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 7286 resets, run finished after 2001 ms. (steps per millisecond=499 ) properties (out of 5) seen :9
Incomplete Best-First random walk after 1000001 steps, including 7132 resets, run finished after 1973 ms. (steps per millisecond=506 ) properties (out of 5) seen :9
[2023-03-23 01:06:10] [INFO ] Flow matrix only has 2056 transitions (discarded 9 similar events)
// Phase 1: matrix 2056 rows 1094 cols
[2023-03-23 01:06:10] [INFO ] Computed 142 place invariants in 62 ms
[2023-03-23 01:06:10] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-23 01:06:10] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-23 01:06:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:06:11] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2023-03-23 01:06:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:06:11] [INFO ] [Nat]Absence check using 135 positive place invariants in 38 ms returned sat
[2023-03-23 01:06:11] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 01:06:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:06:11] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2023-03-23 01:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:06:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 549 ms returned sat
[2023-03-23 01:06:12] [INFO ] Deduced a trap composed of 447 places in 446 ms of which 0 ms to minimize.
[2023-03-23 01:06:13] [INFO ] Deduced a trap composed of 447 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:06:13] [INFO ] Deduced a trap composed of 445 places in 460 ms of which 1 ms to minimize.
[2023-03-23 01:06:14] [INFO ] Deduced a trap composed of 445 places in 458 ms of which 1 ms to minimize.
[2023-03-23 01:06:14] [INFO ] Deduced a trap composed of 447 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:06:15] [INFO ] Deduced a trap composed of 443 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:06:15] [INFO ] Deduced a trap composed of 437 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:06:16] [INFO ] Deduced a trap composed of 445 places in 453 ms of which 1 ms to minimize.
[2023-03-23 01:06:17] [INFO ] Deduced a trap composed of 449 places in 469 ms of which 14 ms to minimize.
[2023-03-23 01:06:17] [INFO ] Deduced a trap composed of 445 places in 531 ms of which 4 ms to minimize.
[2023-03-23 01:06:18] [INFO ] Deduced a trap composed of 445 places in 430 ms of which 0 ms to minimize.
[2023-03-23 01:06:18] [INFO ] Deduced a trap composed of 445 places in 448 ms of which 1 ms to minimize.
[2023-03-23 01:06:19] [INFO ] Deduced a trap composed of 441 places in 468 ms of which 1 ms to minimize.
[2023-03-23 01:06:19] [INFO ] Deduced a trap composed of 449 places in 430 ms of which 1 ms to minimize.
[2023-03-23 01:06:20] [INFO ] Deduced a trap composed of 451 places in 448 ms of which 1 ms to minimize.
[2023-03-23 01:06:21] [INFO ] Deduced a trap composed of 439 places in 453 ms of which 1 ms to minimize.
[2023-03-23 01:06:21] [INFO ] Deduced a trap composed of 441 places in 469 ms of which 0 ms to minimize.
[2023-03-23 01:06:22] [INFO ] Deduced a trap composed of 447 places in 461 ms of which 1 ms to minimize.
[2023-03-23 01:06:22] [INFO ] Deduced a trap composed of 443 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:06:23] [INFO ] Deduced a trap composed of 445 places in 438 ms of which 1 ms to minimize.
[2023-03-23 01:06:23] [INFO ] Deduced a trap composed of 451 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:06:24] [INFO ] Deduced a trap composed of 433 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:06:24] [INFO ] Deduced a trap composed of 425 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:06:25] [INFO ] Deduced a trap composed of 437 places in 448 ms of which 1 ms to minimize.
[2023-03-23 01:06:25] [INFO ] Deduced a trap composed of 445 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:06:26] [INFO ] Deduced a trap composed of 437 places in 478 ms of which 10 ms to minimize.
[2023-03-23 01:06:27] [INFO ] Deduced a trap composed of 443 places in 471 ms of which 3 ms to minimize.
[2023-03-23 01:06:27] [INFO ] Deduced a trap composed of 439 places in 473 ms of which 1 ms to minimize.
[2023-03-23 01:06:28] [INFO ] Deduced a trap composed of 439 places in 436 ms of which 1 ms to minimize.
[2023-03-23 01:06:29] [INFO ] Deduced a trap composed of 447 places in 441 ms of which 1 ms to minimize.
[2023-03-23 01:06:30] [INFO ] Deduced a trap composed of 445 places in 498 ms of which 16 ms to minimize.
[2023-03-23 01:06:30] [INFO ] Deduced a trap composed of 441 places in 505 ms of which 1 ms to minimize.
[2023-03-23 01:06:31] [INFO ] Deduced a trap composed of 445 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:06:31] [INFO ] Deduced a trap composed of 451 places in 463 ms of which 1 ms to minimize.
[2023-03-23 01:06:32] [INFO ] Deduced a trap composed of 453 places in 444 ms of which 1 ms to minimize.
[2023-03-23 01:06:33] [INFO ] Deduced a trap composed of 431 places in 463 ms of which 1 ms to minimize.
[2023-03-23 01:06:34] [INFO ] Deduced a trap composed of 443 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:06:34] [INFO ] Deduced a trap composed of 447 places in 444 ms of which 0 ms to minimize.
[2023-03-23 01:06:35] [INFO ] Deduced a trap composed of 447 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:06:35] [INFO ] Deduced a trap composed of 451 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:06:36] [INFO ] Deduced a trap composed of 441 places in 447 ms of which 3 ms to minimize.
[2023-03-23 01:06:37] [INFO ] Deduced a trap composed of 445 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:06:37] [INFO ] Deduced a trap composed of 441 places in 467 ms of which 14 ms to minimize.
[2023-03-23 01:06:38] [INFO ] Deduced a trap composed of 445 places in 456 ms of which 0 ms to minimize.
[2023-03-23 01:06:39] [INFO ] Deduced a trap composed of 439 places in 442 ms of which 2 ms to minimize.
[2023-03-23 01:06:39] [INFO ] Deduced a trap composed of 449 places in 484 ms of which 1 ms to minimize.
[2023-03-23 01:06:40] [INFO ] Deduced a trap composed of 445 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:06:41] [INFO ] Deduced a trap composed of 449 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:06:41] [INFO ] Deduced a trap composed of 451 places in 477 ms of which 0 ms to minimize.
[2023-03-23 01:06:42] [INFO ] Deduced a trap composed of 447 places in 470 ms of which 1 ms to minimize.
[2023-03-23 01:06:42] [INFO ] Deduced a trap composed of 439 places in 487 ms of which 1 ms to minimize.
[2023-03-23 01:06:43] [INFO ] Deduced a trap composed of 447 places in 440 ms of which 1 ms to minimize.
[2023-03-23 01:06:44] [INFO ] Deduced a trap composed of 447 places in 460 ms of which 0 ms to minimize.
[2023-03-23 01:06:44] [INFO ] Deduced a trap composed of 449 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:06:45] [INFO ] Deduced a trap composed of 451 places in 444 ms of which 1 ms to minimize.
[2023-03-23 01:06:46] [INFO ] Deduced a trap composed of 453 places in 455 ms of which 1 ms to minimize.
[2023-03-23 01:06:46] [INFO ] Deduced a trap composed of 447 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:06:47] [INFO ] Deduced a trap composed of 447 places in 471 ms of which 1 ms to minimize.
[2023-03-23 01:06:48] [INFO ] Deduced a trap composed of 443 places in 436 ms of which 1 ms to minimize.
[2023-03-23 01:06:49] [INFO ] Deduced a trap composed of 433 places in 453 ms of which 1 ms to minimize.
[2023-03-23 01:06:50] [INFO ] Deduced a trap composed of 447 places in 442 ms of which 1 ms to minimize.
[2023-03-23 01:06:51] [INFO ] Deduced a trap composed of 455 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:06:51] [INFO ] Deduced a trap composed of 433 places in 436 ms of which 1 ms to minimize.
[2023-03-23 01:06:52] [INFO ] Deduced a trap composed of 443 places in 472 ms of which 1 ms to minimize.
[2023-03-23 01:06:53] [INFO ] Deduced a trap composed of 441 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:06:54] [INFO ] Deduced a trap composed of 443 places in 438 ms of which 1 ms to minimize.
[2023-03-23 01:06:54] [INFO ] Deduced a trap composed of 447 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:06:56] [INFO ] Trap strengthening (SAT) tested/added 67/67 trap constraints in 43819 ms
[2023-03-23 01:06:56] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-23 01:06:56] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-23 01:06:56] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-23 01:06:56] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 01:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:06:56] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-23 01:06:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:06:57] [INFO ] [Nat]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-23 01:06:57] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 01:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:06:57] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2023-03-23 01:06:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 544 ms returned sat
[2023-03-23 01:06:58] [INFO ] Deduced a trap composed of 431 places in 455 ms of which 1 ms to minimize.
[2023-03-23 01:06:59] [INFO ] Deduced a trap composed of 435 places in 441 ms of which 1 ms to minimize.
[2023-03-23 01:06:59] [INFO ] Deduced a trap composed of 445 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:07:00] [INFO ] Deduced a trap composed of 439 places in 466 ms of which 1 ms to minimize.
[2023-03-23 01:07:00] [INFO ] Deduced a trap composed of 443 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:07:01] [INFO ] Deduced a trap composed of 445 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:07:01] [INFO ] Deduced a trap composed of 443 places in 441 ms of which 1 ms to minimize.
[2023-03-23 01:07:02] [INFO ] Deduced a trap composed of 447 places in 458 ms of which 1 ms to minimize.
[2023-03-23 01:07:03] [INFO ] Deduced a trap composed of 441 places in 443 ms of which 1 ms to minimize.
[2023-03-23 01:07:03] [INFO ] Deduced a trap composed of 455 places in 474 ms of which 1 ms to minimize.
[2023-03-23 01:07:04] [INFO ] Deduced a trap composed of 435 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:07:04] [INFO ] Deduced a trap composed of 443 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:07:05] [INFO ] Deduced a trap composed of 447 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:07:05] [INFO ] Deduced a trap composed of 445 places in 482 ms of which 1 ms to minimize.
[2023-03-23 01:07:06] [INFO ] Deduced a trap composed of 461 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:07:06] [INFO ] Deduced a trap composed of 443 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:07:07] [INFO ] Deduced a trap composed of 441 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:07:08] [INFO ] Deduced a trap composed of 445 places in 464 ms of which 1 ms to minimize.
[2023-03-23 01:07:08] [INFO ] Deduced a trap composed of 455 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:07:09] [INFO ] Deduced a trap composed of 447 places in 467 ms of which 1 ms to minimize.
[2023-03-23 01:07:09] [INFO ] Deduced a trap composed of 445 places in 467 ms of which 0 ms to minimize.
[2023-03-23 01:07:10] [INFO ] Deduced a trap composed of 445 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:07:10] [INFO ] Deduced a trap composed of 444 places in 485 ms of which 1 ms to minimize.
[2023-03-23 01:07:12] [INFO ] Deduced a trap composed of 445 places in 460 ms of which 1 ms to minimize.
[2023-03-23 01:07:13] [INFO ] Deduced a trap composed of 453 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:07:14] [INFO ] Deduced a trap composed of 457 places in 460 ms of which 2 ms to minimize.
[2023-03-23 01:07:14] [INFO ] Deduced a trap composed of 447 places in 453 ms of which 1 ms to minimize.
[2023-03-23 01:07:15] [INFO ] Deduced a trap composed of 443 places in 455 ms of which 1 ms to minimize.
[2023-03-23 01:07:16] [INFO ] Deduced a trap composed of 439 places in 470 ms of which 1 ms to minimize.
[2023-03-23 01:07:16] [INFO ] Deduced a trap composed of 441 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:07:17] [INFO ] Deduced a trap composed of 449 places in 478 ms of which 1 ms to minimize.
[2023-03-23 01:07:18] [INFO ] Deduced a trap composed of 443 places in 484 ms of which 0 ms to minimize.
[2023-03-23 01:07:18] [INFO ] Deduced a trap composed of 443 places in 466 ms of which 1 ms to minimize.
[2023-03-23 01:07:19] [INFO ] Deduced a trap composed of 439 places in 476 ms of which 1 ms to minimize.
[2023-03-23 01:07:19] [INFO ] Deduced a trap composed of 453 places in 479 ms of which 1 ms to minimize.
[2023-03-23 01:07:20] [INFO ] Deduced a trap composed of 433 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:07:21] [INFO ] Deduced a trap composed of 449 places in 472 ms of which 0 ms to minimize.
[2023-03-23 01:07:21] [INFO ] Deduced a trap composed of 435 places in 443 ms of which 0 ms to minimize.
[2023-03-23 01:07:22] [INFO ] Deduced a trap composed of 445 places in 484 ms of which 1 ms to minimize.
[2023-03-23 01:07:22] [INFO ] Deduced a trap composed of 447 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:07:23] [INFO ] Deduced a trap composed of 453 places in 473 ms of which 1 ms to minimize.
[2023-03-23 01:07:23] [INFO ] Deduced a trap composed of 453 places in 473 ms of which 1 ms to minimize.
[2023-03-23 01:07:24] [INFO ] Deduced a trap composed of 455 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:07:25] [INFO ] Deduced a trap composed of 439 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:07:26] [INFO ] Deduced a trap composed of 443 places in 486 ms of which 1 ms to minimize.
[2023-03-23 01:07:26] [INFO ] Deduced a trap composed of 453 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:07:27] [INFO ] Deduced a trap composed of 447 places in 455 ms of which 1 ms to minimize.
[2023-03-23 01:07:27] [INFO ] Deduced a trap composed of 449 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:07:28] [INFO ] Deduced a trap composed of 445 places in 468 ms of which 1 ms to minimize.
[2023-03-23 01:07:29] [INFO ] Deduced a trap composed of 449 places in 453 ms of which 0 ms to minimize.
[2023-03-23 01:07:29] [INFO ] Deduced a trap composed of 451 places in 451 ms of which 2 ms to minimize.
[2023-03-23 01:07:30] [INFO ] Deduced a trap composed of 451 places in 461 ms of which 1 ms to minimize.
[2023-03-23 01:07:30] [INFO ] Deduced a trap composed of 455 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:07:31] [INFO ] Deduced a trap composed of 443 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:07:32] [INFO ] Deduced a trap composed of 449 places in 467 ms of which 1 ms to minimize.
[2023-03-23 01:07:33] [INFO ] Deduced a trap composed of 445 places in 485 ms of which 0 ms to minimize.
[2023-03-23 01:07:33] [INFO ] Deduced a trap composed of 445 places in 464 ms of which 1 ms to minimize.
[2023-03-23 01:07:34] [INFO ] Deduced a trap composed of 453 places in 482 ms of which 1 ms to minimize.
[2023-03-23 01:07:34] [INFO ] Deduced a trap composed of 443 places in 453 ms of which 1 ms to minimize.
[2023-03-23 01:07:35] [INFO ] Deduced a trap composed of 445 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:07:36] [INFO ] Deduced a trap composed of 447 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:07:37] [INFO ] Deduced a trap composed of 449 places in 499 ms of which 1 ms to minimize.
[2023-03-23 01:07:38] [INFO ] Deduced a trap composed of 443 places in 448 ms of which 1 ms to minimize.
[2023-03-23 01:07:39] [INFO ] Deduced a trap composed of 429 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:07:39] [INFO ] Deduced a trap composed of 447 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:07:40] [INFO ] Deduced a trap composed of 453 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:07:42] [INFO ] Deduced a trap composed of 463 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:07:42] [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 2
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:714)
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)
[2023-03-23 01:07:42] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-23 01:07:42] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-23 01:07:42] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-23 01:07:42] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 10, 1, 1] Max seen :[3, 1, 3, 1, 1]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 2065/2065 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1094 transition count 2064
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1093 transition count 2064
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1091 transition count 2062
Applied a total of 6 rules in 178 ms. Remains 1091 /1094 variables (removed 3) and now considering 2062/2065 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 1091/1094 places, 2062/2065 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:07:42] [INFO ] Computed 142 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 70146 resets, run finished after 10180 ms. (steps per millisecond=98 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 7303 resets, run finished after 1981 ms. (steps per millisecond=504 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 6989 resets, run finished after 1962 ms. (steps per millisecond=509 ) properties (out of 2) seen :4
[2023-03-23 01:07:56] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:07:56] [INFO ] Computed 142 place invariants in 50 ms
[2023-03-23 01:07:57] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-23 01:07:57] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 01:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:07:57] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2023-03-23 01:07:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:07:57] [INFO ] [Nat]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-23 01:07:57] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-23 01:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:07:58] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2023-03-23 01:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:07:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 945 ms returned sat
[2023-03-23 01:07:59] [INFO ] Deduced a trap composed of 444 places in 464 ms of which 1 ms to minimize.
[2023-03-23 01:08:00] [INFO ] Deduced a trap composed of 450 places in 484 ms of which 1 ms to minimize.
[2023-03-23 01:08:00] [INFO ] Deduced a trap composed of 438 places in 466 ms of which 1 ms to minimize.
[2023-03-23 01:08:01] [INFO ] Deduced a trap composed of 442 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:08:01] [INFO ] Deduced a trap composed of 454 places in 461 ms of which 1 ms to minimize.
[2023-03-23 01:08:02] [INFO ] Deduced a trap composed of 452 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:08:02] [INFO ] Deduced a trap composed of 438 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:08:03] [INFO ] Deduced a trap composed of 442 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:08:03] [INFO ] Deduced a trap composed of 444 places in 453 ms of which 1 ms to minimize.
[2023-03-23 01:08:04] [INFO ] Deduced a trap composed of 454 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:08:05] [INFO ] Deduced a trap composed of 438 places in 465 ms of which 1 ms to minimize.
[2023-03-23 01:08:05] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:08:06] [INFO ] Deduced a trap composed of 442 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:08:06] [INFO ] Deduced a trap composed of 452 places in 478 ms of which 1 ms to minimize.
[2023-03-23 01:08:07] [INFO ] Deduced a trap composed of 436 places in 491 ms of which 1 ms to minimize.
[2023-03-23 01:08:07] [INFO ] Deduced a trap composed of 436 places in 471 ms of which 1 ms to minimize.
[2023-03-23 01:08:08] [INFO ] Deduced a trap composed of 446 places in 455 ms of which 0 ms to minimize.
[2023-03-23 01:08:09] [INFO ] Deduced a trap composed of 454 places in 492 ms of which 0 ms to minimize.
[2023-03-23 01:08:09] [INFO ] Deduced a trap composed of 452 places in 424 ms of which 1 ms to minimize.
[2023-03-23 01:08:10] [INFO ] Deduced a trap composed of 434 places in 434 ms of which 1 ms to minimize.
[2023-03-23 01:08:10] [INFO ] Deduced a trap composed of 448 places in 463 ms of which 1 ms to minimize.
[2023-03-23 01:08:11] [INFO ] Deduced a trap composed of 442 places in 485 ms of which 1 ms to minimize.
[2023-03-23 01:08:12] [INFO ] Deduced a trap composed of 432 places in 458 ms of which 1 ms to minimize.
[2023-03-23 01:08:12] [INFO ] Deduced a trap composed of 456 places in 448 ms of which 1 ms to minimize.
[2023-03-23 01:08:13] [INFO ] Deduced a trap composed of 438 places in 467 ms of which 1 ms to minimize.
[2023-03-23 01:08:14] [INFO ] Deduced a trap composed of 446 places in 468 ms of which 0 ms to minimize.
[2023-03-23 01:08:14] [INFO ] Deduced a trap composed of 446 places in 473 ms of which 1 ms to minimize.
[2023-03-23 01:08:15] [INFO ] Deduced a trap composed of 436 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:08:16] [INFO ] Deduced a trap composed of 444 places in 489 ms of which 1 ms to minimize.
[2023-03-23 01:08:17] [INFO ] Deduced a trap composed of 446 places in 461 ms of which 1 ms to minimize.
[2023-03-23 01:08:17] [INFO ] Deduced a trap composed of 446 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:08:18] [INFO ] Deduced a trap composed of 436 places in 478 ms of which 1 ms to minimize.
[2023-03-23 01:08:19] [INFO ] Deduced a trap composed of 436 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:08:19] [INFO ] Deduced a trap composed of 442 places in 441 ms of which 1 ms to minimize.
[2023-03-23 01:08:20] [INFO ] Deduced a trap composed of 432 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:08:21] [INFO ] Deduced a trap composed of 456 places in 476 ms of which 1 ms to minimize.
[2023-03-23 01:08:21] [INFO ] Deduced a trap composed of 450 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:08:22] [INFO ] Deduced a trap composed of 438 places in 493 ms of which 1 ms to minimize.
[2023-03-23 01:08:22] [INFO ] Deduced a trap composed of 442 places in 472 ms of which 1 ms to minimize.
[2023-03-23 01:08:23] [INFO ] Deduced a trap composed of 448 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:08:23] [INFO ] Deduced a trap composed of 444 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:08:24] [INFO ] Deduced a trap composed of 430 places in 464 ms of which 1 ms to minimize.
[2023-03-23 01:08:25] [INFO ] Deduced a trap composed of 440 places in 444 ms of which 1 ms to minimize.
[2023-03-23 01:08:25] [INFO ] Deduced a trap composed of 438 places in 446 ms of which 1 ms to minimize.
[2023-03-23 01:08:26] [INFO ] Deduced a trap composed of 440 places in 463 ms of which 1 ms to minimize.
[2023-03-23 01:08:26] [INFO ] Deduced a trap composed of 434 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:08:27] [INFO ] Deduced a trap composed of 440 places in 468 ms of which 0 ms to minimize.
[2023-03-23 01:08:28] [INFO ] Deduced a trap composed of 444 places in 481 ms of which 1 ms to minimize.
[2023-03-23 01:08:29] [INFO ] Deduced a trap composed of 440 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:08:29] [INFO ] Deduced a trap composed of 440 places in 490 ms of which 1 ms to minimize.
[2023-03-23 01:08:30] [INFO ] Deduced a trap composed of 440 places in 444 ms of which 0 ms to minimize.
[2023-03-23 01:08:32] [INFO ] Deduced a trap composed of 432 places in 465 ms of which 1 ms to minimize.
[2023-03-23 01:08:33] [INFO ] Deduced a trap composed of 442 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:08:34] [INFO ] Deduced a trap composed of 444 places in 442 ms of which 1 ms to minimize.
[2023-03-23 01:08:34] [INFO ] Deduced a trap composed of 444 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:08:35] [INFO ] Deduced a trap composed of 448 places in 442 ms of which 1 ms to minimize.
[2023-03-23 01:08:35] [INFO ] Deduced a trap composed of 446 places in 444 ms of which 0 ms to minimize.
[2023-03-23 01:08:38] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 39249 ms
[2023-03-23 01:08:38] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-23 01:08:38] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-23 01:08:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:08:39] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2023-03-23 01:08:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:08:39] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-23 01:08:39] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-23 01:08:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:08:39] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-23 01:08:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 631 ms returned sat
[2023-03-23 01:08:41] [INFO ] Deduced a trap composed of 442 places in 484 ms of which 1 ms to minimize.
[2023-03-23 01:08:41] [INFO ] Deduced a trap composed of 434 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:08:42] [INFO ] Deduced a trap composed of 438 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:08:42] [INFO ] Deduced a trap composed of 434 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:08:43] [INFO ] Deduced a trap composed of 438 places in 468 ms of which 1 ms to minimize.
[2023-03-23 01:08:43] [INFO ] Deduced a trap composed of 436 places in 440 ms of which 1 ms to minimize.
[2023-03-23 01:08:44] [INFO ] Deduced a trap composed of 444 places in 469 ms of which 1 ms to minimize.
[2023-03-23 01:08:44] [INFO ] Deduced a trap composed of 436 places in 444 ms of which 1 ms to minimize.
[2023-03-23 01:08:45] [INFO ] Deduced a trap composed of 450 places in 460 ms of which 0 ms to minimize.
[2023-03-23 01:08:45] [INFO ] Deduced a trap composed of 438 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:08:46] [INFO ] Deduced a trap composed of 444 places in 429 ms of which 1 ms to minimize.
[2023-03-23 01:08:46] [INFO ] Deduced a trap composed of 438 places in 451 ms of which 0 ms to minimize.
[2023-03-23 01:08:47] [INFO ] Deduced a trap composed of 448 places in 465 ms of which 1 ms to minimize.
[2023-03-23 01:08:47] [INFO ] Deduced a trap composed of 450 places in 455 ms of which 1 ms to minimize.
[2023-03-23 01:08:48] [INFO ] Deduced a trap composed of 442 places in 446 ms of which 0 ms to minimize.
[2023-03-23 01:08:49] [INFO ] Deduced a trap composed of 440 places in 433 ms of which 2 ms to minimize.
[2023-03-23 01:08:49] [INFO ] Deduced a trap composed of 450 places in 458 ms of which 1 ms to minimize.
[2023-03-23 01:08:50] [INFO ] Deduced a trap composed of 436 places in 437 ms of which 1 ms to minimize.
[2023-03-23 01:08:51] [INFO ] Deduced a trap composed of 442 places in 433 ms of which 1 ms to minimize.
[2023-03-23 01:08:51] [INFO ] Deduced a trap composed of 442 places in 468 ms of which 1 ms to minimize.
[2023-03-23 01:08:52] [INFO ] Deduced a trap composed of 446 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:08:52] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 1 ms to minimize.
[2023-03-23 01:08:53] [INFO ] Deduced a trap composed of 448 places in 448 ms of which 1 ms to minimize.
[2023-03-23 01:08:54] [INFO ] Deduced a trap composed of 448 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:08:54] [INFO ] Deduced a trap composed of 450 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:08:55] [INFO ] Deduced a trap composed of 460 places in 439 ms of which 1 ms to minimize.
[2023-03-23 01:08:55] [INFO ] Deduced a trap composed of 442 places in 487 ms of which 0 ms to minimize.
[2023-03-23 01:08:56] [INFO ] Deduced a trap composed of 430 places in 481 ms of which 1 ms to minimize.
[2023-03-23 01:08:56] [INFO ] Deduced a trap composed of 436 places in 467 ms of which 1 ms to minimize.
[2023-03-23 01:08:57] [INFO ] Deduced a trap composed of 446 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:08:58] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 1 ms to minimize.
[2023-03-23 01:08:58] [INFO ] Deduced a trap composed of 444 places in 448 ms of which 0 ms to minimize.
[2023-03-23 01:08:59] [INFO ] Deduced a trap composed of 438 places in 435 ms of which 2 ms to minimize.
[2023-03-23 01:09:00] [INFO ] Deduced a trap composed of 442 places in 451 ms of which 0 ms to minimize.
[2023-03-23 01:09:01] [INFO ] Deduced a trap composed of 442 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:09:01] [INFO ] Deduced a trap composed of 440 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:09:02] [INFO ] Deduced a trap composed of 438 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:09:03] [INFO ] Deduced a trap composed of 446 places in 477 ms of which 1 ms to minimize.
[2023-03-23 01:09:04] [INFO ] Deduced a trap composed of 448 places in 458 ms of which 2 ms to minimize.
[2023-03-23 01:09:04] [INFO ] Deduced a trap composed of 442 places in 467 ms of which 18 ms to minimize.
[2023-03-23 01:09:05] [INFO ] Deduced a trap composed of 446 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:09:05] [INFO ] Deduced a trap composed of 438 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:09:07] [INFO ] Deduced a trap composed of 438 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:09:08] [INFO ] Deduced a trap composed of 444 places in 455 ms of which 0 ms to minimize.
[2023-03-23 01:09:11] [INFO ] Deduced a trap composed of 434 places in 461 ms of which 1 ms to minimize.
[2023-03-23 01:09:12] [INFO ] Deduced a trap composed of 446 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:09:12] [INFO ] Deduced a trap composed of 444 places in 469 ms of which 1 ms to minimize.
[2023-03-23 01:09:13] [INFO ] Deduced a trap composed of 436 places in 470 ms of which 1 ms to minimize.
[2023-03-23 01:09:14] [INFO ] Deduced a trap composed of 430 places in 443 ms of which 1 ms to minimize.
[2023-03-23 01:09:14] [INFO ] Deduced a trap composed of 428 places in 483 ms of which 1 ms to minimize.
[2023-03-23 01:09:15] [INFO ] Deduced a trap composed of 456 places in 466 ms of which 1 ms to minimize.
[2023-03-23 01:09:17] [INFO ] Deduced a trap composed of 432 places in 443 ms of which 1 ms to minimize.
[2023-03-23 01:09:17] [INFO ] Deduced a trap composed of 452 places in 446 ms of which 1 ms to minimize.
[2023-03-23 01:09:18] [INFO ] Deduced a trap composed of 448 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:09:19] [INFO ] Deduced a trap composed of 434 places in 476 ms of which 2 ms to minimize.
[2023-03-23 01:09:20] [INFO ] Deduced a trap composed of 440 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:09:21] [INFO ] Deduced a trap composed of 434 places in 470 ms of which 1 ms to minimize.
[2023-03-23 01:09:22] [INFO ] Deduced a trap composed of 444 places in 478 ms of which 1 ms to minimize.
[2023-03-23 01:09:23] [INFO ] Deduced a trap composed of 442 places in 440 ms of which 1 ms to minimize.
[2023-03-23 01:09:24] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 43739 ms
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[3, 3]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 50 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 51 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 01:09:24] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:09:24] [INFO ] Invariant cache hit.
[2023-03-23 01:09:25] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2023-03-23 01:09:25] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:09:25] [INFO ] Invariant cache hit.
[2023-03-23 01:09:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:09:31] [INFO ] Implicit Places using invariants and state equation in 6098 ms returned []
Implicit Place search using SMT with State Equation took 7209 ms to find 0 implicit places.
[2023-03-23 01:09:31] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-23 01:09:31] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:09:31] [INFO ] Invariant cache hit.
[2023-03-23 01:09:32] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8493 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-00
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:09:32] [INFO ] Computed 142 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 713 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2023-03-23 01:09:33] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:09:33] [INFO ] Computed 142 place invariants in 37 ms
[2023-03-23 01:09:33] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-23 01:09:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 01:09:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:09:33] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-23 01:09:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:09:33] [INFO ] [Nat]Absence check using 135 positive place invariants in 60 ms returned sat
[2023-03-23 01:09:33] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-23 01:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:09:34] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2023-03-23 01:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:09:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 953 ms returned sat
[2023-03-23 01:09:35] [INFO ] Deduced a trap composed of 444 places in 455 ms of which 0 ms to minimize.
[2023-03-23 01:09:36] [INFO ] Deduced a trap composed of 450 places in 451 ms of which 0 ms to minimize.
[2023-03-23 01:09:37] [INFO ] Deduced a trap composed of 438 places in 474 ms of which 1 ms to minimize.
[2023-03-23 01:09:37] [INFO ] Deduced a trap composed of 442 places in 458 ms of which 1 ms to minimize.
[2023-03-23 01:09:38] [INFO ] Deduced a trap composed of 454 places in 474 ms of which 1 ms to minimize.
[2023-03-23 01:09:38] [INFO ] Deduced a trap composed of 452 places in 444 ms of which 0 ms to minimize.
[2023-03-23 01:09:39] [INFO ] Deduced a trap composed of 438 places in 485 ms of which 1 ms to minimize.
[2023-03-23 01:09:39] [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 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 46 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 01:09:39] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:09:39] [INFO ] Invariant cache hit.
[2023-03-23 01:09:40] [INFO ] Dead Transitions using invariants and state equation in 1151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1198 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:09:40] [INFO ] Computed 142 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 70379 resets, run finished after 10022 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7319 resets, run finished after 1958 ms. (steps per millisecond=510 ) properties (out of 1) seen :3
[2023-03-23 01:09:52] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:09:52] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-23 01:09:52] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-23 01:09:52] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-23 01:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:09:53] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2023-03-23 01:09:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:09:53] [INFO ] [Nat]Absence check using 135 positive place invariants in 53 ms returned sat
[2023-03-23 01:09:53] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-23 01:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:09:53] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2023-03-23 01:09:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:09:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 942 ms returned sat
[2023-03-23 01:09:55] [INFO ] Deduced a trap composed of 444 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:09:55] [INFO ] Deduced a trap composed of 450 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:09:56] [INFO ] Deduced a trap composed of 438 places in 475 ms of which 1 ms to minimize.
[2023-03-23 01:09:56] [INFO ] Deduced a trap composed of 442 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:09:57] [INFO ] Deduced a trap composed of 454 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:09:57] [INFO ] Deduced a trap composed of 452 places in 481 ms of which 1 ms to minimize.
[2023-03-23 01:09:58] [INFO ] Deduced a trap composed of 438 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:09:58] [INFO ] Deduced a trap composed of 442 places in 462 ms of which 0 ms to minimize.
[2023-03-23 01:09:59] [INFO ] Deduced a trap composed of 444 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:09:59] [INFO ] Deduced a trap composed of 454 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:10:00] [INFO ] Deduced a trap composed of 438 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:10:01] [INFO ] Deduced a trap composed of 438 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:10:01] [INFO ] Deduced a trap composed of 442 places in 461 ms of which 1 ms to minimize.
[2023-03-23 01:10:02] [INFO ] Deduced a trap composed of 452 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:10:02] [INFO ] Deduced a trap composed of 436 places in 441 ms of which 1 ms to minimize.
[2023-03-23 01:10:03] [INFO ] Deduced a trap composed of 436 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:10:03] [INFO ] Deduced a trap composed of 446 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:10:04] [INFO ] Deduced a trap composed of 454 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:10:04] [INFO ] Deduced a trap composed of 452 places in 505 ms of which 1 ms to minimize.
[2023-03-23 01:10:05] [INFO ] Deduced a trap composed of 434 places in 440 ms of which 1 ms to minimize.
[2023-03-23 01:10:05] [INFO ] Deduced a trap composed of 448 places in 436 ms of which 1 ms to minimize.
[2023-03-23 01:10:06] [INFO ] Deduced a trap composed of 442 places in 471 ms of which 1 ms to minimize.
[2023-03-23 01:10:07] [INFO ] Deduced a trap composed of 432 places in 439 ms of which 1 ms to minimize.
[2023-03-23 01:10:08] [INFO ] Deduced a trap composed of 456 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:10:08] [INFO ] Deduced a trap composed of 438 places in 443 ms of which 0 ms to minimize.
[2023-03-23 01:10:09] [INFO ] Deduced a trap composed of 446 places in 441 ms of which 1 ms to minimize.
[2023-03-23 01:10:10] [INFO ] Deduced a trap composed of 446 places in 437 ms of which 0 ms to minimize.
[2023-03-23 01:10:10] [INFO ] Deduced a trap composed of 436 places in 442 ms of which 1 ms to minimize.
[2023-03-23 01:10:11] [INFO ] Deduced a trap composed of 444 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:10:12] [INFO ] Deduced a trap composed of 446 places in 461 ms of which 1 ms to minimize.
[2023-03-23 01:10:12] [INFO ] Deduced a trap composed of 446 places in 455 ms of which 1 ms to minimize.
[2023-03-23 01:10:13] [INFO ] Deduced a trap composed of 436 places in 487 ms of which 1 ms to minimize.
[2023-03-23 01:10:14] [INFO ] Deduced a trap composed of 436 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:10:15] [INFO ] Deduced a trap composed of 442 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:10:15] [INFO ] Deduced a trap composed of 432 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:10:16] [INFO ] Deduced a trap composed of 456 places in 467 ms of which 1 ms to minimize.
[2023-03-23 01:10:16] [INFO ] Deduced a trap composed of 450 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:10:17] [INFO ] Deduced a trap composed of 438 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:10:17] [INFO ] Deduced a trap composed of 442 places in 445 ms of which 0 ms to minimize.
[2023-03-23 01:10:18] [INFO ] Deduced a trap composed of 448 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:10:19] [INFO ] Deduced a trap composed of 444 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:10:19] [INFO ] Deduced a trap composed of 430 places in 437 ms of which 1 ms to minimize.
[2023-03-23 01:10:20] [INFO ] Deduced a trap composed of 440 places in 436 ms of which 1 ms to minimize.
[2023-03-23 01:10:20] [INFO ] Deduced a trap composed of 438 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:10:21] [INFO ] Deduced a trap composed of 440 places in 455 ms of which 1 ms to minimize.
[2023-03-23 01:10:21] [INFO ] Deduced a trap composed of 434 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:10:22] [INFO ] Deduced a trap composed of 440 places in 487 ms of which 1 ms to minimize.
[2023-03-23 01:10:23] [INFO ] Deduced a trap composed of 444 places in 465 ms of which 0 ms to minimize.
[2023-03-23 01:10:24] [INFO ] Deduced a trap composed of 440 places in 484 ms of which 1 ms to minimize.
[2023-03-23 01:10:24] [INFO ] Deduced a trap composed of 440 places in 475 ms of which 1 ms to minimize.
[2023-03-23 01:10:25] [INFO ] Deduced a trap composed of 440 places in 509 ms of which 1 ms to minimize.
[2023-03-23 01:10:27] [INFO ] Deduced a trap composed of 432 places in 474 ms of which 1 ms to minimize.
[2023-03-23 01:10:28] [INFO ] Deduced a trap composed of 442 places in 489 ms of which 1 ms to minimize.
[2023-03-23 01:10:29] [INFO ] Deduced a trap composed of 444 places in 463 ms of which 1 ms to minimize.
[2023-03-23 01:10:29] [INFO ] Deduced a trap composed of 444 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:10:30] [INFO ] Deduced a trap composed of 448 places in 477 ms of which 1 ms to minimize.
[2023-03-23 01:10:30] [INFO ] Deduced a trap composed of 446 places in 438 ms of which 1 ms to minimize.
[2023-03-23 01:10:33] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 38994 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 45 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 45 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 01:10:33] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:10:33] [INFO ] Invariant cache hit.
[2023-03-23 01:10:34] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-23 01:10:34] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:10:34] [INFO ] Invariant cache hit.
[2023-03-23 01:10:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:10:41] [INFO ] Implicit Places using invariants and state equation in 6995 ms returned []
Implicit Place search using SMT with State Equation took 7979 ms to find 0 implicit places.
[2023-03-23 01:10:41] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-23 01:10:41] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:10:41] [INFO ] Invariant cache hit.
[2023-03-23 01:10:43] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9278 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-00 in 70240 ms.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-04
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:10:43] [INFO ] Computed 142 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 698 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2023-03-23 01:10:43] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:10:43] [INFO ] Computed 142 place invariants in 37 ms
[2023-03-23 01:10:43] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-23 01:10:43] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-23 01:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:10:43] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-23 01:10:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:10:44] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-23 01:10:44] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-23 01:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:10:44] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2023-03-23 01:10:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:10:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 630 ms returned sat
[2023-03-23 01:10:45] [INFO ] Deduced a trap composed of 442 places in 469 ms of which 1 ms to minimize.
[2023-03-23 01:10:46] [INFO ] Deduced a trap composed of 434 places in 450 ms of which 1 ms to minimize.
[2023-03-23 01:10:46] [INFO ] Deduced a trap composed of 438 places in 483 ms of which 1 ms to minimize.
[2023-03-23 01:10:47] [INFO ] Deduced a trap composed of 434 places in 458 ms of which 1 ms to minimize.
[2023-03-23 01:10:48] [INFO ] Deduced a trap composed of 438 places in 478 ms of which 1 ms to minimize.
[2023-03-23 01:10:48] [INFO ] Deduced a trap composed of 436 places in 475 ms of which 1 ms to minimize.
[2023-03-23 01:10:49] [INFO ] Deduced a trap composed of 444 places in 452 ms of which 1 ms to minimize.
[2023-03-23 01:10:49] [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 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 95 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 01:10:49] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:10:49] [INFO ] Invariant cache hit.
[2023-03-23 01:10:50] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1226 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:10:50] [INFO ] Computed 142 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 70537 resets, run finished after 10048 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7319 resets, run finished after 1989 ms. (steps per millisecond=502 ) properties (out of 1) seen :3
[2023-03-23 01:11:02] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 01:11:02] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-23 01:11:02] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-23 01:11:02] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 01:11:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 01:11:03] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-23 01:11:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 01:11:03] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-23 01:11:03] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-23 01:11:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 01:11:03] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2023-03-23 01:11:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:11:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 637 ms returned sat
[2023-03-23 01:11:04] [INFO ] Deduced a trap composed of 442 places in 484 ms of which 1 ms to minimize.
[2023-03-23 01:11:05] [INFO ] Deduced a trap composed of 434 places in 478 ms of which 1 ms to minimize.
[2023-03-23 01:11:06] [INFO ] Deduced a trap composed of 438 places in 476 ms of which 1 ms to minimize.
[2023-03-23 01:11:06] [INFO ] Deduced a trap composed of 434 places in 459 ms of which 1 ms to minimize.
[2023-03-23 01:11:07] [INFO ] Deduced a trap composed of 438 places in 458 ms of which 1 ms to minimize.
[2023-03-23 01:11:07] [INFO ] Deduced a trap composed of 436 places in 442 ms of which 1 ms to minimize.
[2023-03-23 01:11:08] [INFO ] Deduced a trap composed of 444 places in 446 ms of which 1 ms to minimize.
[2023-03-23 01:11:08] [INFO ] Deduced a trap composed of 436 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:11:09] [INFO ] Deduced a trap composed of 450 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:11:09] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 1 ms to minimize.
[2023-03-23 01:11:10] [INFO ] Deduced a trap composed of 444 places in 460 ms of which 1 ms to minimize.
[2023-03-23 01:11:10] [INFO ] Deduced a trap composed of 438 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:11:11] [INFO ] Deduced a trap composed of 448 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:11:11] [INFO ] Deduced a trap composed of 450 places in 471 ms of which 1 ms to minimize.
[2023-03-23 01:11:12] [INFO ] Deduced a trap composed of 442 places in 472 ms of which 1 ms to minimize.
[2023-03-23 01:11:13] [INFO ] Deduced a trap composed of 440 places in 461 ms of which 0 ms to minimize.
[2023-03-23 01:11:13] [INFO ] Deduced a trap composed of 450 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:11:14] [INFO ] Deduced a trap composed of 436 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:11:15] [INFO ] Deduced a trap composed of 442 places in 448 ms of which 1 ms to minimize.
[2023-03-23 01:11:15] [INFO ] Deduced a trap composed of 442 places in 466 ms of which 1 ms to minimize.
[2023-03-23 01:11:16] [INFO ] Deduced a trap composed of 446 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:11:16] [INFO ] Deduced a trap composed of 446 places in 446 ms of which 0 ms to minimize.
[2023-03-23 01:11:17] [INFO ] Deduced a trap composed of 448 places in 463 ms of which 1 ms to minimize.
[2023-03-23 01:11:18] [INFO ] Deduced a trap composed of 448 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:11:18] [INFO ] Deduced a trap composed of 450 places in 469 ms of which 1 ms to minimize.
[2023-03-23 01:11:19] [INFO ] Deduced a trap composed of 460 places in 442 ms of which 0 ms to minimize.
[2023-03-23 01:11:19] [INFO ] Deduced a trap composed of 442 places in 456 ms of which 0 ms to minimize.
[2023-03-23 01:11:20] [INFO ] Deduced a trap composed of 430 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:11:20] [INFO ] Deduced a trap composed of 436 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:11:21] [INFO ] Deduced a trap composed of 446 places in 472 ms of which 1 ms to minimize.
[2023-03-23 01:11:22] [INFO ] Deduced a trap composed of 438 places in 437 ms of which 1 ms to minimize.
[2023-03-23 01:11:22] [INFO ] Deduced a trap composed of 444 places in 471 ms of which 1 ms to minimize.
[2023-03-23 01:11:23] [INFO ] Deduced a trap composed of 438 places in 464 ms of which 1 ms to minimize.
[2023-03-23 01:11:24] [INFO ] Deduced a trap composed of 442 places in 447 ms of which 0 ms to minimize.
[2023-03-23 01:11:25] [INFO ] Deduced a trap composed of 442 places in 446 ms of which 1 ms to minimize.
[2023-03-23 01:11:25] [INFO ] Deduced a trap composed of 440 places in 457 ms of which 0 ms to minimize.
[2023-03-23 01:11:26] [INFO ] Deduced a trap composed of 438 places in 468 ms of which 1 ms to minimize.
[2023-03-23 01:11:26] [INFO ] Deduced a trap composed of 446 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:11:27] [INFO ] Deduced a trap composed of 448 places in 449 ms of which 1 ms to minimize.
[2023-03-23 01:11:28] [INFO ] Deduced a trap composed of 442 places in 463 ms of which 1 ms to minimize.
[2023-03-23 01:11:29] [INFO ] Deduced a trap composed of 446 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:11:29] [INFO ] Deduced a trap composed of 438 places in 469 ms of which 1 ms to minimize.
[2023-03-23 01:11:31] [INFO ] Deduced a trap composed of 438 places in 462 ms of which 1 ms to minimize.
[2023-03-23 01:11:32] [INFO ] Deduced a trap composed of 444 places in 453 ms of which 1 ms to minimize.
[2023-03-23 01:11:35] [INFO ] Deduced a trap composed of 434 places in 447 ms of which 0 ms to minimize.
[2023-03-23 01:11:36] [INFO ] Deduced a trap composed of 446 places in 451 ms of which 1 ms to minimize.
[2023-03-23 01:11:36] [INFO ] Deduced a trap composed of 444 places in 443 ms of which 1 ms to minimize.
[2023-03-23 01:11:37] [INFO ] Deduced a trap composed of 436 places in 447 ms of which 1 ms to minimize.
[2023-03-23 01:11:38] [INFO ] Deduced a trap composed of 430 places in 497 ms of which 1 ms to minimize.
[2023-03-23 01:11:38] [INFO ] Deduced a trap composed of 428 places in 481 ms of which 0 ms to minimize.
[2023-03-23 01:11:39] [INFO ] Deduced a trap composed of 456 places in 461 ms of which 0 ms to minimize.
[2023-03-23 01:11:41] [INFO ] Deduced a trap composed of 432 places in 445 ms of which 1 ms to minimize.
[2023-03-23 01:11:41] [INFO ] Deduced a trap composed of 452 places in 456 ms of which 1 ms to minimize.
[2023-03-23 01:11:42] [INFO ] Deduced a trap composed of 448 places in 563 ms of which 0 ms to minimize.
[2023-03-23 01:11:42] [INFO ] Deduced a trap composed of 434 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:11:43] [INFO ] Deduced a trap composed of 440 places in 457 ms of which 1 ms to minimize.
[2023-03-23 01:11:45] [INFO ] Deduced a trap composed of 434 places in 468 ms of which 0 ms to minimize.
[2023-03-23 01:11:46] [INFO ] Deduced a trap composed of 444 places in 481 ms of which 0 ms to minimize.
[2023-03-23 01:11:47] [INFO ] Deduced a trap composed of 442 places in 454 ms of which 1 ms to minimize.
[2023-03-23 01:11:48] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 43714 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 57 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 75 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 01:11:48] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:11:48] [INFO ] Invariant cache hit.
[2023-03-23 01:11:49] [INFO ] Implicit Places using invariants in 884 ms returned []
[2023-03-23 01:11:49] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:11:49] [INFO ] Invariant cache hit.
[2023-03-23 01:11:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 01:11:57] [INFO ] Implicit Places using invariants and state equation in 8460 ms returned []
Implicit Place search using SMT with State Equation took 9362 ms to find 0 implicit places.
[2023-03-23 01:11:57] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-23 01:11:57] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 01:11:57] [INFO ] Invariant cache hit.
[2023-03-23 01:11:58] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10594 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-04 in 75702 ms.
[2023-03-23 01:11:59] [INFO ] Flatten gal took : 237 ms
[2023-03-23 01:11:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 01:11:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1091 places, 2062 transitions and 11821 arcs took 13 ms.
Total runtime 432796 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S10J60
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: 1091 places, 2062 transitions, 11821 arcs.
Final Score: 422151.552
Took : 34 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14472268 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16099088 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-S10J60"
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-S10J60, 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-167873953300701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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