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.r180-tall-165277027300034.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 Peterson-PT-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-165277027300034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 29K Apr 30 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 30 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 30 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 30 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.8K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 100K May 10 09:34 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 Liveness

=== Now, execution of the tool begins

BK_START 1652823998998

Running Version 0
[2022-05-17 21:46:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -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-17 21:46:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:46:40] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2022-05-17 21:46:40] [INFO ] Transformed 102 places.
[2022-05-17 21:46:40] [INFO ] Transformed 126 transitions.
[2022-05-17 21:46:40] [INFO ] Found NUPN structural information;
[2022-05-17 21:46:40] [INFO ] Parsed PT model containing 102 places and 126 transitions in 202 ms.
Built sparse matrix representations for Structural reductions in 5 ms.16959KB memory used
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 126/126 transitions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 21:46:40] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 21:46:40] [INFO ] Computed 11 place invariants in 13 ms
[2022-05-17 21:46:40] [INFO ] Implicit Places using invariants in 144 ms returned []
[2022-05-17 21:46:40] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 21:46:40] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 21:46:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-17 21:46:41] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2022-05-17 21:46:41] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 21:46:41] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 21:46:41] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 21:46:41] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 126/126 transitions.
Random walk for 1250000 steps, including 0 resets, run took 954 ms (no deadlock found). (steps per millisecond=1310 )
Random directed walk for 1250000 steps, including 0 resets, run took 702 ms (no deadlock found). (steps per millisecond=1780 )
[2022-05-17 21:46:42] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 21:46:42] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-17 21:46:42] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:42] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 11 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2022-05-17 21:46:42] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2022-05-17 21:46:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 21:46:43] [INFO ] Implicit Places using invariants in 50 ms returned [31, 33, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
[2022-05-17 21:46:43] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 39 cols
[2022-05-17 21:46:43] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 21:46:43] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 39/102 places, 66/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2022-05-17 21:46:43] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 39 cols
[2022-05-17 21:46:43] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 21:46:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 39/102 places, 66/126 transitions.
Discarding 3 transitions out of 66. Remains 63
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 63) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-05-17 21:46:43] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 39 cols
[2022-05-17 21:46:43] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 21:46:43] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-17 21:46:43] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2022-05-17 21:46:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
[2022-05-17 21:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-05-17 21:46:43] [INFO ] Computed and/alt/rep : 51/134/51 causal constraints (skipped 6 transitions) in 6 ms.
[2022-05-17 21:46:43] [INFO ] Added : 42 causal constraints over 9 iterations in 67 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
[2022-05-17 21:46:43] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2022-05-17 21:46:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2022-05-17 21:46:43] [INFO ] Computed and/alt/rep : 51/134/51 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-17 21:46:43] [INFO ] Added : 36 causal constraints over 8 iterations in 58 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] Computed and/alt/rep : 51/134/51 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-17 21:46:43] [INFO ] Added : 33 causal constraints over 7 iterations in 48 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] Deduced a trap composed of 10 places in 8 ms of which 1 ms to minimize.
[2022-05-17 21:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2022-05-17 21:46:43] [INFO ] Computed and/alt/rep : 51/134/51 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-17 21:46:43] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2022-05-17 21:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-17 21:46:43] [INFO ] Added : 33 causal constraints over 7 iterations in 77 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 21:46:43] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-17 21:46:44] [INFO ] Computed and/alt/rep : 51/134/51 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-17 21:46:44] [INFO ] Added : 36 causal constraints over 8 iterations in 49 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 21:46:44] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:44] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 11 places in 10 ms of which 1 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-17 21:46:44] [INFO ] Computed and/alt/rep : 51/134/51 causal constraints (skipped 6 transitions) in 3 ms.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 7 places in 11 ms of which 1 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 11 places in 12 ms of which 1 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 40 ms
[2022-05-17 21:46:44] [INFO ] Added : 40 causal constraints over 8 iterations in 84 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 21:46:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Real]Added 26 Read/Feed constraints in 11 ms returned sat
[2022-05-17 21:46:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] Computed and/alt/rep : 51/134/51 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-17 21:46:44] [INFO ] Added : 24 causal constraints over 6 iterations in 92 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 21:46:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Real]Added 26 Read/Feed constraints in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 21:46:44] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 11 places in 11 ms of which 1 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 10 places in 11 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 6 places in 11 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 7 places in 7 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 108 ms
[2022-05-17 21:46:44] [INFO ] Computed and/alt/rep : 51/134/51 causal constraints (skipped 6 transitions) in 4 ms.
[2022-05-17 21:46:44] [INFO ] Added : 30 causal constraints over 6 iterations in 37 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 8500 steps, including 484 resets, run finished after 16 ms. (steps per millisecond=531 ) properties (out of 8) seen :1 could not realise parikh vector
Incomplete Parikh walk after 7800 steps, including 530 resets, run finished after 13 ms. (steps per millisecond=600 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4700 steps, including 306 resets, run finished after 9 ms. (steps per millisecond=522 ) properties (out of 7) seen :1 could not realise parikh vector
Incomplete Parikh walk after 5800 steps, including 398 resets, run finished after 10 ms. (steps per millisecond=580 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5500 steps, including 310 resets, run finished after 9 ms. (steps per millisecond=611 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 7800 steps, including 642 resets, run finished after 13 ms. (steps per millisecond=600 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3000 steps, including 218 resets, run finished after 5 ms. (steps per millisecond=600 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4400 steps, including 325 resets, run finished after 4 ms. (steps per millisecond=1100 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 12 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 66/66 transitions.
[2022-05-17 21:46:44] [INFO ] Flatten gal took : 28 ms
[2022-05-17 21:46:44] [INFO ] Flatten gal took : 9 ms
[2022-05-17 21:46:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17728709784144369608.gal : 6 ms
[2022-05-17 21:46:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4158383443618819521.prop : 1 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/ReachabilityCardinality17728709784144369608.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4158383443618819521.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/ReachabilityCardinality17728709784144369608.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4158383443618819521.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4158383443618819521.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 30
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :30 after 145
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :145 after 246
Reachability property qltransition_64 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :246 after 572
Reachability property qltransition_61 is true.
Reachability property qltransition_52 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :572 after 816
Reachability property qltransition_54 is true.
Reachability property qltransition_29 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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,1254,0.045705,4868,2,698,20,4557,6,0,225,3916,0
Total reachable state count : 1254

Verifying 6 reachability properties.
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.04636,5132,2,40,20,4557,7,0,231,3916,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,1,0.047154,5132,2,40,20,4557,8,0,236,3916,0
Reachability property qltransition_52 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\_52,22,0.047446,5132,2,104,20,4557,9,0,241,3916,0
Reachability property qltransition_54 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\_54,25,0.04771,5132,2,127,20,4557,10,0,246,3916,0
Reachability property qltransition_61 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\_61,5,0.048067,5132,2,69,20,4557,11,0,251,3916,0
Reachability property qltransition_64 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\_64,4,0.048351,5132,2,64,20,4557,12,0,256,3916,0
Able to resolve query QuasiLiveness after proving 63 properties.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 6 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2022-05-17 21:46:44] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2022-05-17 21:46:44] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 21:46:45] [INFO ] Implicit Places using invariants in 30 ms returned [31, 33, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
[2022-05-17 21:46:45] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 39 cols
[2022-05-17 21:46:45] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 21:46:45] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Starting structural reductions, iteration 1 : 39/102 places, 66/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2022-05-17 21:46:45] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 39 cols
[2022-05-17 21:46:45] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 21:46:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 39/102 places, 66/126 transitions.
Discarding 3 transitions out of 66. Remains 63
[2022-05-17 21:46:45] [INFO ] Flatten gal took : 8 ms
[2022-05-17 21:46:45] [INFO ] Flatten gal took : 8 ms
[2022-05-17 21:46:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2933104459716956332.gal : 2 ms
[2022-05-17 21:46:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13400961112097432825.ctl : 2 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2933104459716956332.gal, -t, CGAL, -ctl, /tmp/CTLFireability13400961112097432825.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2933104459716956332.gal -t CGAL -ctl /tmp/CTLFireability13400961112097432825.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 63 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1254,0.032899,5212,2,698,5,4250,6,0,225,4040,0


Converting to forward existential form...Done !
original formula: AG(EF(((TestTurn_1_1==1)&&(Turn_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((TestTurn_1_1==1)&&(Turn_1_0==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions UpdateTurn_0_0_0, UpdateTurn_1_0_0, UpdateTurn_1_1_0, UpdateTurn_2_1_0, UpdateTurn_2_0_0, UpdateTurn_0_1_0, UpdateTurn_1_2_0, UpdateTurn_0_2_0, UpdateTurn_2_2_0, Loop_0_1_0.ContinueLoop_0_2_0.NoIdentity_0_2_0.NotAlone_0_2_0, Loop_2_0_1.ContinueLoop_2_1_1.NoIdentity_2_1_1.NotAlone_2_1_1, Loop_2_0_0.ContinueLoop_2_1_0.NoIdentity_2_1_0.NotAlone_2_1_0, Loop_1_0_1.ContinueLoop_1_1_1.Identity_1_1.Loop_1_1_1.ContinueLoop_1_2_1.NoIdentity_1_2_1.NotAlone_1_2_1, Loop_0_1_1.ContinueLoop_0_2_1.NoIdentity_0_2_1.NotAlone_0_2_1, Loop_1_0_0.ContinueLoop_1_1_0.Identity_1_0.Loop_1_1_0.ContinueLoop_1_2_0.NoIdentity_1_2_0.NotAlone_1_2_0, AccessCS_0.BecomeIdle_0, AccessCS_1.BecomeIdle_1, ProgressTurn_1_0.UpdateTurn_1_2_1, ProgressTurn_1_0.UpdateTurn_1_0_1, ProgressTurn_1_0.UpdateTurn_1_1_1, ProgressTurn_2_0.UpdateTurn_2_1_1, ProgressTurn_2_0.UpdateTurn_2_2_1, ProgressTurn_2_0.UpdateTurn_2_0_1, ProgressTurn_0_0.UpdateTurn_0_2_1, ProgressTurn_0_0.UpdateTurn_0_1_1, ProgressTurn_0_0.UpdateTurn_0_0_1, AccessCS_2.BecomeIdle_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/39/27/66
(forward)formula 0,0,0.234573,14160,1,0,209,57046,153,91,1517,42477,195
FORMULA Liveness FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1652824006639

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -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 Liveness -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="Peterson-PT-2"
export BK_EXAMINATION="Liveness"
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 Peterson-PT-2, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-165277027300034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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