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

About the Execution of ITS-Tools for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1525.884 54535.00 109836.00 134.50 F 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.r175-tall-165277023800039.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 itstools
Input is Peterson-PT-3, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277023800039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 44K Apr 30 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 30 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 30 09:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 30 09:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K 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 143K 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 1652803337847

Running Version 202205111006
[2022-05-17 16:02:18] [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 16:02:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:02:19] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2022-05-17 16:02:19] [INFO ] Transformed 244 places.
[2022-05-17 16:02:19] [INFO ] Transformed 332 transitions.
[2022-05-17 16:02:19] [INFO ] Found NUPN structural information;
[2022-05-17 16:02:19] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2022-05-17 16:02:19] [INFO ] Parsed PT model containing 244 places and 332 transitions in 199 ms.
Built sparse matrix representations for Structural reductions in 6 ms.15904KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 244/244 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 22 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 244/244 places, 332/332 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 244/244 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 16:02:19] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 16:02:19] [INFO ] Computed 15 place invariants in 20 ms
[2022-05-17 16:02:19] [INFO ] Implicit Places using invariants in 223 ms returned []
[2022-05-17 16:02:19] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 16:02:19] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-17 16:02:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 16:02:19] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2022-05-17 16:02:19] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-17 16:02:19] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 16:02:19] [INFO ] Computed 15 place invariants in 5 ms
[2022-05-17 16:02:19] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 244/244 places, 332/332 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1193 ms (no deadlock found). (steps per millisecond=1047 )
Random directed walk for 1250000 steps, including 0 resets, run took 1376 ms (no deadlock found). (steps per millisecond=908 )
[2022-05-17 16:02:22] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 16:02:22] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-17 16:02:22] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-17 16:02:22] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 34 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2022-05-17 16:02:22] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2022-05-17 16:02:22] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-17 16:02:22] [INFO ] Implicit Places using invariants in 67 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 69 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
Incomplete random walk after 10000 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=17 ) properties (out of 172) seen :113
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 59) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 53) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
[2022-05-17 16:02:23] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 84 cols
[2022-05-17 16:02:23] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 16:02:23] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-17 16:02:24] [INFO ] After 247ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:35
[2022-05-17 16:02:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 16:02:24] [INFO ] After 14ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:36
[2022-05-17 16:02:24] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:36
[2022-05-17 16:02:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-17 16:02:24] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :36
[2022-05-17 16:02:24] [INFO ] After 189ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :36
[2022-05-17 16:02:24] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
[2022-05-17 16:02:24] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2022-05-17 16:02:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2022-05-17 16:02:24] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2022-05-17 16:02:24] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
[2022-05-17 16:02:24] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2022-05-17 16:02:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 158 ms
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 200 ms
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 281 ms
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2022-05-17 16:02:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 129 ms
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 128 ms
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 4 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-05-17 16:02:26] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2022-05-17 16:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-17 16:02:26] [INFO ] After 2189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :36
Attempting to minimize the solution found.
Minimization took 266 ms.
[2022-05-17 16:02:26] [INFO ] After 2828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :36
Parikh walk visited 0 properties in 632 ms.
Support contains 42 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 176/176 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 22313 ms. (steps per millisecond=44 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=200 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=229 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 516 ms. (steps per millisecond=193 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=210 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=195 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=182 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=191 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=192 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 518 ms. (steps per millisecond=193 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=200 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=205 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=198 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=199 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=202 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=195 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=202 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=202 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=203 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=199 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=207 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=208 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=206 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=206 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=206 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=201 ) properties (out of 33) seen :0
Finished probabilistic random walk after 121825 steps, run visited all 33 properties in 733 ms. (steps per millisecond=166 )
Probabilistic random walk after 121825 steps, saw 24599 distinct states, run finished after 733 ms. (steps per millisecond=166 ) properties seen :33
Able to resolve query QuasiLiveness after proving 172 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 11 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2022-05-17 16:03:07] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2022-05-17 16:03:07] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 16:03:07] [INFO ] Implicit Places using invariants in 92 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 94 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
[2022-05-17 16:03:07] [INFO ] Flatten gal took : 44 ms
[2022-05-17 16:03:07] [INFO ] Flatten gal took : 17 ms
[2022-05-17 16:03:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10120704942826068222.gal : 8 ms
[2022-05-17 16:03:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10646900099515156268.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10120704942826068222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10646900099515156268.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 172 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,66846,0.865656,34752,2,7603,5,94358,6,0,515,109754,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2022-05-17 16:03:10] [INFO ] Flatten gal took : 14 ms
[2022-05-17 16:03:10] [INFO ] Applying decomposition
[2022-05-17 16:03:10] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17944842959355294751.txt' '-o' '/tmp/graph17944842959355294751.bin' '-w' '/tmp/graph17944842959355294751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17944842959355294751.bin' '-l' '-1' '-v' '-w' '/tmp/graph17944842959355294751.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:03:11] [INFO ] Decomposing Gal with order
[2022-05-17 16:03:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:03:11] [INFO ] Removed a total of 172 redundant transitions.
[2022-05-17 16:03:11] [INFO ] Flatten gal took : 54 ms
[2022-05-17 16:03:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 8 ms.
[2022-05-17 16:03:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14565596710968033200.gal : 5 ms
[2022-05-17 16:03:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1482871923913215151.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14565596710968033200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1482871923913215151.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 172 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,66846,0.652643,26132,819,225,36856,1322,433,59877,103,8641,0


Converting to forward existential form...Done !
original formula: AG(EF(((u11.TestTurn_1_0==1)&&(u10.Turn_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u11.TestTurn_1_0==1)&&(u10.Turn_0_0==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions UpdateTurn_3_2_0, UpdateTurn_0_3_0, UpdateTurn_1_2_0, UpdateTurn_3_1_0, UpdateTurn_0_2_0, Upd...2917
(forward)formula 0,0,1.19349,36544,1,0,57170,4277,1665,82509,459,17899,208073
FORMULA Liveness FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 53399 ms.

BK_STOP 1652803392382

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-3"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-3, 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 r175-tall-165277023800039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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 ;