fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r159-oct2-162089267800091
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
365.176 26797.00 46565.00 218.50 0 1 10 2 2 10 1 1 1 1 1 1 1 2 1 2 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267800091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-COL-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267800091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 09:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 154K May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621182612597

Running Version 0
[2021-05-16 16:30:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 16:30:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 16:30:16] [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.
[2021-05-16 16:30:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 16:30:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 802 ms
[2021-05-16 16:30:17] [INFO ] ms1 symmetric to ms2 in transition T_1124
[2021-05-16 16:30:17] [INFO ] ms1 symmetric to ms2 in transition T_1125
[2021-05-16 16:30:17] [INFO ] ms2 symmetric to ms3 in transition T_1125
[2021-05-16 16:30:17] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2021-05-16 16:30:17] [INFO ] ms4 symmetric to ms2 in transition T_1126
[2021-05-16 16:30:17] [INFO ] ms2 symmetric to ms3 in transition T_1126
[2021-05-16 16:30:17] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-16 16:30:17] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions in 4 ms.
[2021-05-16 16:30:17] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_1299337025953938473.dot
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2021-05-16 16:30:17] [INFO ] Computed 26 place invariants in 9 ms
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-16 16:30:17] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1412 transitions in 38 ms.
[2021-05-16 16:30:17] [INFO ] Unfolded HLPN properties in 0 ms.
[2021-05-16 16:30:17] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2021-05-16 16:30:17] [INFO ] Computed 26 place invariants in 7 ms
[2021-05-16 16:30:17] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-16 16:30:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:17] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-16 16:30:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 16:30:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-16 16:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:17] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-16 16:30:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-16 16:30:17] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2021-05-16 16:30:19] [INFO ] Deduced a trap composed of 30 places in 1598 ms of which 23 ms to minimize.
[2021-05-16 16:30:19] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2021-05-16 16:30:19] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2021-05-16 16:30:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1742 ms
[2021-05-16 16:30:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-16 16:30:20] [INFO ] Added : 62 causal constraints over 13 iterations in 511 ms. Result :sat
Minimization took 57 ms.
[2021-05-16 16:30:20] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 16:30:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-16 16:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:20] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-16 16:30:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 16:30:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-16 16:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:20] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-16 16:30:20] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2021-05-16 16:30:20] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2021-05-16 16:30:21] [INFO ] Deduced a trap composed of 27 places in 1360 ms of which 2 ms to minimize.
[2021-05-16 16:30:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1456 ms
[2021-05-16 16:30:21] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-16 16:30:22] [INFO ] Added : 62 causal constraints over 13 iterations in 178 ms. Result :sat
Minimization took 29 ms.
[2021-05-16 16:30:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:22] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 15 ms returned sat
[2021-05-16 16:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:22] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-16 16:30:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:30:22] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 14 ms returned sat
[2021-05-16 16:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:22] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-16 16:30:22] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2021-05-16 16:30:22] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2021-05-16 16:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-16 16:30:22] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-16 16:30:22] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2021-05-16 16:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-16 16:30:22] [INFO ] Added : 61 causal constraints over 14 iterations in 246 ms. Result :sat
Minimization took 199 ms.
[2021-05-16 16:30:23] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-16 16:30:23] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-16 16:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:23] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-16 16:30:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:30:23] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:23] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-16 16:30:23] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2021-05-16 16:30:23] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-16 16:30:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 5 ms to minimize.
[2021-05-16 16:30:23] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2021-05-16 16:30:23] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 1 ms to minimize.
[2021-05-16 16:30:25] [INFO ] Deduced a trap composed of 30 places in 1558 ms of which 26 ms to minimize.
[2021-05-16 16:30:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1758 ms
[2021-05-16 16:30:25] [INFO ] Added : 62 causal constraints over 13 iterations in 1907 ms. Result :sat
Minimization took 32 ms.
[2021-05-16 16:30:25] [INFO ] [Real]Absence check using 11 positive place invariants in 36 ms returned sat
[2021-05-16 16:30:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-16 16:30:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:30:25] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:25] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-16 16:30:25] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2021-05-16 16:30:25] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-16 16:30:25] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2021-05-16 16:30:25] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2021-05-16 16:30:25] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2021-05-16 16:30:25] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2021-05-16 16:30:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 185 ms
[2021-05-16 16:30:25] [INFO ] Added : 62 causal constraints over 13 iterations in 461 ms. Result :sat
Minimization took 32 ms.
[2021-05-16 16:30:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:25] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-16 16:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-16 16:30:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:26] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2021-05-16 16:30:26] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 1 ms to minimize.
[2021-05-16 16:30:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-16 16:30:26] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 16:30:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2021-05-16 16:30:26] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2021-05-16 16:30:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2021-05-16 16:30:26] [INFO ] Added : 63 causal constraints over 13 iterations in 288 ms. Result :sat
Minimization took 30 ms.
[2021-05-16 16:30:26] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2021-05-16 16:30:26] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:26] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-16 16:30:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:26] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-16 16:30:26] [INFO ] [Nat]Added 9 Read/Feed constraints in 0 ms returned sat
[2021-05-16 16:30:26] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2021-05-16 16:30:26] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 0 ms to minimize.
[2021-05-16 16:30:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2021-05-16 16:30:26] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-16 16:30:27] [INFO ] Added : 58 causal constraints over 12 iterations in 116 ms. Result :sat
Minimization took 20 ms.
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-16 16:30:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 52 ms.
[2021-05-16 16:30:27] [INFO ] Added : 44 causal constraints over 9 iterations in 139 ms. Result :sat
Minimization took 15 ms.
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-16 16:30:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-16 16:30:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2021-05-16 16:30:27] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 14 ms to minimize.
[2021-05-16 16:30:27] [INFO ] Deduced a trap composed of 33 places in 21 ms of which 1 ms to minimize.
[2021-05-16 16:30:27] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2021-05-16 16:30:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 182 ms
[2021-05-16 16:30:27] [INFO ] Added : 62 causal constraints over 13 iterations in 265 ms. Result :sat
Minimization took 39 ms.
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-16 16:30:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-16 16:30:27] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2021-05-16 16:30:27] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 0 ms to minimize.
[2021-05-16 16:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-16 16:30:27] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-16 16:30:28] [INFO ] Added : 62 causal constraints over 13 iterations in 166 ms. Result :sat
Minimization took 17 ms.
[2021-05-16 16:30:28] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:28] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-16 16:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:28] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-16 16:30:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-16 16:30:28] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-16 16:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:28] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-16 16:30:28] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2021-05-16 16:30:28] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2021-05-16 16:30:28] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2021-05-16 16:30:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2021-05-16 16:30:28] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-16 16:30:28] [INFO ] Added : 63 causal constraints over 13 iterations in 144 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 10, 2, 2, 10, 1, 1, 2, 2, 10, 2]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-16 16:30:28] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1412 transitions in 15 ms.
[2021-05-16 16:30:28] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13359389148773837257.dot
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :16
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :13
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :3
[2021-05-16 16:30:28] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2021-05-16 16:30:29] [INFO ] Computed 54 place invariants in 100 ms
[2021-05-16 16:30:29] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2021-05-16 16:30:29] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 30 ms returned sat
[2021-05-16 16:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:29] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-16 16:30:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2021-05-16 16:30:29] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned sat
[2021-05-16 16:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:33] [INFO ] [Nat]Absence check using state equation in 3692 ms returned sat
[2021-05-16 16:30:33] [INFO ] State equation strengthened by 130 read => feed constraints.
[2021-05-16 16:30:34] [INFO ] [Nat]Added 130 Read/Feed constraints in 953 ms returned sat
[2021-05-16 16:30:35] [INFO ] Deduced a trap composed of 65 places in 723 ms of which 1 ms to minimize.
[2021-05-16 16:30:35] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-16 16:30:35] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2021-05-16 16:30:35] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 34 ms returned unsat
[2021-05-16 16:30:35] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2021-05-16 16:30:35] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned sat
[2021-05-16 16:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 16:30:36] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2021-05-16 16:30:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 16:30:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2021-05-16 16:30:36] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 25 ms returned unsat
[2021-05-16 16:30:36] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2021-05-16 16:30:36] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 48 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1, 1] Max seen :[0, 1, 1, 1]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 752 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 182 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 342 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 502 place count 500 transition count 1162
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 522 place count 500 transition count 1142
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 542 place count 480 transition count 1142
Applied a total of 542 rules in 667 ms. Remains 480 /752 variables (removed 272) and now considering 1142/1412 (removed 270) transitions.
[2021-05-16 16:30:37] [INFO ] Flow matrix only has 1122 transitions (discarded 20 similar events)
// Phase 1: matrix 1122 rows 480 cols
[2021-05-16 16:30:37] [INFO ] Computed 52 place invariants in 94 ms
[2021-05-16 16:30:38] [INFO ] Dead Transitions using invariants and state equation in 1081 ms returned [1004, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1018, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1032, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1046, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1060, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1074, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1088, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1102, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1116, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1130, 1132, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1141]
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions :[1141, 1140, 1139, 1138, 1137, 1136, 1135, 1134, 1133, 1132, 1130, 1127, 1126, 1125, 1124, 1123, 1122, 1121, 1120, 1119, 1118, 1116, 1113, 1112, 1111, 1110, 1109, 1108, 1107, 1106, 1105, 1104, 1102, 1099, 1098, 1097, 1096, 1095, 1094, 1093, 1092, 1091, 1090, 1088, 1085, 1084, 1083, 1082, 1081, 1080, 1079, 1078, 1077, 1076, 1074, 1071, 1070, 1069, 1068, 1067, 1066, 1065, 1064, 1063, 1062, 1060, 1057, 1056, 1055, 1054, 1053, 1052, 1051, 1050, 1049, 1048, 1046, 1043, 1042, 1041, 1040, 1039, 1038, 1037, 1036, 1035, 1034, 1032, 1029, 1028, 1027, 1026, 1025, 1024, 1023, 1022, 1021, 1020, 1018, 1015, 1014, 1013, 1012, 1011, 1010, 1009, 1008, 1007, 1006, 1004]
Starting structural reductions, iteration 1 : 480/752 places, 1032/1412 transitions.
Reduce places removed 2 places and 20 transitions.
Graph (complete) has 3030 edges and 478 vertex of which 10 are kept as prefixes of interest. Removing 468 places using SCC suffix rule.19 ms
Discarding 468 places :
Also discarding 1002 output transitions
Drop transitions removed 1002 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 10
Reduce places removed 0 places and 10 transitions.
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 3 rules in 25 ms. Remains 10 /480 variables (removed 470) and now considering 0/1032 (removed 1032) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/752 places, 0/1412 transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.

BK_STOP 1621182639394

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T10, 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 r159-oct2-162089267800091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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