Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950400429.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBLF-COL-S04J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950400429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.3K Feb 26 14:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 14:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679522271263

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 21:57:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 21:57:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:57:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 21:57:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 21:57:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 586 ms
[2023-03-22 21:57:53] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 21:57:53] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-22 21:57:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 21:57:53] [INFO ] Computed 26 place invariants in 16 ms
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 21:57:53] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 21:57:53] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 21:57:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 21:57:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 21:57:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 21:57:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 21:57:54] [INFO ] Added : 54 causal constraints over 11 iterations in 103 ms. Result :sat
Minimization took 22 ms.
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 21:57:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 21:57:54] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 7 ms to minimize.
[2023-03-22 21:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-22 21:57:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 21:57:54] [INFO ] Added : 54 causal constraints over 11 iterations in 106 ms. Result :sat
Minimization took 25 ms.
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 1 ms returned unsat
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 21:57:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 21:57:55] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2023-03-22 21:57:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-22 21:57:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 21:57:55] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-22 21:57:55] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2023-03-22 21:57:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-22 21:57:55] [INFO ] Added : 58 causal constraints over 12 iterations in 206 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 21:57:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-22 21:57:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 21:57:55] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 21:57:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 21:57:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 21:57:55] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 21:57:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:55] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 21:57:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 21:57:55] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 21:57:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2023-03-22 21:57:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2023-03-22 21:57:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-22 21:57:56] [INFO ] Added : 54 causal constraints over 11 iterations in 191 ms. Result :sat
Minimization took 22 ms.
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 21:57:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 21:57:56] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2023-03-22 21:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-22 21:57:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 21:57:56] [INFO ] Added : 58 causal constraints over 12 iterations in 105 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-22 21:57:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2023-03-22 21:57:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 21:57:56] [INFO ] Added : 54 causal constraints over 11 iterations in 95 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 21:57:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:56] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 21:57:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 21:57:56] [INFO ] Added : 31 causal constraints over 7 iterations in 55 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 21:57:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 21:57:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 21:57:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:57] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 21:57:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 18 ms returned sat
[2023-03-22 21:57:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 21:57:57] [INFO ] Added : 61 causal constraints over 14 iterations in 106 ms. Result :sat
Minimization took 46 ms.
[2023-03-22 21:57:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 21:57:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 21:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 21:57:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:57:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 21:57:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 21:57:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:57:57] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 21:57:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 21:57:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 21:57:57] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 10, 8, 1, 4, 8, 8, 4, 1, 150, 4]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-22 21:57:57] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 96 ms.
[2023-03-22 21:57:57] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 11) seen :17
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :16
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :12
[2023-03-22 21:57:58] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2023-03-22 21:57:58] [INFO ] Computed 58 place invariants in 111 ms
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 26 ms returned unsat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 25 ms returned unsat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 26 ms returned unsat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 33 ms returned unsat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 21:57:58] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 36 ms returned unsat
[2023-03-22 21:57:59] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2023-03-22 21:57:59] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 25 ms returned unsat
[2023-03-22 21:57:59] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 21:57:59] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 26 ms returned unsat
[2023-03-22 21:57:59] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-22 21:57:59] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 31 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 2, 1, 1, 1, 4] Max seen :[1, 1, 1, 2, 1, 1, 1, 4]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6137 ms.
ITS solved all properties within timeout

BK_STOP 1679522280241

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-S04J06T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S04J06T08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950400429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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