fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r090-tall-165260118100107
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for DoubleExponent-PT-002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
248.659 5476.00 11924.00 275.50 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r090-tall-165260118100107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is DoubleExponent-PT-002, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-tall-165260118100107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 33K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652718970011

Running Version 0
[2022-05-16 16:36:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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, 1800]
[2022-05-16 16:36:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:36:11] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2022-05-16 16:36:11] [INFO ] Transformed 110 places.
[2022-05-16 16:36:11] [INFO ] Transformed 98 transitions.
[2022-05-16 16:36:11] [INFO ] Parsed PT model containing 110 places and 98 transitions in 67 ms.
Starting structural reductions, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 106 transition count 74
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 52 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 52 place count 82 transition count 70
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 78 transition count 70
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 104 place count 56 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 54 transition count 48
Applied a total of 108 rules in 27 ms. Remains 54 /110 variables (removed 56) and now considering 48/98 (removed 50) transitions.
// Phase 1: matrix 48 rows 54 cols
[2022-05-16 16:36:11] [INFO ] Computed 11 place invariants in 15 ms
[2022-05-16 16:36:11] [INFO ] Implicit Places using invariants in 291 ms returned [36, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 315 ms to find 2 implicit places.
// Phase 1: matrix 48 rows 52 cols
[2022-05-16 16:36:11] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 16:36:11] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 52/110 places, 48/98 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 48 transition count 44
Applied a total of 8 rules in 7 ms. Remains 48 /52 variables (removed 4) and now considering 44/48 (removed 4) transitions.
// Phase 1: matrix 44 rows 48 cols
[2022-05-16 16:36:11] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 16:36:12] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 44 rows 48 cols
[2022-05-16 16:36:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 16:36:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 16:36:12] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/110 places, 44/98 transitions.
Discarding 10 transitions out of 44. Remains 34
[2022-05-16 16:36:12] [INFO ] Initial state test concluded for 1 properties.
Incomplete random walk after 10000 steps, including 1201 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 33) seen :19
Incomplete Best-First random walk after 10001 steps, including 752 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 741 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 762 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 728 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 768 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 743 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 735 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 764 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 757 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 743 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 735 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 731 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :4
Running SMT prover for 8 properties.
// Phase 1: matrix 44 rows 48 cols
[2022-05-16 16:36:12] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:36:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 16:36:12] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:36:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 117 ms
[2022-05-16 16:36:12] [INFO ] Computed and/alt/rep : 43/159/43 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:36:12] [INFO ] Added : 42 causal constraints over 9 iterations in 99 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Real]Added 4 Read/Feed constraints in 6 ms returned sat
[2022-05-16 16:36:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 6 places in 9 ms of which 0 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 31 ms
[2022-05-16 16:36:12] [INFO ] Computed and/alt/rep : 43/159/43 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 16:36:12] [INFO ] Added : 42 causal constraints over 9 iterations in 96 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:36:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:36:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Deduced a trap composed of 11 places in 10 ms of which 0 ms to minimize.
[2022-05-16 16:36:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 43 ms
[2022-05-16 16:36:12] [INFO ] Computed and/alt/rep : 43/159/43 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:36:13] [INFO ] Added : 42 causal constraints over 10 iterations in 71 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-16 16:36:13] [INFO ] Computed and/alt/rep : 43/159/43 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:36:13] [INFO ] Added : 35 causal constraints over 7 iterations in 43 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 31 ms
[2022-05-16 16:36:13] [INFO ] Computed and/alt/rep : 43/159/43 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:36:13] [INFO ] Added : 39 causal constraints over 8 iterations in 47 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 2 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 32 ms
[2022-05-16 16:36:13] [INFO ] Computed and/alt/rep : 43/159/43 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 16:36:13] [INFO ] Added : 42 causal constraints over 10 iterations in 70 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 11 places in 9 ms of which 0 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 41 ms
[2022-05-16 16:36:13] [INFO ] Computed and/alt/rep : 43/159/43 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:36:13] [INFO ] Added : 34 causal constraints over 7 iterations in 44 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:36:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Deduced a trap composed of 11 places in 10 ms of which 0 ms to minimize.
[2022-05-16 16:36:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 40 ms
[2022-05-16 16:36:13] [INFO ] Computed and/alt/rep : 43/159/43 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:36:13] [INFO ] Added : 35 causal constraints over 8 iterations in 52 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 12900 steps, including 1664 resets, run finished after 22 ms. (steps per millisecond=586 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6900 steps, including 912 resets, run finished after 11 ms. (steps per millisecond=627 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14600 steps, including 1935 resets, run finished after 47 ms. (steps per millisecond=310 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8800 steps, including 1221 resets, run finished after 10 ms. (steps per millisecond=880 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6800 steps, including 937 resets, run finished after 8 ms. (steps per millisecond=850 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14300 steps, including 1959 resets, run finished after 15 ms. (steps per millisecond=953 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11000 steps, including 1503 resets, run finished after 11 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6300 steps, including 842 resets, run finished after 7 ms. (steps per millisecond=900 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 14 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 44/44 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 43
Applied a total of 3 rules in 17 ms. Remains 47 /48 variables (removed 1) and now considering 43/44 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/48 places, 43/44 transitions.
[2022-05-16 16:36:14] [INFO ] Flatten gal took : 33 ms
[2022-05-16 16:36:14] [INFO ] Flatten gal took : 9 ms
[2022-05-16 16:36:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9131711443111161979.gal : 6 ms
[2022-05-16 16:36:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5302860830243070177.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9131711443111161979.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5302860830243070177.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality9131711443111161979.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5302860830243070177.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5302860830243070177.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :18 after 32
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :32 after 62
Reachability property qltransition_38 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :97 after 219
Reachability property qltransition_43 is true.
Reachability property qltransition_41 is true.
Reachability property qltransition_29 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :358 after 389
Reachability property qltransition_30 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :675 after 684
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1024 after 1026
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1560,0.048877,5252,2,1428,26,6469,7,0,235,5163,0
Total reachable state count : 1560

Verifying 8 reachability properties.
Reachability property qltransition_11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_11,1,0.049389,5516,2,48,26,6469,7,0,238,5163,0
Reachability property qltransition_15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_15,1,0.049956,5516,2,48,26,6469,8,0,241,5163,0
Reachability property qltransition_16 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_16,1,0.050508,5516,2,48,26,6469,9,0,243,5163,0
Reachability property qltransition_29 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_29,4,0.050809,5516,2,54,26,6469,10,0,246,5163,0
Reachability property qltransition_30 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_30,1,0.051089,5516,2,48,26,6469,11,0,249,5163,0
Reachability property qltransition_38 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_38,2,0.051622,5516,2,50,26,6469,12,0,252,5163,0
Reachability property qltransition_41 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_41,4,0.051884,5516,2,69,26,6469,13,0,254,5163,0
Reachability property qltransition_43 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
qltransition\_43,1,0.05215,5516,2,48,26,6469,14,0,257,5163,0
Able to resolve query QuasiLiveness after proving 34 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE

BK_STOP 1652718975487

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -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 1800 -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="DoubleExponent-PT-002"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2021"
echo " Input is DoubleExponent-PT-002, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r090-tall-165260118100107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;