Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460800266.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717129466461

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J60
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 04:24:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 04:24:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:24:28] [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.
[2024-05-31 04:24:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 04:24:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 484 ms
[2024-05-31 04:24:28] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-31 04:24:28] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-31 04:24:28] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 04:24:28] [INFO ] Computed 13 invariants in 8 ms
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 04:24:28] [INFO ] Invariant cache hit.
[2024-05-31 04:24:28] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 04:24:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:28] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 04:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 04:24:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:24:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
[2024-05-31 04:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-31 04:24:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:24:29] [INFO ] Added : 10 causal constraints over 2 iterations in 308 ms. Result :sat
Minimization took 57 ms.
[2024-05-31 04:24:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 04:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:29] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:24:29] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 04:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-31 04:24:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:24:29] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-31 04:24:29] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-31 04:24:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2024-05-31 04:24:29] [INFO ] Added : 36 causal constraints over 8 iterations in 227 ms. Result :sat
Minimization took 96 ms.
[2024-05-31 04:24:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 04:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 04:24:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-31 04:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-31 04:24:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:24:30] [INFO ] Added : 36 causal constraints over 8 iterations in 158 ms. Result :sat
Minimization took 20 ms.
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 04:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 04:24:30] [INFO ] Added : 3 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 04:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:30] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-31 04:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-31 04:24:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:24:30] [INFO ] Added : 20 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 88 ms.
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 04:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 04:24:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:24:31] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-31 04:24:31] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-31 04:24:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2024-05-31 04:24:31] [INFO ] Added : 36 causal constraints over 8 iterations in 202 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 04:24:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 04:24:31] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 04:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-31 04:24:31] [INFO ] Added : 22 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 18 ms.
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 04:24:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 04:24:31] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:31] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 04:24:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:31] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 04:24:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 04:24:31] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-31 04:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-31 04:24:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:24:32] [INFO ] Added : 19 causal constraints over 4 iterations in 363 ms. Result :sat
Minimization took 115 ms.
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 04:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:32] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-31 04:24:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-31 04:24:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:24:32] [INFO ] Added : 21 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 73 ms.
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 04:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:24:32] [INFO ] Added : 36 causal constraints over 8 iterations in 124 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:32] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 04:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 04:24:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:24:33] [INFO ] Added : 21 causal constraints over 5 iterations in 421 ms. Result :sat
Minimization took 212 ms.
[2024-05-31 04:24:33] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 04:24:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 04:24:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:24:33] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:33] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-31 04:24:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-31 04:24:33] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:24:33] [INFO ] Added : 33 causal constraints over 7 iterations in 124 ms. Result :sat
Minimization took 51 ms.
[2024-05-31 04:24:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:33] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2024-05-31 04:24:34] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:24:34] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 04:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 04:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:24:34] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 04:24:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:24:34] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-31 04:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 04:24:34] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:24:34] [INFO ] Added : 14 causal constraints over 4 iterations in 301 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : [10, 10, -1, -1, 4, 1, 3, -1, 10, 10, -1, 10, 10, 1, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 04:24:34] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 281 ms.
[2024-05-31 04:24:34] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 40 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 558 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 14) seen :28
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :27
FORMULA PolyORBNT-COL-S10J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :1
[2024-05-31 04:24:36] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-31 04:24:36] [INFO ] Computed 152 invariants in 244 ms
[2024-05-31 04:24:36] [INFO ] [Real]Absence check using 145 positive place invariants in 49 ms returned sat
[2024-05-31 04:24:36] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2024-05-31 04:24:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:37] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2024-05-31 04:24:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:38] [INFO ] [Nat]Absence check using 145 positive place invariants in 53 ms returned sat
[2024-05-31 04:24:38] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 35 ms returned sat
[2024-05-31 04:24:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:40] [INFO ] [Nat]Absence check using state equation in 2641 ms returned sat
[2024-05-31 04:24:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:24:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 296 ms returned sat
[2024-05-31 04:24:41] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 385 ms.
[2024-05-31 04:24:42] [INFO ] Added : 6 causal constraints over 2 iterations in 1009 ms. Result :sat
Minimization took 646 ms.
[2024-05-31 04:24:43] [INFO ] [Real]Absence check using 145 positive place invariants in 57 ms returned sat
[2024-05-31 04:24:43] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned sat
[2024-05-31 04:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:44] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2024-05-31 04:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:44] [INFO ] [Nat]Absence check using 145 positive place invariants in 40 ms returned sat
[2024-05-31 04:24:44] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 04:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:49] [INFO ] [Nat]Absence check using state equation in 4766 ms returned unknown
[2024-05-31 04:24:49] [INFO ] [Real]Absence check using 145 positive place invariants in 80 ms returned sat
[2024-05-31 04:24:49] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned unsat
[2024-05-31 04:24:49] [INFO ] [Real]Absence check using 145 positive place invariants in 46 ms returned sat
[2024-05-31 04:24:49] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 23 ms returned unsat
[2024-05-31 04:24:50] [INFO ] [Real]Absence check using 145 positive place invariants in 47 ms returned sat
[2024-05-31 04:24:50] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 40 ms returned unsat
[2024-05-31 04:24:50] [INFO ] [Real]Absence check using 145 positive place invariants in 47 ms returned sat
[2024-05-31 04:24:50] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned unsat
[2024-05-31 04:24:50] [INFO ] [Real]Absence check using 145 positive place invariants in 56 ms returned sat
[2024-05-31 04:24:50] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 35 ms returned sat
[2024-05-31 04:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:51] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2024-05-31 04:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:51] [INFO ] [Nat]Absence check using 145 positive place invariants in 40 ms returned sat
[2024-05-31 04:24:51] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-31 04:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:54] [INFO ] [Nat]Absence check using state equation in 2194 ms returned sat
[2024-05-31 04:24:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 403 ms returned sat
[2024-05-31 04:24:55] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 606 ms.
[2024-05-31 04:24:56] [INFO ] Deduced a trap composed of 327 places in 880 ms of which 2 ms to minimize.
[2024-05-31 04:24:56] [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 6
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 04:24:57] [INFO ] [Real]Absence check using 145 positive place invariants in 35 ms returned sat
[2024-05-31 04:24:57] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 22 ms returned unsat
[2024-05-31 04:24:57] [INFO ] [Real]Absence check using 145 positive place invariants in 46 ms returned sat
[2024-05-31 04:24:57] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 24 ms returned unsat
[2024-05-31 04:24:57] [INFO ] [Real]Absence check using 145 positive place invariants in 45 ms returned sat
[2024-05-31 04:24:57] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-31 04:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:24:58] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2024-05-31 04:24:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:24:58] [INFO ] [Nat]Absence check using 145 positive place invariants in 49 ms returned sat
[2024-05-31 04:24:58] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 04:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:25:03] [INFO ] [Nat]Absence check using state equation in 4434 ms returned unsat
[2024-05-31 04:25:03] [INFO ] [Real]Absence check using 145 positive place invariants in 48 ms returned sat
[2024-05-31 04:25:03] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 36 ms returned sat
[2024-05-31 04:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:25:04] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2024-05-31 04:25:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:25:04] [INFO ] [Nat]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-31 04:25:04] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 35 ms returned sat
[2024-05-31 04:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:25:06] [INFO ] [Nat]Absence check using state equation in 1553 ms returned sat
[2024-05-31 04:25:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1110 ms returned sat
[2024-05-31 04:25:07] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 330 ms.
[2024-05-31 04:25:10] [INFO ] Deduced a trap composed of 629 places in 939 ms of which 3 ms to minimize.
[2024-05-31 04:25:10] [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 10
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10, 10, 1, 1, 1, 4, 10, 1, 4, 4, 10] Max seen :[3, 4, 1, 1, 1, 4, 2, 1, 4, 4, 3]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 64 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 1224 transition count 2745
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 141 place count 1159 transition count 2744
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 1158 transition count 2744
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 142 place count 1158 transition count 2680
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 270 place count 1094 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 271 place count 1093 transition count 2679
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 1093 transition count 2679
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 3 with 4 rules applied. Total rules applied 276 place count 1091 transition count 2677
Applied a total of 276 rules in 530 ms. Remains 1091 /1234 variables (removed 143) and now considering 2677/2810 (removed 133) transitions.
[2024-05-31 04:25:10] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
// Phase 1: matrix 2668 rows 1091 cols
[2024-05-31 04:25:10] [INFO ] Computed 142 invariants in 123 ms
[2024-05-31 04:25:12] [INFO ] Dead Transitions using invariants and state equation in 1532 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 : 1091/1234 places, 2062/2810 transitions.
Applied a total of 0 rules in 72 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2136 ms. Remains : 1091/1234 places, 2062/2810 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:25:12] [INFO ] Computed 142 invariants in 51 ms
Incomplete random walk after 1000000 steps, including 70385 resets, run finished after 10575 ms. (steps per millisecond=94 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 1000001 steps, including 6076 resets, run finished after 2561 ms. (steps per millisecond=390 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 1000000 steps, including 6108 resets, run finished after 1850 ms. (steps per millisecond=540 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 1000001 steps, including 7284 resets, run finished after 1951 ms. (steps per millisecond=512 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 1000001 steps, including 7035 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 4) seen :12
[2024-05-31 04:25:31] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:25:31] [INFO ] Computed 142 invariants in 107 ms
[2024-05-31 04:25:31] [INFO ] [Real]Absence check using 135 positive place invariants in 58 ms returned sat
[2024-05-31 04:25:31] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 13 ms returned unsat
[2024-05-31 04:25:31] [INFO ] [Real]Absence check using 135 positive place invariants in 40 ms returned sat
[2024-05-31 04:25:31] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 04:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:25:32] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2024-05-31 04:25:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:25:32] [INFO ] [Nat]Absence check using 135 positive place invariants in 42 ms returned sat
[2024-05-31 04:25:32] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 04:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:25:39] [INFO ] [Nat]Absence check using state equation in 6758 ms returned unknown
[2024-05-31 04:25:39] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 04:25:39] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-31 04:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:25:40] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-05-31 04:25:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:25:40] [INFO ] [Nat]Absence check using 135 positive place invariants in 42 ms returned sat
[2024-05-31 04:25:40] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 04:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:25:41] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2024-05-31 04:25:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:25:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 882 ms returned sat
[2024-05-31 04:25:42] [INFO ] Deduced a trap composed of 444 places in 557 ms of which 2 ms to minimize.
[2024-05-31 04:25:43] [INFO ] Deduced a trap composed of 450 places in 619 ms of which 2 ms to minimize.
[2024-05-31 04:25:43] [INFO ] Deduced a trap composed of 438 places in 593 ms of which 2 ms to minimize.
[2024-05-31 04:25:44] [INFO ] Deduced a trap composed of 442 places in 543 ms of which 1 ms to minimize.
[2024-05-31 04:25:45] [INFO ] Deduced a trap composed of 454 places in 474 ms of which 1 ms to minimize.
[2024-05-31 04:25:45] [INFO ] Deduced a trap composed of 452 places in 463 ms of which 1 ms to minimize.
[2024-05-31 04:25:46] [INFO ] Deduced a trap composed of 438 places in 510 ms of which 1 ms to minimize.
[2024-05-31 04:25:46] [INFO ] Deduced a trap composed of 442 places in 511 ms of which 1 ms to minimize.
[2024-05-31 04:25:47] [INFO ] Deduced a trap composed of 444 places in 535 ms of which 1 ms to minimize.
[2024-05-31 04:25:48] [INFO ] Deduced a trap composed of 454 places in 615 ms of which 2 ms to minimize.
[2024-05-31 04:25:49] [INFO ] Deduced a trap composed of 438 places in 615 ms of which 1 ms to minimize.
[2024-05-31 04:25:49] [INFO ] Deduced a trap composed of 438 places in 572 ms of which 1 ms to minimize.
[2024-05-31 04:25:50] [INFO ] Deduced a trap composed of 442 places in 597 ms of which 1 ms to minimize.
[2024-05-31 04:25:51] [INFO ] Deduced a trap composed of 452 places in 619 ms of which 1 ms to minimize.
[2024-05-31 04:25:52] [INFO ] Deduced a trap composed of 436 places in 633 ms of which 1 ms to minimize.
[2024-05-31 04:25:52] [INFO ] Deduced a trap composed of 436 places in 622 ms of which 1 ms to minimize.
[2024-05-31 04:25:53] [INFO ] Deduced a trap composed of 446 places in 617 ms of which 2 ms to minimize.
[2024-05-31 04:25:54] [INFO ] Deduced a trap composed of 454 places in 627 ms of which 1 ms to minimize.
[2024-05-31 04:25:54] [INFO ] Deduced a trap composed of 452 places in 636 ms of which 1 ms to minimize.
[2024-05-31 04:25:55] [INFO ] Deduced a trap composed of 434 places in 608 ms of which 2 ms to minimize.
[2024-05-31 04:25:56] [INFO ] Deduced a trap composed of 448 places in 636 ms of which 3 ms to minimize.
[2024-05-31 04:25:57] [INFO ] Deduced a trap composed of 442 places in 611 ms of which 1 ms to minimize.
[2024-05-31 04:25:58] [INFO ] Deduced a trap composed of 432 places in 570 ms of which 1 ms to minimize.
[2024-05-31 04:25:59] [INFO ] Deduced a trap composed of 456 places in 536 ms of which 1 ms to minimize.
[2024-05-31 04:26:00] [INFO ] Deduced a trap composed of 438 places in 613 ms of which 2 ms to minimize.
[2024-05-31 04:26:01] [INFO ] Deduced a trap composed of 446 places in 568 ms of which 1 ms to minimize.
[2024-05-31 04:26:01] [INFO ] Deduced a trap composed of 446 places in 628 ms of which 1 ms to minimize.
[2024-05-31 04:26:02] [INFO ] Deduced a trap composed of 436 places in 592 ms of which 1 ms to minimize.
[2024-05-31 04:26:03] [INFO ] Deduced a trap composed of 444 places in 616 ms of which 1 ms to minimize.
[2024-05-31 04:26:04] [INFO ] Deduced a trap composed of 446 places in 628 ms of which 1 ms to minimize.
[2024-05-31 04:26:05] [INFO ] Deduced a trap composed of 446 places in 623 ms of which 1 ms to minimize.
[2024-05-31 04:26:06] [INFO ] Deduced a trap composed of 436 places in 623 ms of which 2 ms to minimize.
[2024-05-31 04:26:07] [INFO ] Deduced a trap composed of 436 places in 592 ms of which 2 ms to minimize.
[2024-05-31 04:26:08] [INFO ] Deduced a trap composed of 442 places in 623 ms of which 2 ms to minimize.
[2024-05-31 04:26:09] [INFO ] Deduced a trap composed of 432 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:26:10] [INFO ] Deduced a trap composed of 456 places in 635 ms of which 1 ms to minimize.
[2024-05-31 04:26:10] [INFO ] Deduced a trap composed of 450 places in 627 ms of which 2 ms to minimize.
[2024-05-31 04:26:11] [INFO ] Deduced a trap composed of 438 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:26:12] [INFO ] Deduced a trap composed of 442 places in 629 ms of which 1 ms to minimize.
[2024-05-31 04:26:13] [INFO ] Deduced a trap composed of 448 places in 619 ms of which 1 ms to minimize.
[2024-05-31 04:26:13] [INFO ] Deduced a trap composed of 444 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:26:14] [INFO ] Deduced a trap composed of 430 places in 631 ms of which 4 ms to minimize.
[2024-05-31 04:26:15] [INFO ] Deduced a trap composed of 440 places in 626 ms of which 1 ms to minimize.
[2024-05-31 04:26:16] [INFO ] Deduced a trap composed of 438 places in 637 ms of which 1 ms to minimize.
[2024-05-31 04:26:16] [INFO ] Deduced a trap composed of 440 places in 582 ms of which 1 ms to minimize.
[2024-05-31 04:26:17] [INFO ] Deduced a trap composed of 434 places in 596 ms of which 1 ms to minimize.
[2024-05-31 04:26:19] [INFO ] Deduced a trap composed of 440 places in 620 ms of which 2 ms to minimize.
[2024-05-31 04:26:19] [INFO ] Deduced a trap composed of 444 places in 631 ms of which 1 ms to minimize.
[2024-05-31 04:26:20] [INFO ] Deduced a trap composed of 440 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:26:21] [INFO ] Deduced a trap composed of 440 places in 583 ms of which 1 ms to minimize.
[2024-05-31 04:26:22] [INFO ] Deduced a trap composed of 440 places in 572 ms of which 1 ms to minimize.
[2024-05-31 04:26:24] [INFO ] Deduced a trap composed of 432 places in 592 ms of which 3 ms to minimize.
[2024-05-31 04:26:25] [INFO ] Deduced a trap composed of 442 places in 586 ms of which 2 ms to minimize.
[2024-05-31 04:26:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 04:26:26] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 04:26:26] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-31 04:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:26:26] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2024-05-31 04:26:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:26:26] [INFO ] [Nat]Absence check using 135 positive place invariants in 30 ms returned sat
[2024-05-31 04:26:26] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 04:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:26:27] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2024-05-31 04:26:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 626 ms returned sat
[2024-05-31 04:26:28] [INFO ] Deduced a trap composed of 442 places in 634 ms of which 1 ms to minimize.
[2024-05-31 04:26:29] [INFO ] Deduced a trap composed of 434 places in 621 ms of which 5 ms to minimize.
[2024-05-31 04:26:30] [INFO ] Deduced a trap composed of 438 places in 622 ms of which 1 ms to minimize.
[2024-05-31 04:26:30] [INFO ] Deduced a trap composed of 434 places in 609 ms of which 1 ms to minimize.
[2024-05-31 04:26:31] [INFO ] Deduced a trap composed of 438 places in 577 ms of which 1 ms to minimize.
[2024-05-31 04:26:32] [INFO ] Deduced a trap composed of 436 places in 547 ms of which 1 ms to minimize.
[2024-05-31 04:26:32] [INFO ] Deduced a trap composed of 444 places in 550 ms of which 1 ms to minimize.
[2024-05-31 04:26:33] [INFO ] Deduced a trap composed of 436 places in 551 ms of which 1 ms to minimize.
[2024-05-31 04:26:34] [INFO ] Deduced a trap composed of 450 places in 620 ms of which 1 ms to minimize.
[2024-05-31 04:26:35] [INFO ] Deduced a trap composed of 438 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:26:35] [INFO ] Deduced a trap composed of 444 places in 581 ms of which 1 ms to minimize.
[2024-05-31 04:26:36] [INFO ] Deduced a trap composed of 438 places in 607 ms of which 1 ms to minimize.
[2024-05-31 04:26:37] [INFO ] Deduced a trap composed of 448 places in 620 ms of which 1 ms to minimize.
[2024-05-31 04:26:37] [INFO ] Deduced a trap composed of 450 places in 627 ms of which 1 ms to minimize.
[2024-05-31 04:26:38] [INFO ] Deduced a trap composed of 442 places in 630 ms of which 1 ms to minimize.
[2024-05-31 04:26:39] [INFO ] Deduced a trap composed of 440 places in 612 ms of which 1 ms to minimize.
[2024-05-31 04:26:40] [INFO ] Deduced a trap composed of 450 places in 608 ms of which 1 ms to minimize.
[2024-05-31 04:26:41] [INFO ] Deduced a trap composed of 436 places in 564 ms of which 1 ms to minimize.
[2024-05-31 04:26:42] [INFO ] Deduced a trap composed of 442 places in 565 ms of which 2 ms to minimize.
[2024-05-31 04:26:42] [INFO ] Deduced a trap composed of 442 places in 578 ms of which 1 ms to minimize.
[2024-05-31 04:26:43] [INFO ] Deduced a trap composed of 446 places in 575 ms of which 1 ms to minimize.
[2024-05-31 04:26:44] [INFO ] Deduced a trap composed of 446 places in 579 ms of which 1 ms to minimize.
[2024-05-31 04:26:44] [INFO ] Deduced a trap composed of 448 places in 600 ms of which 1 ms to minimize.
[2024-05-31 04:26:45] [INFO ] Deduced a trap composed of 448 places in 622 ms of which 1 ms to minimize.
[2024-05-31 04:26:46] [INFO ] Deduced a trap composed of 450 places in 603 ms of which 1 ms to minimize.
[2024-05-31 04:26:47] [INFO ] Deduced a trap composed of 460 places in 616 ms of which 1 ms to minimize.
[2024-05-31 04:26:48] [INFO ] Deduced a trap composed of 442 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:26:49] [INFO ] Deduced a trap composed of 430 places in 633 ms of which 1 ms to minimize.
[2024-05-31 04:26:49] [INFO ] Deduced a trap composed of 436 places in 487 ms of which 1 ms to minimize.
[2024-05-31 04:26:50] [INFO ] Deduced a trap composed of 446 places in 612 ms of which 2 ms to minimize.
[2024-05-31 04:26:51] [INFO ] Deduced a trap composed of 438 places in 567 ms of which 1 ms to minimize.
[2024-05-31 04:26:52] [INFO ] Deduced a trap composed of 444 places in 648 ms of which 1 ms to minimize.
[2024-05-31 04:26:53] [INFO ] Deduced a trap composed of 438 places in 628 ms of which 1 ms to minimize.
[2024-05-31 04:26:54] [INFO ] Deduced a trap composed of 442 places in 609 ms of which 1 ms to minimize.
[2024-05-31 04:26:55] [INFO ] Deduced a trap composed of 442 places in 589 ms of which 1 ms to minimize.
[2024-05-31 04:26:56] [INFO ] Deduced a trap composed of 440 places in 576 ms of which 1 ms to minimize.
[2024-05-31 04:26:57] [INFO ] Deduced a trap composed of 438 places in 568 ms of which 1 ms to minimize.
[2024-05-31 04:26:57] [INFO ] Deduced a trap composed of 446 places in 551 ms of which 1 ms to minimize.
[2024-05-31 04:26:58] [INFO ] Deduced a trap composed of 448 places in 560 ms of which 1 ms to minimize.
[2024-05-31 04:27:00] [INFO ] Deduced a trap composed of 442 places in 616 ms of which 1 ms to minimize.
[2024-05-31 04:27:00] [INFO ] Deduced a trap composed of 446 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:27:01] [INFO ] Deduced a trap composed of 438 places in 573 ms of which 1 ms to minimize.
[2024-05-31 04:27:03] [INFO ] Deduced a trap composed of 438 places in 572 ms of which 1 ms to minimize.
[2024-05-31 04:27:04] [INFO ] Deduced a trap composed of 444 places in 615 ms of which 1 ms to minimize.
[2024-05-31 04:27:07] [INFO ] Deduced a trap composed of 434 places in 622 ms of which 1 ms to minimize.
[2024-05-31 04:27:08] [INFO ] Deduced a trap composed of 446 places in 627 ms of which 1 ms to minimize.
[2024-05-31 04:27:09] [INFO ] Deduced a trap composed of 444 places in 616 ms of which 2 ms to minimize.
[2024-05-31 04:27:10] [INFO ] Deduced a trap composed of 436 places in 593 ms of which 2 ms to minimize.
[2024-05-31 04:27:11] [INFO ] Deduced a trap composed of 430 places in 580 ms of which 1 ms to minimize.
[2024-05-31 04:27:11] [INFO ] Deduced a trap composed of 428 places in 573 ms of which 1 ms to minimize.
[2024-05-31 04:27:11] [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 3
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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, 10, 10, 10] Max seen :[4, 4, 3, 3]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 117 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:27:12] [INFO ] Computed 142 invariants in 77 ms
Incomplete random walk after 1000000 steps, including 70453 resets, run finished after 8911 ms. (steps per millisecond=112 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000000 steps, including 6156 resets, run finished after 1660 ms. (steps per millisecond=602 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 7141 resets, run finished after 1784 ms. (steps per millisecond=560 ) properties (out of 3) seen :8
Incomplete Best-First random walk after 1000001 steps, including 7198 resets, run finished after 2257 ms. (steps per millisecond=443 ) properties (out of 3) seen :8
[2024-05-31 04:27:26] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:27:26] [INFO ] Computed 142 invariants in 71 ms
[2024-05-31 04:27:26] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-05-31 04:27:26] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-31 04:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:27:27] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2024-05-31 04:27:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:27:27] [INFO ] [Nat]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-31 04:27:27] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 04:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:27:34] [INFO ] [Nat]Absence check using state equation in 6681 ms returned unknown
[2024-05-31 04:27:34] [INFO ] [Real]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-31 04:27:34] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 04:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:27:35] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2024-05-31 04:27:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:27:35] [INFO ] [Nat]Absence check using 135 positive place invariants in 49 ms returned sat
[2024-05-31 04:27:35] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 33 ms returned sat
[2024-05-31 04:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:27:36] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-05-31 04:27:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:27:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 873 ms returned sat
[2024-05-31 04:27:37] [INFO ] Deduced a trap composed of 444 places in 602 ms of which 1 ms to minimize.
[2024-05-31 04:27:38] [INFO ] Deduced a trap composed of 450 places in 640 ms of which 1 ms to minimize.
[2024-05-31 04:27:39] [INFO ] Deduced a trap composed of 438 places in 578 ms of which 1 ms to minimize.
[2024-05-31 04:27:39] [INFO ] Deduced a trap composed of 442 places in 559 ms of which 1 ms to minimize.
[2024-05-31 04:27:40] [INFO ] Deduced a trap composed of 454 places in 537 ms of which 1 ms to minimize.
[2024-05-31 04:27:41] [INFO ] Deduced a trap composed of 452 places in 567 ms of which 2 ms to minimize.
[2024-05-31 04:27:41] [INFO ] Deduced a trap composed of 438 places in 575 ms of which 1 ms to minimize.
[2024-05-31 04:27:42] [INFO ] Deduced a trap composed of 442 places in 563 ms of which 2 ms to minimize.
[2024-05-31 04:27:43] [INFO ] Deduced a trap composed of 444 places in 573 ms of which 1 ms to minimize.
[2024-05-31 04:27:43] [INFO ] Deduced a trap composed of 454 places in 557 ms of which 1 ms to minimize.
[2024-05-31 04:27:44] [INFO ] Deduced a trap composed of 438 places in 641 ms of which 2 ms to minimize.
[2024-05-31 04:27:45] [INFO ] Deduced a trap composed of 438 places in 558 ms of which 1 ms to minimize.
[2024-05-31 04:27:46] [INFO ] Deduced a trap composed of 442 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:27:46] [INFO ] Deduced a trap composed of 452 places in 599 ms of which 1 ms to minimize.
[2024-05-31 04:27:47] [INFO ] Deduced a trap composed of 436 places in 628 ms of which 1 ms to minimize.
[2024-05-31 04:27:48] [INFO ] Deduced a trap composed of 436 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:27:49] [INFO ] Deduced a trap composed of 446 places in 608 ms of which 1 ms to minimize.
[2024-05-31 04:27:49] [INFO ] Deduced a trap composed of 454 places in 612 ms of which 1 ms to minimize.
[2024-05-31 04:27:50] [INFO ] Deduced a trap composed of 452 places in 633 ms of which 1 ms to minimize.
[2024-05-31 04:27:51] [INFO ] Deduced a trap composed of 434 places in 591 ms of which 1 ms to minimize.
[2024-05-31 04:27:52] [INFO ] Deduced a trap composed of 448 places in 620 ms of which 1 ms to minimize.
[2024-05-31 04:27:52] [INFO ] Deduced a trap composed of 442 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:27:54] [INFO ] Deduced a trap composed of 432 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:27:55] [INFO ] Deduced a trap composed of 456 places in 621 ms of which 1 ms to minimize.
[2024-05-31 04:27:56] [INFO ] Deduced a trap composed of 438 places in 639 ms of which 1 ms to minimize.
[2024-05-31 04:27:57] [INFO ] Deduced a trap composed of 446 places in 641 ms of which 3 ms to minimize.
[2024-05-31 04:27:57] [INFO ] Deduced a trap composed of 446 places in 548 ms of which 1 ms to minimize.
[2024-05-31 04:27:58] [INFO ] Deduced a trap composed of 436 places in 572 ms of which 1 ms to minimize.
[2024-05-31 04:27:59] [INFO ] Deduced a trap composed of 444 places in 576 ms of which 1 ms to minimize.
[2024-05-31 04:28:01] [INFO ] Deduced a trap composed of 446 places in 637 ms of which 1 ms to minimize.
[2024-05-31 04:28:01] [INFO ] Deduced a trap composed of 446 places in 566 ms of which 1 ms to minimize.
[2024-05-31 04:28:02] [INFO ] Deduced a trap composed of 436 places in 561 ms of which 1 ms to minimize.
[2024-05-31 04:28:03] [INFO ] Deduced a trap composed of 436 places in 589 ms of which 2 ms to minimize.
[2024-05-31 04:28:04] [INFO ] Deduced a trap composed of 442 places in 622 ms of which 1 ms to minimize.
[2024-05-31 04:28:05] [INFO ] Deduced a trap composed of 432 places in 576 ms of which 1 ms to minimize.
[2024-05-31 04:28:05] [INFO ] Deduced a trap composed of 456 places in 513 ms of which 2 ms to minimize.
[2024-05-31 04:28:06] [INFO ] Deduced a trap composed of 450 places in 582 ms of which 1 ms to minimize.
[2024-05-31 04:28:06] [INFO ] Deduced a trap composed of 438 places in 511 ms of which 1 ms to minimize.
[2024-05-31 04:28:07] [INFO ] Deduced a trap composed of 442 places in 563 ms of which 0 ms to minimize.
[2024-05-31 04:28:08] [INFO ] Deduced a trap composed of 448 places in 639 ms of which 1 ms to minimize.
[2024-05-31 04:28:09] [INFO ] Deduced a trap composed of 444 places in 622 ms of which 2 ms to minimize.
[2024-05-31 04:28:10] [INFO ] Deduced a trap composed of 430 places in 553 ms of which 1 ms to minimize.
[2024-05-31 04:28:10] [INFO ] Deduced a trap composed of 440 places in 653 ms of which 1 ms to minimize.
[2024-05-31 04:28:11] [INFO ] Deduced a trap composed of 438 places in 628 ms of which 1 ms to minimize.
[2024-05-31 04:28:12] [INFO ] Deduced a trap composed of 440 places in 572 ms of which 1 ms to minimize.
[2024-05-31 04:28:12] [INFO ] Deduced a trap composed of 434 places in 639 ms of which 1 ms to minimize.
[2024-05-31 04:28:14] [INFO ] Deduced a trap composed of 440 places in 653 ms of which 2 ms to minimize.
[2024-05-31 04:28:15] [INFO ] Deduced a trap composed of 444 places in 623 ms of which 1 ms to minimize.
[2024-05-31 04:28:16] [INFO ] Deduced a trap composed of 440 places in 617 ms of which 1 ms to minimize.
[2024-05-31 04:28:16] [INFO ] Deduced a trap composed of 440 places in 554 ms of which 1 ms to minimize.
[2024-05-31 04:28:17] [INFO ] Deduced a trap composed of 440 places in 614 ms of which 1 ms to minimize.
[2024-05-31 04:28:20] [INFO ] Deduced a trap composed of 432 places in 600 ms of which 1 ms to minimize.
[2024-05-31 04:28:20] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 43309 ms
[2024-05-31 04:28:20] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-05-31 04:28:20] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 04:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:28:21] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2024-05-31 04:28:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:28:21] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 04:28:21] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-31 04:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:28:22] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-05-31 04:28:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 696 ms returned sat
[2024-05-31 04:28:23] [INFO ] Deduced a trap composed of 442 places in 568 ms of which 1 ms to minimize.
[2024-05-31 04:28:24] [INFO ] Deduced a trap composed of 434 places in 584 ms of which 1 ms to minimize.
[2024-05-31 04:28:25] [INFO ] Deduced a trap composed of 438 places in 581 ms of which 1 ms to minimize.
[2024-05-31 04:28:25] [INFO ] Deduced a trap composed of 434 places in 597 ms of which 1 ms to minimize.
[2024-05-31 04:28:26] [INFO ] Deduced a trap composed of 438 places in 566 ms of which 1 ms to minimize.
[2024-05-31 04:28:27] [INFO ] Deduced a trap composed of 436 places in 581 ms of which 1 ms to minimize.
[2024-05-31 04:28:27] [INFO ] Deduced a trap composed of 444 places in 562 ms of which 1 ms to minimize.
[2024-05-31 04:28:28] [INFO ] Deduced a trap composed of 436 places in 617 ms of which 2 ms to minimize.
[2024-05-31 04:28:29] [INFO ] Deduced a trap composed of 450 places in 623 ms of which 1 ms to minimize.
[2024-05-31 04:28:30] [INFO ] Deduced a trap composed of 438 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:28:30] [INFO ] Deduced a trap composed of 444 places in 623 ms of which 1 ms to minimize.
[2024-05-31 04:28:31] [INFO ] Deduced a trap composed of 438 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:28:32] [INFO ] Deduced a trap composed of 448 places in 628 ms of which 1 ms to minimize.
[2024-05-31 04:28:33] [INFO ] Deduced a trap composed of 450 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:28:34] [INFO ] Deduced a trap composed of 442 places in 626 ms of which 1 ms to minimize.
[2024-05-31 04:28:34] [INFO ] Deduced a trap composed of 440 places in 571 ms of which 1 ms to minimize.
[2024-05-31 04:28:35] [INFO ] Deduced a trap composed of 450 places in 579 ms of which 1 ms to minimize.
[2024-05-31 04:28:36] [INFO ] Deduced a trap composed of 436 places in 631 ms of which 1 ms to minimize.
[2024-05-31 04:28:37] [INFO ] Deduced a trap composed of 442 places in 621 ms of which 2 ms to minimize.
[2024-05-31 04:28:38] [INFO ] Deduced a trap composed of 442 places in 564 ms of which 1 ms to minimize.
[2024-05-31 04:28:38] [INFO ] Deduced a trap composed of 446 places in 619 ms of which 2 ms to minimize.
[2024-05-31 04:28:39] [INFO ] Deduced a trap composed of 446 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:28:40] [INFO ] Deduced a trap composed of 448 places in 646 ms of which 2 ms to minimize.
[2024-05-31 04:28:41] [INFO ] Deduced a trap composed of 448 places in 636 ms of which 1 ms to minimize.
[2024-05-31 04:28:42] [INFO ] Deduced a trap composed of 450 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:28:43] [INFO ] Deduced a trap composed of 460 places in 624 ms of which 1 ms to minimize.
[2024-05-31 04:28:43] [INFO ] Deduced a trap composed of 442 places in 629 ms of which 2 ms to minimize.
[2024-05-31 04:28:44] [INFO ] Deduced a trap composed of 430 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:28:45] [INFO ] Deduced a trap composed of 436 places in 622 ms of which 1 ms to minimize.
[2024-05-31 04:28:45] [INFO ] Deduced a trap composed of 446 places in 610 ms of which 1 ms to minimize.
[2024-05-31 04:28:46] [INFO ] Deduced a trap composed of 438 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:28:47] [INFO ] Deduced a trap composed of 444 places in 573 ms of which 2 ms to minimize.
[2024-05-31 04:28:48] [INFO ] Deduced a trap composed of 438 places in 559 ms of which 1 ms to minimize.
[2024-05-31 04:28:49] [INFO ] Deduced a trap composed of 442 places in 616 ms of which 1 ms to minimize.
[2024-05-31 04:28:51] [INFO ] Deduced a trap composed of 442 places in 620 ms of which 1 ms to minimize.
[2024-05-31 04:28:52] [INFO ] Deduced a trap composed of 440 places in 624 ms of which 1 ms to minimize.
[2024-05-31 04:28:52] [INFO ] Deduced a trap composed of 438 places in 613 ms of which 1 ms to minimize.
[2024-05-31 04:28:53] [INFO ] Deduced a trap composed of 446 places in 579 ms of which 1 ms to minimize.
[2024-05-31 04:28:54] [INFO ] Deduced a trap composed of 448 places in 608 ms of which 1 ms to minimize.
[2024-05-31 04:28:55] [INFO ] Deduced a trap composed of 442 places in 643 ms of which 1 ms to minimize.
[2024-05-31 04:28:56] [INFO ] Deduced a trap composed of 446 places in 616 ms of which 2 ms to minimize.
[2024-05-31 04:28:57] [INFO ] Deduced a trap composed of 438 places in 579 ms of which 2 ms to minimize.
[2024-05-31 04:28:59] [INFO ] Deduced a trap composed of 438 places in 620 ms of which 2 ms to minimize.
[2024-05-31 04:29:00] [INFO ] Deduced a trap composed of 444 places in 620 ms of which 2 ms to minimize.
[2024-05-31 04:29:03] [INFO ] Deduced a trap composed of 434 places in 620 ms of which 1 ms to minimize.
[2024-05-31 04:29:04] [INFO ] Deduced a trap composed of 446 places in 575 ms of which 1 ms to minimize.
[2024-05-31 04:29:05] [INFO ] Deduced a trap composed of 444 places in 578 ms of which 1 ms to minimize.
[2024-05-31 04:29:05] [INFO ] Deduced a trap composed of 436 places in 570 ms of which 1 ms to minimize.
[2024-05-31 04:29:06] [INFO ] Deduced a trap composed of 430 places in 557 ms of which 1 ms to minimize.
[2024-05-31 04:29:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10, 10, 10] Max seen :[4, 3, 3]
Support contains 3 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 57 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2024-05-31 04:29:07] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:29:07] [INFO ] Invariant cache hit.
[2024-05-31 04:29:08] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2024-05-31 04:29:08] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:29:08] [INFO ] Invariant cache hit.
[2024-05-31 04:29:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:29:13] [INFO ] Implicit Places using invariants and state equation in 5283 ms returned []
Implicit Place search using SMT with State Equation took 6333 ms to find 0 implicit places.
[2024-05-31 04:29:13] [INFO ] Redundant transitions in 160 ms returned []
[2024-05-31 04:29:13] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:29:13] [INFO ] Invariant cache hit.
[2024-05-31 04:29:14] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7789 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-01
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:29:14] [INFO ] Computed 142 invariants in 73 ms
Incomplete random walk after 10000 steps, including 705 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :4
[2024-05-31 04:29:15] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:29:15] [INFO ] Computed 142 invariants in 70 ms
[2024-05-31 04:29:15] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-31 04:29:15] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 04:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:15] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2024-05-31 04:29:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:29:16] [INFO ] [Nat]Absence check using 135 positive place invariants in 40 ms returned sat
[2024-05-31 04:29:16] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-31 04:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:20] [INFO ] [Nat]Absence check using state equation in 4774 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2061
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2061
Applied a total of 2 rules in 129 ms. Remains 1090 /1091 variables (removed 1) and now considering 2061/2062 (removed 1) transitions.
[2024-05-31 04:29:21] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 04:29:21] [INFO ] Computed 142 invariants in 69 ms
[2024-05-31 04:29:22] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1610 ms. Remains : 1090/1091 places, 2061/2062 transitions.
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 04:29:22] [INFO ] Computed 142 invariants in 39 ms
Incomplete random walk after 1000000 steps, including 72686 resets, run finished after 9111 ms. (steps per millisecond=109 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 6123 resets, run finished after 2002 ms. (steps per millisecond=499 ) properties (out of 1) seen :4
[2024-05-31 04:29:33] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 04:29:33] [INFO ] Computed 142 invariants in 73 ms
[2024-05-31 04:29:33] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 04:29:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 04:29:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:34] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2024-05-31 04:29:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:29:35] [INFO ] [Nat]Absence check using 135 positive place invariants in 64 ms returned sat
[2024-05-31 04:29:35] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 35 ms returned sat
[2024-05-31 04:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:42] [INFO ] [Nat]Absence check using state equation in 7069 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 93 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 67 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2024-05-31 04:29:42] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 04:29:42] [INFO ] Invariant cache hit.
[2024-05-31 04:29:43] [INFO ] Implicit Places using invariants in 982 ms returned []
[2024-05-31 04:29:43] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 04:29:43] [INFO ] Invariant cache hit.
[2024-05-31 04:29:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:29:47] [INFO ] Implicit Places using invariants and state equation in 3853 ms returned []
Implicit Place search using SMT with State Equation took 4836 ms to find 0 implicit places.
[2024-05-31 04:29:47] [INFO ] Redundant transitions in 160 ms returned []
[2024-05-31 04:29:47] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 04:29:47] [INFO ] Invariant cache hit.
[2024-05-31 04:29:48] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6278 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-01 in 33707 ms.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-10
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:29:48] [INFO ] Computed 142 invariants in 35 ms
Incomplete random walk after 10002 steps, including 703 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2024-05-31 04:29:48] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:29:48] [INFO ] Computed 142 invariants in 70 ms
[2024-05-31 04:29:48] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 04:29:48] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-31 04:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:49] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2024-05-31 04:29:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:29:49] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 04:29:49] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 04:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:29:50] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2024-05-31 04:29:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:29:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 948 ms returned sat
[2024-05-31 04:29:51] [INFO ] Deduced a trap composed of 444 places in 576 ms of which 1 ms to minimize.
[2024-05-31 04:29:52] [INFO ] Deduced a trap composed of 450 places in 525 ms of which 1 ms to minimize.
[2024-05-31 04:29:53] [INFO ] Deduced a trap composed of 438 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:29:53] [INFO ] Deduced a trap composed of 442 places in 570 ms of which 1 ms to minimize.
[2024-05-31 04:29:54] [INFO ] Deduced a trap composed of 454 places in 552 ms of which 1 ms to minimize.
[2024-05-31 04:29:55] [INFO ] Deduced a trap composed of 452 places in 564 ms of which 2 ms to minimize.
[2024-05-31 04:29:55] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2024-05-31 04:29:55] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:29:55] [INFO ] Invariant cache hit.
[2024-05-31 04:29:56] [INFO ] Dead Transitions using invariants and state equation in 1207 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1264 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:29:56] [INFO ] Computed 142 invariants in 71 ms
Incomplete random walk after 1000000 steps, including 70353 resets, run finished after 10092 ms. (steps per millisecond=99 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7337 resets, run finished after 2062 ms. (steps per millisecond=484 ) properties (out of 1) seen :3
[2024-05-31 04:30:08] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:30:08] [INFO ] Computed 142 invariants in 73 ms
[2024-05-31 04:30:08] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 04:30:08] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-31 04:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:09] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2024-05-31 04:30:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:30:09] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 04:30:09] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 56 ms returned sat
[2024-05-31 04:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:30:10] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-31 04:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:30:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 937 ms returned sat
[2024-05-31 04:30:11] [INFO ] Deduced a trap composed of 444 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:30:12] [INFO ] Deduced a trap composed of 450 places in 585 ms of which 1 ms to minimize.
[2024-05-31 04:30:13] [INFO ] Deduced a trap composed of 438 places in 567 ms of which 1 ms to minimize.
[2024-05-31 04:30:13] [INFO ] Deduced a trap composed of 442 places in 565 ms of which 1 ms to minimize.
[2024-05-31 04:30:14] [INFO ] Deduced a trap composed of 454 places in 602 ms of which 1 ms to minimize.
[2024-05-31 04:30:15] [INFO ] Deduced a trap composed of 452 places in 566 ms of which 1 ms to minimize.
[2024-05-31 04:30:15] [INFO ] Deduced a trap composed of 438 places in 589 ms of which 1 ms to minimize.
[2024-05-31 04:30:16] [INFO ] Deduced a trap composed of 442 places in 585 ms of which 1 ms to minimize.
[2024-05-31 04:30:17] [INFO ] Deduced a trap composed of 444 places in 563 ms of which 1 ms to minimize.
[2024-05-31 04:30:17] [INFO ] Deduced a trap composed of 454 places in 591 ms of which 1 ms to minimize.
[2024-05-31 04:30:18] [INFO ] Deduced a trap composed of 438 places in 637 ms of which 2 ms to minimize.
[2024-05-31 04:30:19] [INFO ] Deduced a trap composed of 438 places in 572 ms of which 1 ms to minimize.
[2024-05-31 04:30:20] [INFO ] Deduced a trap composed of 442 places in 545 ms of which 1 ms to minimize.
[2024-05-31 04:30:21] [INFO ] Deduced a trap composed of 452 places in 632 ms of which 1 ms to minimize.
[2024-05-31 04:30:21] [INFO ] Deduced a trap composed of 436 places in 580 ms of which 1 ms to minimize.
[2024-05-31 04:30:22] [INFO ] Deduced a trap composed of 436 places in 566 ms of which 1 ms to minimize.
[2024-05-31 04:30:23] [INFO ] Deduced a trap composed of 446 places in 583 ms of which 1 ms to minimize.
[2024-05-31 04:30:23] [INFO ] Deduced a trap composed of 454 places in 568 ms of which 1 ms to minimize.
[2024-05-31 04:30:24] [INFO ] Deduced a trap composed of 452 places in 581 ms of which 1 ms to minimize.
[2024-05-31 04:30:25] [INFO ] Deduced a trap composed of 434 places in 539 ms of which 1 ms to minimize.
[2024-05-31 04:30:25] [INFO ] Deduced a trap composed of 448 places in 661 ms of which 2 ms to minimize.
[2024-05-31 04:30:26] [INFO ] Deduced a trap composed of 442 places in 581 ms of which 2 ms to minimize.
[2024-05-31 04:30:28] [INFO ] Deduced a trap composed of 432 places in 633 ms of which 1 ms to minimize.
[2024-05-31 04:30:29] [INFO ] Deduced a trap composed of 456 places in 621 ms of which 1 ms to minimize.
[2024-05-31 04:30:29] [INFO ] Deduced a trap composed of 438 places in 583 ms of which 3 ms to minimize.
[2024-05-31 04:30:30] [INFO ] Deduced a trap composed of 446 places in 652 ms of which 1 ms to minimize.
[2024-05-31 04:30:31] [INFO ] Deduced a trap composed of 446 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:30:32] [INFO ] Deduced a trap composed of 436 places in 615 ms of which 2 ms to minimize.
[2024-05-31 04:30:33] [INFO ] Deduced a trap composed of 444 places in 612 ms of which 1 ms to minimize.
[2024-05-31 04:30:34] [INFO ] Deduced a trap composed of 446 places in 612 ms of which 1 ms to minimize.
[2024-05-31 04:30:35] [INFO ] Deduced a trap composed of 446 places in 610 ms of which 1 ms to minimize.
[2024-05-31 04:30:36] [INFO ] Deduced a trap composed of 436 places in 597 ms of which 1 ms to minimize.
[2024-05-31 04:30:37] [INFO ] Deduced a trap composed of 436 places in 570 ms of which 1 ms to minimize.
[2024-05-31 04:30:38] [INFO ] Deduced a trap composed of 442 places in 604 ms of which 1 ms to minimize.
[2024-05-31 04:30:39] [INFO ] Deduced a trap composed of 432 places in 607 ms of which 1 ms to minimize.
[2024-05-31 04:30:39] [INFO ] Deduced a trap composed of 456 places in 607 ms of which 2 ms to minimize.
[2024-05-31 04:30:40] [INFO ] Deduced a trap composed of 450 places in 549 ms of which 1 ms to minimize.
[2024-05-31 04:30:41] [INFO ] Deduced a trap composed of 438 places in 601 ms of which 2 ms to minimize.
[2024-05-31 04:30:41] [INFO ] Deduced a trap composed of 442 places in 565 ms of which 1 ms to minimize.
[2024-05-31 04:30:42] [INFO ] Deduced a trap composed of 448 places in 564 ms of which 1 ms to minimize.
[2024-05-31 04:30:43] [INFO ] Deduced a trap composed of 444 places in 551 ms of which 1 ms to minimize.
[2024-05-31 04:30:44] [INFO ] Deduced a trap composed of 430 places in 597 ms of which 2 ms to minimize.
[2024-05-31 04:30:44] [INFO ] Deduced a trap composed of 440 places in 528 ms of which 1 ms to minimize.
[2024-05-31 04:30:45] [INFO ] Deduced a trap composed of 438 places in 526 ms of which 1 ms to minimize.
[2024-05-31 04:30:46] [INFO ] Deduced a trap composed of 440 places in 572 ms of which 1 ms to minimize.
[2024-05-31 04:30:46] [INFO ] Deduced a trap composed of 434 places in 548 ms of which 2 ms to minimize.
[2024-05-31 04:30:48] [INFO ] Deduced a trap composed of 440 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:30:49] [INFO ] Deduced a trap composed of 444 places in 614 ms of which 1 ms to minimize.
[2024-05-31 04:30:49] [INFO ] Deduced a trap composed of 440 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:30:50] [INFO ] Deduced a trap composed of 440 places in 569 ms of which 1 ms to minimize.
[2024-05-31 04:30:51] [INFO ] Deduced a trap composed of 440 places in 561 ms of which 1 ms to minimize.
[2024-05-31 04:30:53] [INFO ] Deduced a trap composed of 432 places in 569 ms of which 2 ms to minimize.
[2024-05-31 04:30:54] [INFO ] Deduced a trap composed of 442 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:30:54] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 61 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2024-05-31 04:30:54] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:30:54] [INFO ] Invariant cache hit.
[2024-05-31 04:30:55] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2024-05-31 04:30:55] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:30:55] [INFO ] Invariant cache hit.
[2024-05-31 04:30:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:31:02] [INFO ] Implicit Places using invariants and state equation in 6472 ms returned []
Implicit Place search using SMT with State Equation took 7531 ms to find 0 implicit places.
[2024-05-31 04:31:02] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-31 04:31:02] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:31:02] [INFO ] Invariant cache hit.
[2024-05-31 04:31:03] [INFO ] Dead Transitions using invariants and state equation in 1269 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8903 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-10 in 75203 ms.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-15
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:31:03] [INFO ] Computed 142 invariants in 31 ms
Incomplete random walk after 10000 steps, including 723 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :3
[2024-05-31 04:31:03] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:31:03] [INFO ] Computed 142 invariants in 72 ms
[2024-05-31 04:31:04] [INFO ] [Real]Absence check using 135 positive place invariants in 33 ms returned sat
[2024-05-31 04:31:04] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 04:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:31:04] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2024-05-31 04:31:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:31:04] [INFO ] [Nat]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-05-31 04:31:04] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 33 ms returned sat
[2024-05-31 04:31:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:31:05] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2024-05-31 04:31:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:31:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 716 ms returned sat
[2024-05-31 04:31:06] [INFO ] Deduced a trap composed of 442 places in 555 ms of which 1 ms to minimize.
[2024-05-31 04:31:07] [INFO ] Deduced a trap composed of 434 places in 574 ms of which 1 ms to minimize.
[2024-05-31 04:31:08] [INFO ] Deduced a trap composed of 438 places in 577 ms of which 1 ms to minimize.
[2024-05-31 04:31:09] [INFO ] Deduced a trap composed of 434 places in 572 ms of which 1 ms to minimize.
[2024-05-31 04:31:09] [INFO ] Deduced a trap composed of 438 places in 615 ms of which 1 ms to minimize.
[2024-05-31 04:31:10] [INFO ] Deduced a trap composed of 7 places in 685 ms of which 1 ms to minimize.
[2024-05-31 04:31:10] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 45 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2024-05-31 04:31:10] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:31:10] [INFO ] Invariant cache hit.
[2024-05-31 04:31:11] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1137 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:31:11] [INFO ] Computed 142 invariants in 36 ms
Incomplete random walk after 1000000 steps, including 70571 resets, run finished after 10239 ms. (steps per millisecond=97 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 7191 resets, run finished after 2055 ms. (steps per millisecond=486 ) properties (out of 1) seen :3
[2024-05-31 04:31:23] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 04:31:23] [INFO ] Computed 142 invariants in 73 ms
[2024-05-31 04:31:24] [INFO ] [Real]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-31 04:31:24] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 04:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:31:24] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-31 04:31:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:31:24] [INFO ] [Nat]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-31 04:31:25] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-31 04:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:31:25] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2024-05-31 04:31:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:31:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 719 ms returned sat
[2024-05-31 04:31:27] [INFO ] Deduced a trap composed of 442 places in 625 ms of which 1 ms to minimize.
[2024-05-31 04:31:27] [INFO ] Deduced a trap composed of 434 places in 615 ms of which 1 ms to minimize.
[2024-05-31 04:31:28] [INFO ] Deduced a trap composed of 438 places in 612 ms of which 1 ms to minimize.
[2024-05-31 04:31:29] [INFO ] Deduced a trap composed of 434 places in 566 ms of which 1 ms to minimize.
[2024-05-31 04:31:29] [INFO ] Deduced a trap composed of 438 places in 579 ms of which 1 ms to minimize.
[2024-05-31 04:31:30] [INFO ] Deduced a trap composed of 436 places in 623 ms of which 1 ms to minimize.
[2024-05-31 04:31:31] [INFO ] Deduced a trap composed of 444 places in 624 ms of which 1 ms to minimize.
[2024-05-31 04:31:31] [INFO ] Deduced a trap composed of 436 places in 657 ms of which 2 ms to minimize.
[2024-05-31 04:31:32] [INFO ] Deduced a trap composed of 450 places in 617 ms of which 1 ms to minimize.
[2024-05-31 04:31:33] [INFO ] Deduced a trap composed of 438 places in 560 ms of which 1 ms to minimize.
[2024-05-31 04:31:34] [INFO ] Deduced a trap composed of 444 places in 615 ms of which 1 ms to minimize.
[2024-05-31 04:31:34] [INFO ] Deduced a trap composed of 438 places in 611 ms of which 1 ms to minimize.
[2024-05-31 04:31:35] [INFO ] Deduced a trap composed of 448 places in 611 ms of which 1 ms to minimize.
[2024-05-31 04:31:36] [INFO ] Deduced a trap composed of 450 places in 562 ms of which 1 ms to minimize.
[2024-05-31 04:31:37] [INFO ] Deduced a trap composed of 442 places in 573 ms of which 1 ms to minimize.
[2024-05-31 04:31:38] [INFO ] Deduced a trap composed of 440 places in 586 ms of which 1 ms to minimize.
[2024-05-31 04:31:38] [INFO ] Deduced a trap composed of 450 places in 518 ms of which 1 ms to minimize.
[2024-05-31 04:31:39] [INFO ] Deduced a trap composed of 436 places in 562 ms of which 1 ms to minimize.
[2024-05-31 04:31:40] [INFO ] Deduced a trap composed of 442 places in 558 ms of which 1 ms to minimize.
[2024-05-31 04:31:41] [INFO ] Deduced a trap composed of 442 places in 569 ms of which 1 ms to minimize.
[2024-05-31 04:31:41] [INFO ] Deduced a trap composed of 446 places in 568 ms of which 1 ms to minimize.
[2024-05-31 04:31:42] [INFO ] Deduced a trap composed of 446 places in 563 ms of which 1 ms to minimize.
[2024-05-31 04:31:43] [INFO ] Deduced a trap composed of 448 places in 610 ms of which 1 ms to minimize.
[2024-05-31 04:31:44] [INFO ] Deduced a trap composed of 448 places in 612 ms of which 1 ms to minimize.
[2024-05-31 04:31:45] [INFO ] Deduced a trap composed of 450 places in 552 ms of which 1 ms to minimize.
[2024-05-31 04:31:45] [INFO ] Deduced a trap composed of 460 places in 615 ms of which 1 ms to minimize.
[2024-05-31 04:31:46] [INFO ] Deduced a trap composed of 442 places in 615 ms of which 1 ms to minimize.
[2024-05-31 04:31:47] [INFO ] Deduced a trap composed of 430 places in 597 ms of which 1 ms to minimize.
[2024-05-31 04:31:48] [INFO ] Deduced a trap composed of 436 places in 612 ms of which 1 ms to minimize.
[2024-05-31 04:31:48] [INFO ] Deduced a trap composed of 446 places in 615 ms of which 1 ms to minimize.
[2024-05-31 04:31:49] [INFO ] Deduced a trap composed of 438 places in 611 ms of which 1 ms to minimize.
[2024-05-31 04:31:50] [INFO ] Deduced a trap composed of 444 places in 618 ms of which 2 ms to minimize.
[2024-05-31 04:31:51] [INFO ] Deduced a trap composed of 438 places in 561 ms of which 1 ms to minimize.
[2024-05-31 04:31:52] [INFO ] Deduced a trap composed of 442 places in 571 ms of which 1 ms to minimize.
[2024-05-31 04:31:54] [INFO ] Deduced a trap composed of 442 places in 623 ms of which 1 ms to minimize.
[2024-05-31 04:31:54] [INFO ] Deduced a trap composed of 440 places in 621 ms of which 1 ms to minimize.
[2024-05-31 04:31:55] [INFO ] Deduced a trap composed of 438 places in 596 ms of which 1 ms to minimize.
[2024-05-31 04:31:56] [INFO ] Deduced a trap composed of 446 places in 575 ms of which 1 ms to minimize.
[2024-05-31 04:31:57] [INFO ] Deduced a trap composed of 448 places in 617 ms of which 2 ms to minimize.
[2024-05-31 04:31:58] [INFO ] Deduced a trap composed of 442 places in 622 ms of which 1 ms to minimize.
[2024-05-31 04:31:59] [INFO ] Deduced a trap composed of 446 places in 636 ms of which 1 ms to minimize.
[2024-05-31 04:32:00] [INFO ] Deduced a trap composed of 438 places in 598 ms of which 1 ms to minimize.
[2024-05-31 04:32:02] [INFO ] Deduced a trap composed of 438 places in 630 ms of which 2 ms to minimize.
[2024-05-31 04:32:03] [INFO ] Deduced a trap composed of 444 places in 618 ms of which 1 ms to minimize.
[2024-05-31 04:32:06] [INFO ] Deduced a trap composed of 434 places in 553 ms of which 1 ms to minimize.
[2024-05-31 04:32:07] [INFO ] Deduced a trap composed of 446 places in 563 ms of which 1 ms to minimize.
[2024-05-31 04:32:08] [INFO ] Deduced a trap composed of 444 places in 614 ms of which 9 ms to minimize.
[2024-05-31 04:32:08] [INFO ] Deduced a trap composed of 436 places in 624 ms of which 1 ms to minimize.
[2024-05-31 04:32:10] [INFO ] Deduced a trap composed of 430 places in 617 ms of which 1 ms to minimize.
[2024-05-31 04:32:10] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 88 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 61 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2024-05-31 04:32:10] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:32:10] [INFO ] Invariant cache hit.
[2024-05-31 04:32:11] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2024-05-31 04:32:11] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:32:11] [INFO ] Invariant cache hit.
[2024-05-31 04:32:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:32:18] [INFO ] Implicit Places using invariants and state equation in 7507 ms returned []
Implicit Place search using SMT with State Equation took 8525 ms to find 0 implicit places.
[2024-05-31 04:32:18] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-31 04:32:18] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 04:32:18] [INFO ] Invariant cache hit.
[2024-05-31 04:32:19] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9760 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-15 in 76246 ms.
[2024-05-31 04:32:20] [INFO ] Flatten gal took : 236 ms
[2024-05-31 04:32:20] [INFO ] Applying decomposition
[2024-05-31 04:32:20] [INFO ] Flatten gal took : 164 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13936935218392028007.txt' '-o' '/tmp/graph13936935218392028007.bin' '-w' '/tmp/graph13936935218392028007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13936935218392028007.bin' '-l' '-1' '-v' '-w' '/tmp/graph13936935218392028007.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:32:20] [INFO ] Decomposing Gal with order
[2024-05-31 04:32:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:32:21] [INFO ] Removed a total of 4061 redundant transitions.
[2024-05-31 04:32:21] [INFO ] Flatten gal took : 503 ms
[2024-05-31 04:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 562 labels/synchronizations in 89 ms.
[2024-05-31 04:32:21] [INFO ] Time to serialize gal into /tmp/UpperBounds667306051444398888.gal : 23 ms
[2024-05-31 04:32:21] [INFO ] Time to serialize properties into /tmp/UpperBounds8872938491361212948.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds667306051444398888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8872938491361212948.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds8872938491361212948.prop.
Detected timeout of ITS tools.
[2024-05-31 04:55:02] [INFO ] Applying decomposition
[2024-05-31 04:55:02] [INFO ] Flatten gal took : 632 ms
[2024-05-31 04:55:02] [INFO ] Decomposing Gal with order
[2024-05-31 04:55:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:55:03] [INFO ] Removed a total of 9599 redundant transitions.
[2024-05-31 04:55:04] [INFO ] Flatten gal took : 408 ms
[2024-05-31 04:55:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2024-05-31 04:55:04] [INFO ] Time to serialize gal into /tmp/UpperBounds7430033435862452052.gal : 40 ms
[2024-05-31 04:55:04] [INFO ] Time to serialize properties into /tmp/UpperBounds7609120232936199968.prop : 52 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7430033435862452052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7609120232936199968.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7609120232936199968.prop.
Detected timeout of ITS tools.
[2024-05-31 05:17:44] [INFO ] Flatten gal took : 687 ms
[2024-05-31 05:17:45] [INFO ] Input system was already deterministic with 2062 transitions.
[2024-05-31 05:17:45] [INFO ] Transformed 1091 places.
[2024-05-31 05:17:46] [INFO ] Transformed 2062 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 05:18:16] [INFO ] Time to serialize gal into /tmp/UpperBounds18020752326507364283.gal : 92 ms
[2024-05-31 05:18:16] [INFO ] Time to serialize properties into /tmp/UpperBounds9826567741090470371.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18020752326507364283.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9826567741090470371.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9826567741090470371.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 6690468 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16226276 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S10J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460800266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;