About the Execution of LTSMin+red for PolyORBNT-COL-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1202.672 | 3600000.00 | 13978114.00 | 582.50 | 10 1 1 1 3 1 10 1 ? 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950800677.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 ltsminxred
Input is PolyORBNT-COL-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800677
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K 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-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679607170209
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 21:32:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 21:32:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 21:32:52] [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 21:32:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 21:32:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 781 ms
[2023-03-23 21:32:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-23 21:32:53] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-23 21:32:53] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 21:32:53] [INFO ] Computed 13 place invariants in 11 ms
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 21:32:53] [INFO ] Invariant cache hit.
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-23 21:32:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-23 21:32:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:32:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-23 21:32:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 21:32:53] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 21:32:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 21:32:53] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2023-03-23 21:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-23 21:32:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 21:32:53] [INFO ] Added : 36 causal constraints over 8 iterations in 133 ms. Result :sat
Minimization took 12 ms.
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 21:32:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-23 21:32:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 21:32:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 21:32:53] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-23 21:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-23 21:32:53] [INFO ] Added : 36 causal constraints over 8 iterations in 168 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-23 21:32:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-23 21:32:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 21:32:54] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 21:32:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 21:32:54] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-23 21:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-23 21:32:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 21:32:54] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2023-03-23 21:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-23 21:32:54] [INFO ] Added : 36 causal constraints over 8 iterations in 94 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 21:32:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 21:32:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 21:32:54] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 21:32:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-23 21:32:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 21:32:54] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-23 21:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-23 21:32:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 21:32:54] [INFO ] Added : 22 causal constraints over 5 iterations in 168 ms. Result :sat
Minimization took 35 ms.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 21:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-23 21:32:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-23 21:32:55] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2023-03-23 21:32:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 89 ms
[2023-03-23 21:32:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 21:32:55] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 25 ms.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 21:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-23 21:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 21:32:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 21:32:55] [INFO ] Added : 15 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 10 ms.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 21:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 21:32:55] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 21:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 21:32:55] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2023-03-23 21:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-23 21:32:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 21:32:55] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2023-03-23 21:32:55] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2023-03-23 21:32:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-03-23 21:32:55] [INFO ] Added : 36 causal constraints over 8 iterations in 243 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 21:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:56] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-23 21:32:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 21:32:56] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2023-03-23 21:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-23 21:32:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 21:32:56] [INFO ] Added : 36 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 11 ms.
[2023-03-23 21:32:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:56] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:56] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 21:32:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 21:32:56] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 21:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:56] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-23 21:32:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 21:32:56] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-23 21:32:56] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2023-03-23 21:32:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2023-03-23 21:32:56] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 21:32:56] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [10, -1, 1, -1, 3, -1, -1, 4, -1, 1, -1, -1, -1, -1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-23 21:32:56] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 210 ms.
[2023-03-23 21:32:56] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 27 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 557 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 13) seen :20
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :2
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 :2
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 :2
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :2
[2023-03-23 21:32:57] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-23 21:32:57] [INFO ] Computed 72 place invariants in 82 ms
[2023-03-23 21:32:57] [INFO ] [Real]Absence check using 65 positive place invariants in 66 ms returned sat
[2023-03-23 21:32:57] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-23 21:32:57] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-23 21:32:57] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 5 ms returned unsat
[2023-03-23 21:32:57] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-23 21:32:57] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 21:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:58] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2023-03-23 21:32:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-23 21:32:58] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-23 21:32:58] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-23 21:32:58] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-23 21:32:58] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-23 21:32:58] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 21:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:32:59] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-23 21:32:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:32:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-23 21:32:59] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-23 21:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:33:00] [INFO ] [Nat]Absence check using state equation in 1603 ms returned sat
[2023-03-23 21:33:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:33:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 59 ms returned sat
[2023-03-23 21:33:01] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 182 ms.
[2023-03-23 21:33:01] [INFO ] Added : 12 causal constraints over 3 iterations in 522 ms. Result :sat
Minimization took 336 ms.
[2023-03-23 21:33:01] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-23 21:33:01] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-23 21:33:02] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-23 21:33:02] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 21:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:33:02] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2023-03-23 21:33:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:33:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-23 21:33:02] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 21:33:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:33:03] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2023-03-23 21:33:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-23 21:33:03] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 388 ms.
[2023-03-23 21:33:03] [INFO ] Added : 7 causal constraints over 2 iterations in 642 ms. Result :sat
Minimization took 288 ms.
[2023-03-23 21:33:04] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2023-03-23 21:33:04] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-23 21:33:04] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-23 21:33:04] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-23 21:33:04] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-23 21:33:04] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 21:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:33:05] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-23 21:33:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:33:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2023-03-23 21:33:05] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned unsat
[2023-03-23 21:33:05] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-23 21:33:05] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 3, 1, 0, 1, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1624
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 1599
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 413 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 1598
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 410 transition count 1596
Applied a total of 118 rules in 284 ms. Remains 410 /474 variables (removed 64) and now considering 1596/1650 (removed 54) transitions.
[2023-03-23 21:33:05] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2023-03-23 21:33:05] [INFO ] Computed 62 place invariants in 87 ms
[2023-03-23 21:33:06] [INFO ] Dead Transitions using invariants and state equation in 863 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 : 410/474 places, 981/1650 transitions.
Applied a total of 0 rules in 29 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1180 ms. Remains : 410/474 places, 981/1650 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 21:33:06] [INFO ] Computed 62 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 72834 resets, run finished after 10305 ms. (steps per millisecond=97 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9661 resets, run finished after 1857 ms. (steps per millisecond=538 ) properties (out of 1) seen :3
[2023-03-23 21:33:18] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 21:33:18] [INFO ] Computed 62 place invariants in 21 ms
[2023-03-23 21:33:18] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-23 21:33:18] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-23 21:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:33:19] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2023-03-23 21:33:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:33:19] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-23 21:33:19] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 21:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:33:19] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-23 21:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:33:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 104 ms returned sat
[2023-03-23 21:33:19] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 1 ms to minimize.
[2023-03-23 21:33:20] [INFO ] Deduced a trap composed of 158 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:33:20] [INFO ] Deduced a trap composed of 162 places in 248 ms of which 1 ms to minimize.
[2023-03-23 21:33:20] [INFO ] Deduced a trap composed of 152 places in 239 ms of which 0 ms to minimize.
[2023-03-23 21:33:20] [INFO ] Deduced a trap composed of 152 places in 235 ms of which 0 ms to minimize.
[2023-03-23 21:33:21] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 1 ms to minimize.
[2023-03-23 21:33:21] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 2 ms to minimize.
[2023-03-23 21:33:21] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 1 ms to minimize.
[2023-03-23 21:33:22] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 0 ms to minimize.
[2023-03-23 21:33:22] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 0 ms to minimize.
[2023-03-23 21:33:22] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 1 ms to minimize.
[2023-03-23 21:33:22] [INFO ] Deduced a trap composed of 164 places in 249 ms of which 0 ms to minimize.
[2023-03-23 21:33:23] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 1 ms to minimize.
[2023-03-23 21:33:23] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 1 ms to minimize.
[2023-03-23 21:33:23] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 1 ms to minimize.
[2023-03-23 21:33:24] [INFO ] Deduced a trap composed of 158 places in 265 ms of which 1 ms to minimize.
[2023-03-23 21:33:24] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 1 ms to minimize.
[2023-03-23 21:33:24] [INFO ] Deduced a trap composed of 162 places in 248 ms of which 0 ms to minimize.
[2023-03-23 21:33:25] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 1 ms to minimize.
[2023-03-23 21:33:25] [INFO ] Deduced a trap composed of 168 places in 256 ms of which 8 ms to minimize.
[2023-03-23 21:33:25] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 1 ms to minimize.
[2023-03-23 21:33:25] [INFO ] Deduced a trap composed of 164 places in 257 ms of which 1 ms to minimize.
[2023-03-23 21:33:26] [INFO ] Deduced a trap composed of 176 places in 252 ms of which 0 ms to minimize.
[2023-03-23 21:33:26] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:33:27] [INFO ] Deduced a trap composed of 168 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:33:27] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 1 ms to minimize.
[2023-03-23 21:33:27] [INFO ] Deduced a trap composed of 162 places in 257 ms of which 1 ms to minimize.
[2023-03-23 21:33:28] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 1 ms to minimize.
[2023-03-23 21:33:28] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 0 ms to minimize.
[2023-03-23 21:33:28] [INFO ] Deduced a trap composed of 160 places in 251 ms of which 1 ms to minimize.
[2023-03-23 21:33:28] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 1 ms to minimize.
[2023-03-23 21:33:29] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:33:29] [INFO ] Deduced a trap composed of 158 places in 259 ms of which 0 ms to minimize.
[2023-03-23 21:33:30] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 0 ms to minimize.
[2023-03-23 21:33:30] [INFO ] Deduced a trap composed of 158 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:33:30] [INFO ] Deduced a trap composed of 158 places in 254 ms of which 2 ms to minimize.
[2023-03-23 21:33:30] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 1 ms to minimize.
[2023-03-23 21:33:31] [INFO ] Deduced a trap composed of 156 places in 254 ms of which 1 ms to minimize.
[2023-03-23 21:33:31] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 1 ms to minimize.
[2023-03-23 21:33:32] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 0 ms to minimize.
[2023-03-23 21:33:33] [INFO ] Deduced a trap composed of 175 places in 258 ms of which 1 ms to minimize.
[2023-03-23 21:33:34] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 4 ms to minimize.
[2023-03-23 21:33:35] [INFO ] Deduced a trap composed of 170 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:33:35] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 0 ms to minimize.
[2023-03-23 21:33:35] [INFO ] Deduced a trap composed of 164 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:33:36] [INFO ] Deduced a trap composed of 177 places in 258 ms of which 0 ms to minimize.
[2023-03-23 21:33:36] [INFO ] Deduced a trap composed of 164 places in 276 ms of which 1 ms to minimize.
[2023-03-23 21:33:37] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 1 ms to minimize.
[2023-03-23 21:33:37] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:33:40] [INFO ] Deduced a trap composed of 171 places in 249 ms of which 0 ms to minimize.
[2023-03-23 21:33:40] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 2 ms to minimize.
[2023-03-23 21:33:40] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 0 ms to minimize.
[2023-03-23 21:33:41] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 2 ms to minimize.
[2023-03-23 21:33:41] [INFO ] Deduced a trap composed of 158 places in 252 ms of which 2 ms to minimize.
[2023-03-23 21:33:41] [INFO ] Deduced a trap composed of 160 places in 258 ms of which 1 ms to minimize.
[2023-03-23 21:33:42] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 0 ms to minimize.
[2023-03-23 21:33:42] [INFO ] Deduced a trap composed of 166 places in 262 ms of which 1 ms to minimize.
[2023-03-23 21:33:43] [INFO ] Deduced a trap composed of 169 places in 258 ms of which 0 ms to minimize.
[2023-03-23 21:33:43] [INFO ] Deduced a trap composed of 171 places in 255 ms of which 0 ms to minimize.
[2023-03-23 21:33:43] [INFO ] Deduced a trap composed of 154 places in 252 ms of which 1 ms to minimize.
[2023-03-23 21:33:44] [INFO ] Deduced a trap composed of 164 places in 264 ms of which 0 ms to minimize.
[2023-03-23 21:33:44] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 1 ms to minimize.
[2023-03-23 21:33:44] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 1 ms to minimize.
[2023-03-23 21:33:45] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 1 ms to minimize.
[2023-03-23 21:33:45] [INFO ] Deduced a trap composed of 156 places in 252 ms of which 0 ms to minimize.
[2023-03-23 21:33:45] [INFO ] Deduced a trap composed of 156 places in 252 ms of which 1 ms to minimize.
[2023-03-23 21:33:46] [INFO ] Deduced a trap composed of 162 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:33:46] [INFO ] Deduced a trap composed of 166 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:33:46] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 1 ms to minimize.
[2023-03-23 21:33:47] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 0 ms to minimize.
[2023-03-23 21:33:47] [INFO ] Deduced a trap composed of 152 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:33:48] [INFO ] Deduced a trap composed of 170 places in 247 ms of which 1 ms to minimize.
[2023-03-23 21:33:48] [INFO ] Deduced a trap composed of 166 places in 253 ms of which 1 ms to minimize.
[2023-03-23 21:33:48] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 0 ms to minimize.
[2023-03-23 21:33:49] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 1 ms to minimize.
[2023-03-23 21:33:49] [INFO ] Deduced a trap composed of 168 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:33:50] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 1 ms to minimize.
[2023-03-23 21:33:50] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 2 ms to minimize.
[2023-03-23 21:33:51] [INFO ] Deduced a trap composed of 162 places in 260 ms of which 1 ms to minimize.
[2023-03-23 21:33:51] [INFO ] Deduced a trap composed of 158 places in 250 ms of which 0 ms to minimize.
[2023-03-23 21:33:54] [INFO ] Deduced a trap composed of 160 places in 255 ms of which 1 ms to minimize.
[2023-03-23 21:33:54] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 0 ms to minimize.
[2023-03-23 21:33:55] [INFO ] Deduced a trap composed of 160 places in 249 ms of which 0 ms to minimize.
[2023-03-23 21:33:55] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 0 ms to minimize.
[2023-03-23 21:33:55] [INFO ] Deduced a trap composed of 173 places in 252 ms of which 1 ms to minimize.
[2023-03-23 21:33:56] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 1 ms to minimize.
[2023-03-23 21:33:56] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 0 ms to minimize.
[2023-03-23 21:33:56] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 0 ms to minimize.
[2023-03-23 21:33:57] [INFO ] Deduced a trap composed of 177 places in 250 ms of which 0 ms to minimize.
[2023-03-23 21:33:57] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 0 ms to minimize.
[2023-03-23 21:33:58] [INFO ] Deduced a trap composed of 168 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:33:58] [INFO ] Deduced a trap composed of 158 places in 269 ms of which 1 ms to minimize.
[2023-03-23 21:33:59] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 0 ms to minimize.
[2023-03-23 21:33:59] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:33:59] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 0 ms to minimize.
[2023-03-23 21:33:59] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:34:00] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 0 ms to minimize.
[2023-03-23 21:34:00] [INFO ] Deduced a trap composed of 173 places in 248 ms of which 1 ms to minimize.
[2023-03-23 21:34:00] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 1 ms to minimize.
[2023-03-23 21:34:01] [INFO ] Deduced a trap composed of 175 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:34:02] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:34:02] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 0 ms to minimize.
[2023-03-23 21:34:03] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 0 ms to minimize.
[2023-03-23 21:34:03] [INFO ] Deduced a trap composed of 162 places in 235 ms of which 0 ms to minimize.
[2023-03-23 21:34:04] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 1 ms to minimize.
[2023-03-23 21:34:04] [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: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)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 22 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 20 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-23 21:34:04] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 21:34:04] [INFO ] Invariant cache hit.
[2023-03-23 21:34:04] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-23 21:34:04] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 21:34:04] [INFO ] Invariant cache hit.
[2023-03-23 21:34:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:34:06] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2384 ms to find 0 implicit places.
[2023-03-23 21:34:06] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-23 21:34:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 21:34:06] [INFO ] Invariant cache hit.
[2023-03-23 21:34:07] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2945 ms. Remains : 410/410 places, 981/981 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-08
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 21:34:07] [INFO ] Computed 62 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 699 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2023-03-23 21:34:07] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 21:34:07] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-23 21:34:07] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2023-03-23 21:34:07] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 21:34:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:34:07] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2023-03-23 21:34:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:34:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-23 21:34:07] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 21:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:34:08] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-23 21:34:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:34:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 109 ms returned sat
[2023-03-23 21:34:08] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 1 ms to minimize.
[2023-03-23 21:34:08] [INFO ] Deduced a trap composed of 158 places in 250 ms of which 0 ms to minimize.
[2023-03-23 21:34:09] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:34:09] [INFO ] Deduced a trap composed of 152 places in 240 ms of which 1 ms to minimize.
[2023-03-23 21:34:09] [INFO ] Deduced a trap composed of 152 places in 254 ms of which 0 ms to minimize.
[2023-03-23 21:34:09] [INFO ] Deduced a trap composed of 164 places in 264 ms of which 0 ms to minimize.
[2023-03-23 21:34:10] [INFO ] Deduced a trap composed of 162 places in 259 ms of which 0 ms to minimize.
[2023-03-23 21:34:10] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 1 ms to minimize.
[2023-03-23 21:34:10] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:34:11] [INFO ] Deduced a trap composed of 160 places in 254 ms of which 0 ms to minimize.
[2023-03-23 21:34:11] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 1 ms to minimize.
[2023-03-23 21:34:11] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 1 ms to minimize.
[2023-03-23 21:34:11] [INFO ] Deduced a trap composed of 162 places in 244 ms of which 0 ms to minimize.
[2023-03-23 21:34:12] [INFO ] Deduced a trap composed of 156 places in 244 ms of which 1 ms to minimize.
[2023-03-23 21:34:12] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 1 ms to minimize.
[2023-03-23 21:34:12] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 0 ms to minimize.
[2023-03-23 21:34:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-23 21:34:12] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 21:34:12] [INFO ] Invariant cache hit.
[2023-03-23 21:34:13] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 542 ms. Remains : 410/410 places, 981/981 transitions.
Normalized transition count is 972 out of 981 initially.
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 21:34:13] [INFO ] Computed 62 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 72759 resets, run finished after 10568 ms. (steps per millisecond=94 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9677 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 1) seen :3
[2023-03-23 21:34:25] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-23 21:34:25] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-23 21:34:26] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-23 21:34:26] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 21:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:34:26] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-23 21:34:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:34:26] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2023-03-23 21:34:26] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-23 21:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:34:26] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2023-03-23 21:34:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:34:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 104 ms returned sat
[2023-03-23 21:34:26] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 0 ms to minimize.
[2023-03-23 21:34:27] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 0 ms to minimize.
[2023-03-23 21:34:27] [INFO ] Deduced a trap composed of 162 places in 239 ms of which 1 ms to minimize.
[2023-03-23 21:34:27] [INFO ] Deduced a trap composed of 152 places in 238 ms of which 1 ms to minimize.
[2023-03-23 21:34:28] [INFO ] Deduced a trap composed of 152 places in 238 ms of which 0 ms to minimize.
[2023-03-23 21:34:28] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 1 ms to minimize.
[2023-03-23 21:34:28] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 2 ms to minimize.
[2023-03-23 21:34:28] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 1 ms to minimize.
[2023-03-23 21:34:29] [INFO ] Deduced a trap composed of 162 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:34:29] [INFO ] Deduced a trap composed of 160 places in 254 ms of which 0 ms to minimize.
[2023-03-23 21:34:29] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 1 ms to minimize.
[2023-03-23 21:34:30] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 1 ms to minimize.
[2023-03-23 21:34:30] [INFO ] Deduced a trap composed of 162 places in 243 ms of which 0 ms to minimize.
[2023-03-23 21:34:30] [INFO ] Deduced a trap composed of 156 places in 245 ms of which 0 ms to minimize.
[2023-03-23 21:34:30] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 0 ms to minimize.
[2023-03-23 21:34:31] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 1 ms to minimize.
[2023-03-23 21:34:31] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 0 ms to minimize.
[2023-03-23 21:34:31] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 0 ms to minimize.
[2023-03-23 21:34:32] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 0 ms to minimize.
[2023-03-23 21:34:32] [INFO ] Deduced a trap composed of 168 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:34:32] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 0 ms to minimize.
[2023-03-23 21:34:33] [INFO ] Deduced a trap composed of 164 places in 254 ms of which 1 ms to minimize.
[2023-03-23 21:34:33] [INFO ] Deduced a trap composed of 176 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:34:33] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 0 ms to minimize.
[2023-03-23 21:34:34] [INFO ] Deduced a trap composed of 168 places in 248 ms of which 0 ms to minimize.
[2023-03-23 21:34:34] [INFO ] Deduced a trap composed of 164 places in 257 ms of which 1 ms to minimize.
[2023-03-23 21:34:34] [INFO ] Deduced a trap composed of 162 places in 252 ms of which 0 ms to minimize.
[2023-03-23 21:34:35] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:34:35] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 1 ms to minimize.
[2023-03-23 21:34:35] [INFO ] Deduced a trap composed of 160 places in 251 ms of which 0 ms to minimize.
[2023-03-23 21:34:35] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:34:36] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 0 ms to minimize.
[2023-03-23 21:34:36] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 0 ms to minimize.
[2023-03-23 21:34:37] [INFO ] Deduced a trap composed of 164 places in 253 ms of which 1 ms to minimize.
[2023-03-23 21:34:37] [INFO ] Deduced a trap composed of 158 places in 252 ms of which 0 ms to minimize.
[2023-03-23 21:34:37] [INFO ] Deduced a trap composed of 158 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:34:37] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 1 ms to minimize.
[2023-03-23 21:34:38] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:34:38] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 1 ms to minimize.
[2023-03-23 21:34:39] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 1 ms to minimize.
[2023-03-23 21:34:40] [INFO ] Deduced a trap composed of 175 places in 260 ms of which 0 ms to minimize.
[2023-03-23 21:34:41] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 1 ms to minimize.
[2023-03-23 21:34:42] [INFO ] Deduced a trap composed of 170 places in 248 ms of which 1 ms to minimize.
[2023-03-23 21:34:42] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 1 ms to minimize.
[2023-03-23 21:34:42] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:34:43] [INFO ] Deduced a trap composed of 177 places in 253 ms of which 0 ms to minimize.
[2023-03-23 21:34:43] [INFO ] Deduced a trap composed of 164 places in 249 ms of which 0 ms to minimize.
[2023-03-23 21:34:44] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:34:44] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 1 ms to minimize.
[2023-03-23 21:34:47] [INFO ] Deduced a trap composed of 171 places in 255 ms of which 0 ms to minimize.
[2023-03-23 21:34:47] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 0 ms to minimize.
[2023-03-23 21:34:47] [INFO ] Deduced a trap composed of 166 places in 247 ms of which 1 ms to minimize.
[2023-03-23 21:34:48] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 1 ms to minimize.
[2023-03-23 21:34:48] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 0 ms to minimize.
[2023-03-23 21:34:48] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 0 ms to minimize.
[2023-03-23 21:34:49] [INFO ] Deduced a trap composed of 164 places in 249 ms of which 0 ms to minimize.
[2023-03-23 21:34:49] [INFO ] Deduced a trap composed of 166 places in 251 ms of which 0 ms to minimize.
[2023-03-23 21:34:49] [INFO ] Deduced a trap composed of 169 places in 244 ms of which 1 ms to minimize.
[2023-03-23 21:34:50] [INFO ] Deduced a trap composed of 171 places in 242 ms of which 0 ms to minimize.
[2023-03-23 21:34:50] [INFO ] Deduced a trap composed of 154 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:34:50] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 1 ms to minimize.
[2023-03-23 21:34:51] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 1 ms to minimize.
[2023-03-23 21:34:51] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 0 ms to minimize.
[2023-03-23 21:34:51] [INFO ] Deduced a trap composed of 162 places in 254 ms of which 1 ms to minimize.
[2023-03-23 21:34:52] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:34:52] [INFO ] Deduced a trap composed of 156 places in 238 ms of which 0 ms to minimize.
[2023-03-23 21:34:53] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 0 ms to minimize.
[2023-03-23 21:34:53] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 0 ms to minimize.
[2023-03-23 21:34:53] [INFO ] Deduced a trap composed of 160 places in 249 ms of which 0 ms to minimize.
[2023-03-23 21:34:54] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 0 ms to minimize.
[2023-03-23 21:34:54] [INFO ] Deduced a trap composed of 152 places in 253 ms of which 0 ms to minimize.
[2023-03-23 21:34:54] [INFO ] Deduced a trap composed of 170 places in 259 ms of which 0 ms to minimize.
[2023-03-23 21:34:55] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 0 ms to minimize.
[2023-03-23 21:34:55] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 0 ms to minimize.
[2023-03-23 21:34:56] [INFO ] Deduced a trap composed of 166 places in 252 ms of which 1 ms to minimize.
[2023-03-23 21:34:56] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 0 ms to minimize.
[2023-03-23 21:34:56] [INFO ] Deduced a trap composed of 160 places in 242 ms of which 0 ms to minimize.
[2023-03-23 21:34:57] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 0 ms to minimize.
[2023-03-23 21:34:57] [INFO ] Deduced a trap composed of 162 places in 260 ms of which 1 ms to minimize.
[2023-03-23 21:34:58] [INFO ] Deduced a trap composed of 158 places in 265 ms of which 1 ms to minimize.
[2023-03-23 21:35:00] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 0 ms to minimize.
[2023-03-23 21:35:01] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 1 ms to minimize.
[2023-03-23 21:35:01] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 0 ms to minimize.
[2023-03-23 21:35:02] [INFO ] Deduced a trap composed of 166 places in 240 ms of which 1 ms to minimize.
[2023-03-23 21:35:02] [INFO ] Deduced a trap composed of 173 places in 248 ms of which 0 ms to minimize.
[2023-03-23 21:35:02] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 1 ms to minimize.
[2023-03-23 21:35:03] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 1 ms to minimize.
[2023-03-23 21:35:03] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 1 ms to minimize.
[2023-03-23 21:35:04] [INFO ] Deduced a trap composed of 177 places in 236 ms of which 1 ms to minimize.
[2023-03-23 21:35:04] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 1 ms to minimize.
[2023-03-23 21:35:04] [INFO ] Deduced a trap composed of 168 places in 243 ms of which 1 ms to minimize.
[2023-03-23 21:35:05] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 0 ms to minimize.
[2023-03-23 21:35:05] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 1 ms to minimize.
[2023-03-23 21:35:05] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 0 ms to minimize.
[2023-03-23 21:35:06] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 1 ms to minimize.
[2023-03-23 21:35:06] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 1 ms to minimize.
[2023-03-23 21:35:06] [INFO ] Deduced a trap composed of 158 places in 245 ms of which 1 ms to minimize.
[2023-03-23 21:35:07] [INFO ] Deduced a trap composed of 173 places in 249 ms of which 1 ms to minimize.
[2023-03-23 21:35:07] [INFO ] Deduced a trap composed of 166 places in 243 ms of which 1 ms to minimize.
[2023-03-23 21:35:08] [INFO ] Deduced a trap composed of 175 places in 246 ms of which 1 ms to minimize.
[2023-03-23 21:35:09] [INFO ] Deduced a trap composed of 166 places in 242 ms of which 1 ms to minimize.
[2023-03-23 21:35:09] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 0 ms to minimize.
[2023-03-23 21:35:10] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 1 ms to minimize.
[2023-03-23 21:35:10] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 0 ms to minimize.
[2023-03-23 21:35:11] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 1 ms to minimize.
[2023-03-23 21:35:11] [INFO ] Trap strengthening (SAT) tested/added 105/105 trap constraints in 44582 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-23 21:35:11] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 21:35:11] [INFO ] Invariant cache hit.
[2023-03-23 21:35:11] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-23 21:35:11] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 21:35:11] [INFO ] Invariant cache hit.
[2023-03-23 21:35:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:35:13] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
[2023-03-23 21:35:13] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-23 21:35:13] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-23 21:35:13] [INFO ] Invariant cache hit.
[2023-03-23 21:35:14] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2943 ms. Remains : 410/410 places, 981/981 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-08 in 66876 ms.
[2023-03-23 21:35:14] [INFO ] Flatten gal took : 159 ms
[2023-03-23 21:35:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-23 21:35:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 410 places, 981 transitions and 6619 arcs took 8 ms.
Total runtime 142406 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1373/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14941148 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093236 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
mcc2023
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-S10J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-COL-S10J20, 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 r297-tall-167873950800677"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 '
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 ;