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.r168-tall-165277016200075.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-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K 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 535K 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

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

=== Now, execution of the tool begins

BK_START 1652782470122

Running Version 202205111006
[2022-05-17 10:14:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 10:14:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:14:31] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-05-17 10:14:31] [INFO ] Transformed 834 places.
[2022-05-17 10:14:31] [INFO ] Transformed 1242 transitions.
[2022-05-17 10:14:31] [INFO ] Found NUPN structural information;
[2022-05-17 10:14:31] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-05-17 10:14:31] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 273 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-5-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 767 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 26 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:14:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:31] [INFO ] Computed 23 place invariants in 21 ms
[2022-05-17 10:14:32] [INFO ] Implicit Places using invariants in 365 ms returned []
[2022-05-17 10:14:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:32] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 10:14:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:33] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2022-05-17 10:14:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:33] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:14:33] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Support contains 767 out of 834 places after structural reductions.
[2022-05-17 10:14:34] [INFO ] Flatten gal took : 99 ms
[2022-05-17 10:14:34] [INFO ] Flatten gal took : 62 ms
[2022-05-17 10:14:34] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-17 10:14:35] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:35] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:14:35] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 10:14:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 10:14:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-17 10:14:36] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2022-05-17 10:14:36] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:36] [INFO ] After 241ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2022-05-17 10:14:36] [INFO ] Deduced a trap composed of 83 places in 262 ms of which 5 ms to minimize.
[2022-05-17 10:14:37] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 2 ms to minimize.
[2022-05-17 10:14:37] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 1 ms to minimize.
[2022-05-17 10:14:37] [INFO ] Deduced a trap composed of 70 places in 245 ms of which 1 ms to minimize.
[2022-05-17 10:14:38] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 1 ms to minimize.
[2022-05-17 10:14:38] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 1 ms to minimize.
[2022-05-17 10:14:38] [INFO ] Deduced a trap composed of 92 places in 242 ms of which 1 ms to minimize.
[2022-05-17 10:14:39] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 1 ms to minimize.
[2022-05-17 10:14:39] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 0 ms to minimize.
[2022-05-17 10:14:39] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2022-05-17 10:14:40] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 1 ms to minimize.
[2022-05-17 10:14:40] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 1 ms to minimize.
[2022-05-17 10:14:40] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 1 ms to minimize.
[2022-05-17 10:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 4054 ms
[2022-05-17 10:14:41] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 0 ms to minimize.
[2022-05-17 10:14:41] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2022-05-17 10:14:41] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2022-05-17 10:14:41] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 0 ms to minimize.
[2022-05-17 10:14:42] [INFO ] Deduced a trap composed of 126 places in 227 ms of which 1 ms to minimize.
[2022-05-17 10:14:42] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 0 ms to minimize.
[2022-05-17 10:14:42] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 0 ms to minimize.
[2022-05-17 10:14:43] [INFO ] Deduced a trap composed of 84 places in 240 ms of which 1 ms to minimize.
[2022-05-17 10:14:43] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 1 ms to minimize.
[2022-05-17 10:14:43] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 0 ms to minimize.
[2022-05-17 10:14:43] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 0 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 1 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 0 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 0 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 0 ms to minimize.
[2022-05-17 10:14:44] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3915 ms
[2022-05-17 10:14:44] [INFO ] After 8443ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-05-17 10:14:44] [INFO ] After 9433ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 3 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 834 transition count 885
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 1 with 357 rules applied. Total rules applied 714 place count 477 transition count 885
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 714 place count 477 transition count 705
Deduced a syphon composed of 180 places in 3 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1074 place count 297 transition count 705
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1132 place count 268 transition count 676
Applied a total of 1132 rules in 105 ms. Remains 268 /834 variables (removed 566) and now considering 676/1242 (removed 566) transitions.
Finished structural reductions, in 1 iterations. Remains : 268/834 places, 676/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 843325 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 843325 steps, saw 122942 distinct states, run finished after 3003 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 10:14:48] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 268 cols
[2022-05-17 10:14:48] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 10:14:48] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:14:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 10:14:48] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 10:14:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 10:14:48] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 10:14:48] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 10:14:48] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:48] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 10:14:48] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2022-05-17 10:14:48] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2022-05-17 10:14:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1018 ms
[2022-05-17 10:14:49] [INFO ] After 1132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-17 10:14:49] [INFO ] After 1395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 268/268 places, 676/676 transitions.
Applied a total of 0 rules in 23 ms. Remains 268 /268 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 268/268 places, 676/676 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 268/268 places, 676/676 transitions.
Applied a total of 0 rules in 16 ms. Remains 268 /268 variables (removed 0) and now considering 676/676 (removed 0) transitions.
[2022-05-17 10:14:49] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 268 cols
[2022-05-17 10:14:49] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 10:14:50] [INFO ] Implicit Places using invariants in 181 ms returned [232, 244, 245, 246, 247, 248]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 184 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 262/268 places, 676/676 transitions.
Applied a total of 0 rules in 16 ms. Remains 262 /262 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 262/268 places, 676/676 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 787731 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :{}
Probabilistic random walk after 787731 steps, saw 115914 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 10:14:53] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 262 cols
[2022-05-17 10:14:53] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 10:14:53] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:14:53] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 10:14:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 10:14:53] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 10:14:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:53] [INFO ] After 58ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2022-05-17 10:14:53] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 0 ms to minimize.
[2022-05-17 10:14:54] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2022-05-17 10:14:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1474 ms
[2022-05-17 10:14:55] [INFO ] After 1582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-17 10:14:55] [INFO ] After 1812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 262 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 262/262 places, 676/676 transitions.
Applied a total of 0 rules in 26 ms. Remains 262 /262 variables (removed 0) and now considering 676/676 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 262/262 places, 676/676 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 262/262 places, 676/676 transitions.
Applied a total of 0 rules in 12 ms. Remains 262 /262 variables (removed 0) and now considering 676/676 (removed 0) transitions.
[2022-05-17 10:14:55] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 262 cols
[2022-05-17 10:14:55] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:14:55] [INFO ] Implicit Places using invariants in 226 ms returned []
[2022-05-17 10:14:55] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 262 cols
[2022-05-17 10:14:55] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:14:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:14:56] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2022-05-17 10:14:56] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-17 10:14:56] [INFO ] Flow matrix only has 556 transitions (discarded 120 similar events)
// Phase 1: matrix 556 rows 262 cols
[2022-05-17 10:14:56] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 10:14:56] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 262/262 places, 676/676 transitions.
Graph (trivial) has 507 edges and 262 vertex of which 175 / 262 are part of one of the 30 SCC in 3 ms
Free SCC test removed 145 places
Drop transitions removed 290 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 437 transitions.
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 27 Pre rules applied. Total rules applied 1 place count 117 transition count 212
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 55 place count 90 transition count 212
Performed 4 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 63 place count 86 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 86 transition count 205
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 87 place count 72 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 39 edges and 72 vertex of which 37 / 72 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 41 transition count 207
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 180 edges and 37 vertex of which 19 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.12 ms
Discarding 18 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Graph (trivial) has 72 edges and 19 vertex of which 8 / 19 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 2 with 43 rules applied. Total rules applied 133 place count 13 transition count 110
Drop transitions removed 54 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 3 with 84 rules applied. Total rules applied 217 place count 13 transition count 26
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 223 place count 13 transition count 20
Graph (complete) has 24 edges and 13 vertex of which 7 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 224 place count 7 transition count 16
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 232 place count 7 transition count 8
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 236 place count 5 transition count 6
Applied a total of 236 rules in 29 ms. Remains 5 /262 variables (removed 257) and now considering 6/676 (removed 670) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 5 cols
[2022-05-17 10:14:56] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 10:14:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 10:14:56] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-17 10:14:56] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 10:14:56] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2022-05-17 10:14:56] [INFO ] Flatten gal took : 0 ms
[2022-05-17 10:14:56] [INFO ] Flatten gal took : 1 ms
[2022-05-17 10:14:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15162937143621485601.gal : 0 ms
[2022-05-17 10:14:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2310753742702377616.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15366481315442175240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15162937143621485601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2310753742702377616.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2310753742702377616.prop.
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,6,0.016408,3756,2,9,5,33,8,0,33,20,0
Total reachable state count : 6

Verifying 2 reachability properties.
Reachability property AtomicPropp14 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
AtomicPropp14,1,0.016612,3756,2,6,6,33,8,0,36,20,0
Reachability property AtomicPropp16 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
AtomicPropp16,1,0.016712,3756,2,6,7,33,8,0,37,20,0
FORMULA Peterson-PT-5-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA Peterson-PT-5-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p0)&&G(p1)&&p2))||(F(X(p0))&&p3))))'
Support contains 360 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:14:56] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:56] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:14:57] [INFO ] Implicit Places using invariants in 333 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 336 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ (ADD s381 s382 s383 s384 s385 s386 s387 s388 s393 s394 s396 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3305 reset in 595 ms.
Stack based approach found an accepted trace after 3989 steps with 135 reset with depth 29 and stack size 29 in 23 ms.
FORMULA Peterson-PT-5-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-01 finished in 1362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(X(X(p1))))&&F(G(!p1)))))'
Support contains 186 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:14:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:58] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 10:14:58] [INFO ] Implicit Places using invariants in 311 ms returned []
[2022-05-17 10:14:58] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:14:58] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:14:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:15:00] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
[2022-05-17 10:15:00] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:00] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-17 10:15:01] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, true, true, (NOT p0), true, true, true, (NOT p1), p1]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}, { cond=true, acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 8}, { cond=p1, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(GT 3 (ADD s785 s805 s806 s807 s808 s809)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-5-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLCardinality-02 finished in 3301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 360 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 5 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:15:01] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:01] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 10:15:01] [INFO ] Implicit Places using invariants in 340 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 341 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s205 s206 s207 s208 s209 s210 s211 s212 s214 s215 s216 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-5-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-5-LTLCardinality-04 finished in 454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 30 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 834 transition count 887
Reduce places removed 355 places and 0 transitions.
Iterating post reduction 1 with 355 rules applied. Total rules applied 710 place count 479 transition count 887
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 710 place count 479 transition count 732
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 1020 place count 324 transition count 732
Applied a total of 1020 rules in 58 ms. Remains 324 /834 variables (removed 510) and now considering 732/1242 (removed 510) transitions.
[2022-05-17 10:15:02] [INFO ] Flow matrix only has 612 transitions (discarded 120 similar events)
// Phase 1: matrix 612 rows 324 cols
[2022-05-17 10:15:02] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 10:15:02] [INFO ] Implicit Places using invariants in 379 ms returned [275, 295, 296, 297, 298, 299]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 381 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/834 places, 732/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 318 /318 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 318/834 places, 732/1242 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s145 s146 s147 s148 s149 s150 s151 s152 s156 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s183 s187 s188 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 258 ms.
Product exploration explored 100000 steps with 3 reset in 322 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 30 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 732/732 transitions.
Applied a total of 0 rules in 16 ms. Remains 318 /318 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2022-05-17 10:15:03] [INFO ] Flow matrix only has 612 transitions (discarded 120 similar events)
// Phase 1: matrix 612 rows 318 cols
[2022-05-17 10:15:03] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 10:15:03] [INFO ] Implicit Places using invariants in 198 ms returned []
[2022-05-17 10:15:03] [INFO ] Flow matrix only has 612 transitions (discarded 120 similar events)
// Phase 1: matrix 612 rows 318 cols
[2022-05-17 10:15:03] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-17 10:15:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 10:15:04] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2022-05-17 10:15:04] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 10:15:04] [INFO ] Flow matrix only has 612 transitions (discarded 120 similar events)
// Phase 1: matrix 612 rows 318 cols
[2022-05-17 10:15:04] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 10:15:04] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/318 places, 732/732 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 237 ms.
Stack based approach found an accepted trace after 128 steps with 1 reset with depth 47 and stack size 46 in 2 ms.
FORMULA Peterson-PT-5-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-07 finished in 4043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!(F(p0)||X(p0)))) U p1)))'
Support contains 2 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 834 transition count 884
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 476 transition count 884
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 716 place count 476 transition count 704
Deduced a syphon composed of 180 places in 5 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1136 place count 266 transition count 674
Applied a total of 1136 rules in 73 ms. Remains 266 /834 variables (removed 568) and now considering 674/1242 (removed 568) transitions.
[2022-05-17 10:15:06] [INFO ] Flow matrix only has 554 transitions (discarded 120 similar events)
// Phase 1: matrix 554 rows 266 cols
[2022-05-17 10:15:06] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 10:15:06] [INFO ] Implicit Places using invariants in 186 ms returned [230, 242, 243, 244, 245, 246]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 191 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/834 places, 674/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 260 /260 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 260/834 places, 674/1242 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s226 1), p0:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 189 ms.
Stack based approach found an accepted trace after 670 steps with 0 reset with depth 671 and stack size 531 in 2 ms.
FORMULA Peterson-PT-5-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-10 finished in 621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 10:15:06] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 10:15:06] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:15:06] [INFO ] Implicit Places using invariants in 304 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 306 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s820 0) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 621 ms.
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-5-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-5-LTLCardinality-11 finished in 1752 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p0 U p1)))'
Support contains 4 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 834 transition count 885
Reduce places removed 357 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 359 rules applied. Total rules applied 716 place count 477 transition count 883
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 177 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 177 Pre rules applied. Total rules applied 718 place count 475 transition count 706
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 1072 place count 298 transition count 706
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1130 place count 269 transition count 677
Applied a total of 1130 rules in 37 ms. Remains 269 /834 variables (removed 565) and now considering 677/1242 (removed 565) transitions.
[2022-05-17 10:15:08] [INFO ] Flow matrix only has 557 transitions (discarded 120 similar events)
// Phase 1: matrix 557 rows 269 cols
[2022-05-17 10:15:08] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:15:08] [INFO ] Implicit Places using invariants in 170 ms returned [233, 245, 246, 247, 249]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 172 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 264/834 places, 677/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 264 /264 variables (removed 0) and now considering 677/677 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 264/834 places, 677/1242 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-5-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s244 0) (EQ s181 1)), p1:(OR (EQ s136 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 14308 reset in 275 ms.
Stack based approach found an accepted trace after 162 steps with 20 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Peterson-PT-5-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-5-LTLCardinality-14 finished in 620 ms.
All properties solved by simple procedures.
Total runtime 37769 ms.

BK_STOP 1652782509107

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016200075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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