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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 47K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 30 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 388K Apr 30 09:22 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 26K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K 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 298K 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-4-LTLFireability-00
FORMULA_NAME Peterson-PT-4-LTLFireability-01
FORMULA_NAME Peterson-PT-4-LTLFireability-02
FORMULA_NAME Peterson-PT-4-LTLFireability-03
FORMULA_NAME Peterson-PT-4-LTLFireability-04
FORMULA_NAME Peterson-PT-4-LTLFireability-05
FORMULA_NAME Peterson-PT-4-LTLFireability-06
FORMULA_NAME Peterson-PT-4-LTLFireability-07
FORMULA_NAME Peterson-PT-4-LTLFireability-08
FORMULA_NAME Peterson-PT-4-LTLFireability-09
FORMULA_NAME Peterson-PT-4-LTLFireability-10
FORMULA_NAME Peterson-PT-4-LTLFireability-11
FORMULA_NAME Peterson-PT-4-LTLFireability-12
FORMULA_NAME Peterson-PT-4-LTLFireability-13
FORMULA_NAME Peterson-PT-4-LTLFireability-14
FORMULA_NAME Peterson-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652782190647

Running Version 202205111006
[2022-05-17 10:09:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:09:52] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-05-17 10:09:52] [INFO ] Transformed 480 places.
[2022-05-17 10:09:52] [INFO ] Transformed 690 transitions.
[2022-05-17 10:09:52] [INFO ] Found NUPN structural information;
[2022-05-17 10:09:52] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2022-05-17 10:09:52] [INFO ] Parsed PT model containing 480 places and 690 transitions in 234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Peterson-PT-4-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 242 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 37 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 10:09:52] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:09:52] [INFO ] Computed 19 place invariants in 29 ms
[2022-05-17 10:09:52] [INFO ] Implicit Places using invariants in 290 ms returned []
[2022-05-17 10:09:52] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:09:52] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-17 10:09:52] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:09:52] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2022-05-17 10:09:52] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:09:52] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-17 10:09:53] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
Support contains 242 out of 480 places after structural reductions.
[2022-05-17 10:09:53] [INFO ] Flatten gal took : 70 ms
[2022-05-17 10:09:53] [INFO ] Flatten gal took : 43 ms
[2022-05-17 10:09:53] [INFO ] Input system was already deterministic with 690 transitions.
Support contains 162 out of 480 places (down from 242) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 23) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-17 10:09:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:09:54] [INFO ] Computed 19 place invariants in 11 ms
[2022-05-17 10:09:54] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 10:09:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:09:54] [INFO ] After 267ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2022-05-17 10:09:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:09:54] [INFO ] After 145ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 10:09:54] [INFO ] After 634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 10:09:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 10:09:55] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:09:55] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 10:09:55] [INFO ] After 145ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-17 10:09:55] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 4 ms to minimize.
[2022-05-17 10:09:55] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 2 ms to minimize.
[2022-05-17 10:09:56] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2022-05-17 10:09:56] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2022-05-17 10:09:56] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2022-05-17 10:09:56] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 1 ms to minimize.
[2022-05-17 10:09:56] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 1 ms to minimize.
[2022-05-17 10:09:56] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2022-05-17 10:09:57] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2022-05-17 10:09:57] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 1 ms to minimize.
[2022-05-17 10:09:57] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 0 ms to minimize.
[2022-05-17 10:09:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1800 ms
[2022-05-17 10:09:57] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 1 ms to minimize.
[2022-05-17 10:09:57] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 0 ms to minimize.
[2022-05-17 10:09:57] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 1 ms to minimize.
[2022-05-17 10:09:57] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2022-05-17 10:09:58] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 0 ms to minimize.
[2022-05-17 10:09:58] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2022-05-17 10:09:58] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2022-05-17 10:09:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 993 ms
[2022-05-17 10:09:58] [INFO ] After 3130ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 154 ms.
[2022-05-17 10:09:58] [INFO ] After 3730ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 199 rules applied. Total rules applied 396 place count 283 transition count 491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 398 place count 281 transition count 393
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 594 place count 183 transition count 393
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 79 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/480 places, 375/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 694374 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 694374 steps, saw 116170 distinct states, run finished after 3003 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 10:10:02] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2022-05-17 10:10:02] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 10:10:02] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 10:10:02] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:02] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-17 10:10:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:02] [INFO ] After 42ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 10:10:02] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 10:10:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-17 10:10:02] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 10:10:02] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 10:10:02] [INFO ] After 50ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 10:10:02] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2022-05-17 10:10:02] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2022-05-17 10:10:02] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2022-05-17 10:10:02] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:10:02] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:10:02] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-17 10:10:03] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:10:03] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:10:03] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2022-05-17 10:10:03] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:10:03] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:10:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 799 ms
[2022-05-17 10:10:03] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-05-17 10:10:03] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-05-17 10:10:03] [INFO ] After 1215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 12 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 10 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 10:10:03] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2022-05-17 10:10:03] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 10:10:03] [INFO ] Implicit Places using invariants in 139 ms returned [155, 156, 157, 158, 159]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 143 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 160/165 places, 375/375 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/165 places, 375/375 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 780216 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 780216 steps, saw 130497 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 10:10:07] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:10:07] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 10:10:07] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 10:10:07] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2022-05-17 10:10:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:07] [INFO ] After 50ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 10:10:07] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 10:10:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 10:10:07] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 10:10:07] [INFO ] After 44ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 10:10:07] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2022-05-17 10:10:07] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:10:07] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-05-17 10:10:07] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-17 10:10:07] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-05-17 10:10:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 808 ms
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:10:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 340 ms
[2022-05-17 10:10:08] [INFO ] After 1257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-05-17 10:10:08] [INFO ] After 1444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 16 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 10:10:08] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:10:08] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:08] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-17 10:10:08] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:10:08] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:09] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-05-17 10:10:09] [INFO ] Redundant transitions in 25 ms returned []
[2022-05-17 10:10:09] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 10:10:09] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 10:10:09] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Graph (trivial) has 277 edges and 160 vertex of which 98 / 160 are part of one of the 20 SCC in 3 ms
Free SCC test removed 78 places
Drop transitions removed 156 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 232 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 1 place count 82 transition count 127
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 66 transition count 127
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 64 transition count 125
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 54 place count 53 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 29 edges and 53 vertex of which 28 / 53 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 30 transition count 123
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 29 transitions.
Graph (complete) has 106 edges and 28 vertex of which 13 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Graph (trivial) has 45 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 33 rules applied. Total rules applied 89 place count 12 transition count 70
Drop transitions removed 38 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 134 place count 12 transition count 25
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 12 transition count 21
Graph (complete) has 24 edges and 12 vertex of which 8 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 8 transition count 18
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 148 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 148 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 7 transition count 8
Applied a total of 150 rules in 16 ms. Remains 7 /160 variables (removed 153) and now considering 8/375 (removed 367) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 8 rows 7 cols
[2022-05-17 10:10:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 10:10:09] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 10:10:09] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2022-05-17 10:10:09] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 10:10:09] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
[2022-05-17 10:10:09] [INFO ] Flatten gal took : 1 ms
[2022-05-17 10:10:09] [INFO ] Flatten gal took : 0 ms
[2022-05-17 10:10:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13038437831210515971.gal : 1 ms
[2022-05-17 10:10:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15177074891272864020.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4060933326131235401;'/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/ReachabilityCardinality13038437831210515971.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15177074891272864020.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...321
Loading property file /tmp/ReachabilityCardinality15177074891272864020.prop.
Reachability property AtomicPropp15 is true.
Reachability property AtomicPropp12 is true.
Reachability property AtomicPropp9 is true.
Reachability property AtomicPropp7 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12,0.010747,3760,2,18,9,67,6,0,39,30,0
Total reachable state count : 12

Verifying 4 reachability properties.
Reachability property AtomicPropp7 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
AtomicPropp7,4,0.010952,3760,2,13,9,67,7,0,42,30,0
Reachability property AtomicPropp9 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
AtomicPropp9,1,0.011105,3760,2,8,9,67,8,0,44,30,0
Reachability property AtomicPropp12 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
AtomicPropp12,4,0.011247,3760,2,10,9,67,9,0,46,30,0
Reachability property AtomicPropp15 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
AtomicPropp15,1,0.011394,3760,2,8,9,67,10,0,48,30,0
FORMULA Peterson-PT-4-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
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' '!(X(F((X(G(p0))||(G(F(p2))&&p1)))))'
Support contains 135 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 10:10:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:09] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-17 10:10:09] [INFO ] Implicit Places using invariants in 137 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 138 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s68 1) (EQ s5 1) (EQ s70 1) (EQ s7 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8584 reset in 725 ms.
Stack based approach found an accepted trace after 5816 steps with 521 reset with depth 23 and stack size 23 in 38 ms.
FORMULA Peterson-PT-4-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-00 finished in 1348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 640 place count 160 transition count 370
Applied a total of 640 rules in 30 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2022-05-17 10:10:11] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2022-05-17 10:10:11] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 10:10:11] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-17 10:10:11] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2022-05-17 10:10:11] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 10:10:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:11] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2022-05-17 10:10:11] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 10:10:11] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2022-05-17 10:10:11] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 10:10:11] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/480 places, 370/690 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/480 places, 370/690 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s104 1) (NEQ s153 1)) (OR (NEQ s103 1) (NEQ s152 1)) (OR (NEQ s102 1) (NEQ s151 1)) (OR (NEQ s101 1) (NEQ s150 1)) (OR (NEQ s105 1) (NEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Stack based approach found an accepted trace after 67 steps with 0 reset with depth 68 and stack size 61 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-01 finished in 841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 27 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
[2022-05-17 10:10:11] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2022-05-17 10:10:11] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 10:10:11] [INFO ] Implicit Places using invariants in 105 ms returned [152, 153, 154, 155, 156]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 106 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/480 places, 375/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/480 places, 375/690 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s108 1) (EQ s158 1)) (AND (EQ s100 1) (EQ s145 1)) (AND (EQ s109 1) (EQ s146 1)) (AND (EQ s106 1) (EQ s159 1)) (AND (EQ s107 1) (EQ s157 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 202 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-03 finished in 396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!X(p0) U X(X(X(p0))))))'
Support contains 80 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 10:10:12] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:12] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-17 10:10:12] [INFO ] Implicit Places using invariants in 169 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 171 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s68 1) (EQ s5 1) (EQ s70 1) (EQ s7 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2926 reset in 348 ms.
Stack based approach found an accepted trace after 153 steps with 3 reset with depth 39 and stack size 39 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-04 finished in 692 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(G((G(p1)||F(G(p1))))&&p1)))))'
Support contains 10 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 21 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
[2022-05-17 10:10:12] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2022-05-17 10:10:12] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 10:10:13] [INFO ] Implicit Places using invariants in 102 ms returned [152, 153, 154, 155, 156]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 102 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/480 places, 375/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/480 places, 375/690 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (EQ s108 1) (EQ s158 1)) (AND (EQ s100 1) (EQ s145 1)) (AND (EQ s109 1) (EQ s146 1)) (AND (EQ s106 1) (EQ s159 1)) (AND (EQ s107 1) (EQ s157 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 332 ms.
Stack based approach found an accepted trace after 362 steps with 0 reset with depth 363 and stack size 293 in 1 ms.
FORMULA Peterson-PT-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-05 finished in 518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((F(X(p1))&&p0)))))'
Support contains 90 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 10:10:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:13] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-17 10:10:13] [INFO ] Implicit Places using invariants in 157 ms returned []
[2022-05-17 10:10:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:13] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 10:10:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:14] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2022-05-17 10:10:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:14] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 10:10:14] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (EQ s231 1) (EQ s470 1)) (AND (EQ s230 1) (EQ s469 1)) (AND (EQ s229 1) (EQ s468 1)) (AND (EQ s228 1) (EQ s467 1)) (AND (EQ s232 1) (EQ s471 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 455 ms.
Product exploration explored 100000 steps with 33333 reset in 461 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 : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-4-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLFireability-06 finished in 2376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((F(X(p0))||G(p1))))||p2)))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 480 transition count 492
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 282 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 398 place count 281 transition count 392
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 596 place count 182 transition count 392
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 634 place count 163 transition count 373
Applied a total of 634 rules in 22 ms. Remains 163 /480 variables (removed 317) and now considering 373/690 (removed 317) transitions.
[2022-05-17 10:10:15] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 163 cols
[2022-05-17 10:10:15] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 10:10:15] [INFO ] Implicit Places using invariants in 100 ms returned [153, 154, 155, 156, 157]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 101 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/480 places, 373/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 158/480 places, 373/690 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s60 1), p1:(OR (EQ s118 0) (EQ s142 0)), p0:(EQ s102 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 0 reset in 194 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 : [(AND (NOT p2) p1 p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 740778 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 740778 steps, saw 123898 distinct states, run finished after 3002 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-17 10:10:20] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:20] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:10:20] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 10:10:20] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 10:10:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 10:10:20] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:20] [INFO ] After 43ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:10:20] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2022-05-17 10:10:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 645 ms
[2022-05-17 10:10:21] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-05-17 10:10:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-17 10:10:21] [INFO ] After 815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-17 10:10:21] [INFO ] After 987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 373/373 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 911814 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :{}
Probabilistic random walk after 911814 steps, saw 152407 distinct states, run finished after 3001 ms. (steps per millisecond=303 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-17 10:10:24] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:24] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:24] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 10:10:24] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 10:10:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 10:10:24] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:24] [INFO ] After 46ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:24] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-17 10:10:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2022-05-17 10:10:24] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 4 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 643 ms
[2022-05-17 10:10:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 10:10:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-05-17 10:10:25] [INFO ] After 802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-17 10:10:25] [INFO ] After 975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 373/373 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2022-05-17 10:10:25] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:25] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:10:25] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-17 10:10:25] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:25] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 10:10:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:25] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2022-05-17 10:10:25] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 10:10:25] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:25] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:26] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 373/373 transitions.
Graph (trivial) has 269 edges and 158 vertex of which 94 / 158 are part of one of the 19 SCC in 0 ms
Free SCC test removed 75 places
Drop transitions removed 150 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 227 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 1 place count 83 transition count 129
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 66 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 37 place count 65 transition count 128
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 54 place count 54 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 30 edges and 54 vertex of which 21 / 54 are part of one of the 4 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 37 transition count 126
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (trivial) has 39 edges and 35 vertex of which 8 / 35 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 80 place count 31 transition count 105
Drop transitions removed 8 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 113 place count 31 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 30 transition count 71
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 30 transition count 64
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 30 transition count 63
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 29 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 126 place count 28 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 28 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 28 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 129 place count 27 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 130 place count 27 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 131 place count 26 transition count 59
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 134 place count 26 transition count 68
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 161 place count 23 transition count 44
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 164 place count 23 transition count 41
Applied a total of 164 rules in 12 ms. Remains 23 /158 variables (removed 135) and now considering 41/373 (removed 332) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 23 cols
[2022-05-17 10:10:26] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 10:10:26] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 10:10:26] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-17 10:10:26] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 10:10:26] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 10:10:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 10:10:26] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:26] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 10:10:26] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:26] [INFO ] Flatten gal took : 3 ms
[2022-05-17 10:10:26] [INFO ] Flatten gal took : 4 ms
[2022-05-17 10:10:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality790217804853085380.gal : 1 ms
[2022-05-17 10:10:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12537110035692627365.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11501371671837977065;'/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/ReachabilityCardinality790217804853085380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12537110035692627365.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...319
Loading property file /tmp/ReachabilityCardinality12537110035692627365.prop.
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 2
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :16 after 40
Reachability property apf2 is true.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :40 after 160
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,706,0.01167,4300,2,121,11,789,6,0,136,507,0
Total reachable state count : 706

Verifying 3 reachability properties.
Reachability property apf0 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
apf0,3,0.012492,4300,2,26,11,789,7,0,139,507,0
Reachability property apf1 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
apf1,12,0.013208,4300,2,30,11,789,8,0,150,507,0
Reachability property apf2 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
apf2,2,0.013777,4300,2,26,11,789,9,0,155,507,0
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2022-05-17 10:10:26] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:26] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:10:26] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-17 10:10:26] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:26] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:27] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2022-05-17 10:10:27] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-17 10:10:27] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:27] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:10:27] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 373/373 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 : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 760530 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 760530 steps, saw 127179 distinct states, run finished after 3001 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-17 10:10:30] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:30] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:30] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 10:10:30] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 10:10:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 10:10:31] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:31] [INFO ] After 45ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 655 ms
[2022-05-17 10:10:31] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-17 10:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-05-17 10:10:31] [INFO ] After 818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-17 10:10:31] [INFO ] After 989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 373/373 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 884058 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :{}
Probabilistic random walk after 884058 steps, saw 147766 distinct states, run finished after 3001 ms. (steps per millisecond=294 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-17 10:10:35] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:35] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:10:35] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 10:10:35] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 10:10:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 10:10:35] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:35] [INFO ] After 42ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:10:35] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 636 ms
[2022-05-17 10:10:36] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2022-05-17 10:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-17 10:10:36] [INFO ] After 802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-17 10:10:36] [INFO ] After 988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 373/373 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 373/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2022-05-17 10:10:36] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:36] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:10:36] [INFO ] Implicit Places using invariants in 108 ms returned []
[2022-05-17 10:10:36] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:36] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:36] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2022-05-17 10:10:36] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 10:10:36] [INFO ] Flow matrix only has 313 transitions (discarded 60 similar events)
// Phase 1: matrix 313 rows 158 cols
[2022-05-17 10:10:36] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:36] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 373/373 transitions.
Graph (trivial) has 269 edges and 158 vertex of which 94 / 158 are part of one of the 19 SCC in 0 ms
Free SCC test removed 75 places
Drop transitions removed 150 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 227 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 1 place count 83 transition count 129
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 66 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 37 place count 65 transition count 128
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 54 place count 54 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 30 edges and 54 vertex of which 21 / 54 are part of one of the 4 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 37 transition count 126
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (trivial) has 39 edges and 35 vertex of which 8 / 35 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 24 rules applied. Total rules applied 80 place count 31 transition count 105
Drop transitions removed 8 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 113 place count 31 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 30 transition count 71
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 30 transition count 64
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 30 transition count 63
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 29 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 126 place count 28 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 28 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 28 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 129 place count 27 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 130 place count 27 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 131 place count 26 transition count 59
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 134 place count 26 transition count 68
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 161 place count 23 transition count 44
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 164 place count 23 transition count 41
Applied a total of 164 rules in 9 ms. Remains 23 /158 variables (removed 135) and now considering 41/373 (removed 332) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 23 cols
[2022-05-17 10:10:36] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 10:10:36] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 10:10:36] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-17 10:10:36] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 10:10:36] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 10:10:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 10:10:37] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:37] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-17 10:10:37] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-17 10:10:37] [INFO ] Flatten gal took : 4 ms
[2022-05-17 10:10:37] [INFO ] Flatten gal took : 3 ms
[2022-05-17 10:10:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12624345689192281872.gal : 2 ms
[2022-05-17 10:10:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1719890685912914319.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16061652133283130885;'/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/ReachabilityCardinality12624345689192281872.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1719890685912914319.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/ReachabilityCardinality1719890685912914319.prop.
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 2
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :16 after 40
Reachability property apf2 is true.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :40 after 160
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,706,0.009027,4300,2,121,11,772,6,0,136,501,0
Total reachable state count : 706

Verifying 3 reachability properties.
Reachability property apf0 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
apf0,3,0.009208,4300,2,26,11,772,7,0,139,501,0
Reachability property apf1 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
apf1,12,0.009778,4300,2,30,11,772,8,0,150,501,0
Reachability property apf2 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
apf2,162,0.010319,4300,2,76,11,772,9,0,156,501,0
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Built C files in :
/tmp/ltsmin17653810701090598031
[2022-05-17 10:10:37] [INFO ] Computing symmetric may disable matrix : 373 transitions.
[2022-05-17 10:10:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:10:37] [INFO ] Computing symmetric may enable matrix : 373 transitions.
[2022-05-17 10:10:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:10:37] [INFO ] Computing Do-Not-Accords matrix : 373 transitions.
[2022-05-17 10:10:37] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 10:10:37] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17653810701090598031
Running compilation step : cd /tmp/ltsmin17653810701090598031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 790 ms.
Running link step : cd /tmp/ltsmin17653810701090598031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17653810701090598031;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8630425138624762664.hoa' '--buchi-type=spotba'
LTSmin run took 12521 ms.
FORMULA Peterson-PT-4-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-4-LTLFireability-08 finished in 35534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!(p0 U G(p1)))||X((X(F(X(p0)))&&p2)))))'
Support contains 5 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 10:10:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:51] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-17 10:10:51] [INFO ] Implicit Places using invariants in 163 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 163 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), p1, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : Peterson-PT-4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s89 1), p1:(AND (EQ s447 1) (EQ s467 1)), p0:(AND (EQ s347 1) (EQ s425 1))], 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Product exploration explored 100000 steps with 0 reset in 238 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 : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 308 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[p1, p1]
Finished random walk after 7157 steps, including 2 resets, run visited all 1 properties in 17 ms. (steps per millisecond=421 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 282 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 57 ms :[p1, p1]
Stuttering acceptance computed with spot in 59 ms :[p1, p1]
Support contains 2 out of 475 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 475 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 275 transition count 490
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 400 place count 275 transition count 391
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 598 place count 176 transition count 391
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 636 place count 157 transition count 372
Applied a total of 636 rules in 19 ms. Remains 157 /475 variables (removed 318) and now considering 372/690 (removed 318) transitions.
[2022-05-17 10:10:53] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 10:10:53] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 10:10:53] [INFO ] Implicit Places using invariants in 96 ms returned []
[2022-05-17 10:10:53] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 10:10:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 10:10:53] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2022-05-17 10:10:53] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 10:10:53] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 10:10:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 10:10:53] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/475 places, 372/690 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/475 places, 372/690 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 68 ms :[p1, p1]
Finished random walk after 3380 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=307 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 102 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 51 ms :[p1, p1]
Stuttering acceptance computed with spot in 68 ms :[p1, p1]
Stuttering acceptance computed with spot in 73 ms :[p1, p1]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 52 in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLFireability-10 finished in 3068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!(true U p0)) U p1)))'
Support contains 5 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 10:10:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:54] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-17 10:10:54] [INFO ] Implicit Places using invariants in 169 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 170 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : Peterson-PT-4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s75 1), p0:(OR (AND (EQ s346 1) (EQ s471 1)) (AND (EQ s297 1) (EQ s470 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-11 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 10:10:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:54] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 10:10:54] [INFO ] Implicit Places using invariants in 161 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 162 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLFireability-14 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:(EQ s330 1)], 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 0 ms.
FORMULA Peterson-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-14 finished in 257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0) U (X(p0)||X(p1)||p2))) U p3))'
Support contains 6 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 10:10:55] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 10:10:55] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 10:10:55] [INFO ] Implicit Places using invariants in 172 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 180 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), true]
Running random walk in product with property : Peterson-PT-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(NOT p3), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s233 1) (EQ s474 1)), p2:(EQ s101 1), p0:(EQ s124 1), p1:(AND (EQ s234 1) (EQ s472 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-4-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLFireability-15 finished in 367 ms.
All properties solved by simple procedures.
Total runtime 63602 ms.

BK_STOP 1652782255476

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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-4"
export BK_EXAMINATION="LTLFireability"
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-4, examination is LTLFireability"
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-165277016200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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