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.r222-tall-165286025000284.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 ShieldIIPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.7K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 18:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 338K 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 ShieldIIPt-PT-020B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652958739332

Running Version 202205111006
[2022-05-19 11:12:20] [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-19 11:12:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:12:20] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2022-05-19 11:12:20] [INFO ] Transformed 1403 places.
[2022-05-19 11:12:20] [INFO ] Transformed 1303 transitions.
[2022-05-19 11:12:20] [INFO ] Found NUPN structural information;
[2022-05-19 11:12:20] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-020B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 210 places :
Symmetric choice reduction at 0 with 210 rule applications. Total rules 210 place count 1193 transition count 1093
Iterating global reduction 0 with 210 rules applied. Total rules applied 420 place count 1193 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 421 place count 1192 transition count 1092
Iterating global reduction 0 with 1 rules applied. Total rules applied 422 place count 1192 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 423 place count 1191 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 424 place count 1191 transition count 1091
Applied a total of 424 rules in 460 ms. Remains 1191 /1403 variables (removed 212) and now considering 1091/1303 (removed 212) transitions.
// Phase 1: matrix 1091 rows 1191 cols
[2022-05-19 11:12:21] [INFO ] Computed 181 place invariants in 29 ms
[2022-05-19 11:12:21] [INFO ] Implicit Places using invariants in 488 ms returned []
// Phase 1: matrix 1091 rows 1191 cols
[2022-05-19 11:12:21] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:12:22] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
// Phase 1: matrix 1091 rows 1191 cols
[2022-05-19 11:12:22] [INFO ] Computed 181 place invariants in 11 ms
[2022-05-19 11:12:23] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1191/1403 places, 1091/1303 transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/1403 places, 1091/1303 transitions.
Support contains 44 out of 1191 places after structural reductions.
[2022-05-19 11:12:23] [INFO ] Flatten gal took : 99 ms
[2022-05-19 11:12:23] [INFO ] Flatten gal took : 55 ms
[2022-05-19 11:12:23] [INFO ] Input system was already deterministic with 1091 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 882 ms. (steps per millisecond=11 ) properties (out of 32) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1091 rows 1191 cols
[2022-05-19 11:12:24] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 11:12:26] [INFO ] [Real]Absence check using 181 positive place invariants in 47 ms returned sat
[2022-05-19 11:12:26] [INFO ] After 2138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 11:12:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 56 ms returned sat
[2022-05-19 11:12:28] [INFO ] After 1054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-19 11:12:28] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 6 ms to minimize.
[2022-05-19 11:12:29] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2022-05-19 11:12:29] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2022-05-19 11:12:29] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2022-05-19 11:12:29] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2022-05-19 11:12:29] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2022-05-19 11:12:29] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2022-05-19 11:12:30] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2022-05-19 11:12:30] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2022-05-19 11:12:30] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-19 11:12:30] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2022-05-19 11:12:30] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2022-05-19 11:12:30] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 0 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2022-05-19 11:12:31] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3223 ms
[2022-05-19 11:12:32] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2022-05-19 11:12:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-19 11:12:32] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2022-05-19 11:12:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-19 11:12:32] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 0 ms to minimize.
[2022-05-19 11:12:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-19 11:12:32] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2022-05-19 11:12:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-19 11:12:33] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2022-05-19 11:12:33] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2022-05-19 11:12:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2022-05-19 11:12:33] [INFO ] After 6260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 704 ms.
[2022-05-19 11:12:34] [INFO ] After 7775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 633 ms.
Support contains 22 out of 1191 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Drop transitions removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 229 place count 1191 transition count 862
Reduce places removed 229 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 962 transition count 860
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 462 place count 960 transition count 860
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 462 place count 960 transition count 713
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 756 place count 813 transition count 713
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 757 place count 812 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 758 place count 812 transition count 712
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 758 place count 812 transition count 711
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 760 place count 811 transition count 711
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 0 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 3 with 694 rules applied. Total rules applied 1454 place count 464 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1455 place count 464 transition count 363
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1457 place count 463 transition count 362
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1555 place count 414 transition count 390
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1556 place count 414 transition count 389
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1559 place count 414 transition count 386
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1562 place count 411 transition count 386
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 1582 place count 411 transition count 386
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1583 place count 410 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1585 place count 408 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1585 place count 408 transition count 384
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1587 place count 407 transition count 384
Applied a total of 1587 rules in 243 ms. Remains 407 /1191 variables (removed 784) and now considering 384/1091 (removed 707) transitions.
Finished structural reductions, in 1 iterations. Remains : 407/1191 places, 384/1091 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 384 rows 407 cols
[2022-05-19 11:12:36] [INFO ] Computed 179 place invariants in 10 ms
[2022-05-19 11:12:36] [INFO ] [Real]Absence check using 179 positive place invariants in 22 ms returned sat
[2022-05-19 11:12:36] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 11:12:36] [INFO ] [Nat]Absence check using 179 positive place invariants in 20 ms returned sat
[2022-05-19 11:12:36] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 11:12:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:12:37] [INFO ] After 164ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-19 11:12:37] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2022-05-19 11:12:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-05-19 11:12:37] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 171 ms.
[2022-05-19 11:12:37] [INFO ] After 1131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 137 ms.
Support contains 16 out of 407 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 407/407 places, 384/384 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 407 transition count 381
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 404 transition count 381
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 401 transition count 378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 399 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 398 transition count 380
Applied a total of 17 rules in 50 ms. Remains 398 /407 variables (removed 9) and now considering 380/384 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 398/407 places, 380/384 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 160280 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160280 steps, saw 103324 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 380 rows 398 cols
[2022-05-19 11:12:41] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:12:41] [INFO ] [Real]Absence check using 179 positive place invariants in 24 ms returned sat
[2022-05-19 11:12:41] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 11:12:41] [INFO ] [Nat]Absence check using 179 positive place invariants in 22 ms returned sat
[2022-05-19 11:12:42] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 11:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:12:42] [INFO ] After 157ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-19 11:12:42] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 158 ms.
[2022-05-19 11:12:42] [INFO ] After 1014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 16 out of 398 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 398/398 places, 380/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 398 /398 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 398/398 places, 380/380 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 398/398 places, 380/380 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 380/380 (removed 0) transitions.
// Phase 1: matrix 380 rows 398 cols
[2022-05-19 11:12:42] [INFO ] Computed 179 place invariants in 2 ms
[2022-05-19 11:12:43] [INFO ] Implicit Places using invariants in 179 ms returned [387]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 397/398 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 396 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 396 transition count 379
Applied a total of 2 rules in 21 ms. Remains 396 /397 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 396 cols
[2022-05-19 11:12:43] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:12:43] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 379 rows 396 cols
[2022-05-19 11:12:43] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:12:43] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 396/398 places, 379/380 transitions.
Finished structural reductions, in 2 iterations. Remains : 396/398 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 379 rows 396 cols
[2022-05-19 11:12:44] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:12:44] [INFO ] [Real]Absence check using 178 positive place invariants in 21 ms returned sat
[2022-05-19 11:12:44] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:12:44] [INFO ] [Nat]Absence check using 178 positive place invariants in 22 ms returned sat
[2022-05-19 11:12:44] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:12:45] [INFO ] After 372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-19 11:12:45] [INFO ] After 618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 52 ms.
Support contains 12 out of 396 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 396/396 places, 379/379 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 396 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 394 transition count 377
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 2 with 4 rules applied. Total rules applied 8 place count 392 transition count 375
Applied a total of 8 rules in 20 ms. Remains 392 /396 variables (removed 4) and now considering 375/379 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 392/396 places, 375/379 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 196823 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196823 steps, saw 125562 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 375 rows 392 cols
[2022-05-19 11:12:48] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:12:48] [INFO ] [Real]Absence check using 178 positive place invariants in 22 ms returned sat
[2022-05-19 11:12:49] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:12:49] [INFO ] [Nat]Absence check using 178 positive place invariants in 22 ms returned sat
[2022-05-19 11:12:49] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:12:49] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-19 11:12:49] [INFO ] After 612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 58 ms.
Support contains 12 out of 392 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 392/392 places, 375/375 transitions.
Applied a total of 0 rules in 11 ms. Remains 392 /392 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 392/392 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 392/392 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 392 /392 variables (removed 0) and now considering 375/375 (removed 0) transitions.
// Phase 1: matrix 375 rows 392 cols
[2022-05-19 11:12:49] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:12:50] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 375 rows 392 cols
[2022-05-19 11:12:50] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:12:50] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2022-05-19 11:12:50] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 375 rows 392 cols
[2022-05-19 11:12:50] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:12:50] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/392 places, 375/375 transitions.
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 392 transition count 375
Applied a total of 37 rules in 13 ms. Remains 392 /392 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 375 rows 392 cols
[2022-05-19 11:12:50] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:12:50] [INFO ] [Real]Absence check using 178 positive place invariants in 21 ms returned sat
[2022-05-19 11:12:50] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:12:51] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:12:51] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:12:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-19 11:12:51] [INFO ] After 136ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:12:51] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 124 ms.
[2022-05-19 11:12:51] [INFO ] After 780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:12:51] [INFO ] Flatten gal took : 21 ms
[2022-05-19 11:12:51] [INFO ] Flatten gal took : 21 ms
[2022-05-19 11:12:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality714140101900163122.gal : 17 ms
[2022-05-19 11:12:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16884850501545453982.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4979076504212506470;'/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/ReachabilityCardinality714140101900163122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16884850501545453982.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/ReachabilityCardinality16884850501545453982.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :12 after 324
Reachability property AtomicPropp27 is true.
Reachability property AtomicPropp14 is true.
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :324 after 527
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :527 after 586
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :586 after 858
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :858 after 1076
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1076 after 3073
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3073 after 62755
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :62755 after 525430
Reachability property AtomicPropp21 is true.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :525430 after 1.35681e+08
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.35681e+08 after 1.60007e+09
Reachability property AtomicPropp28 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.60007e+09 after 4.85904e+11
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.85904e+11 after 2.83382e+14
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.83382e+14 after 1.1796e+17
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.1796e+17 after 1.70123e+20
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.70123e+20 after 2.54715e+29
Reachability property AtomicPropp1 is true.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.54715e+29 after 7.01495e+37
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :7.01495e+37 after 1.652e+45
Detected timeout of ITS tools.
[2022-05-19 11:13:06] [INFO ] Flatten gal took : 22 ms
[2022-05-19 11:13:06] [INFO ] Applying decomposition
[2022-05-19 11:13:06] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1135199624499015595.txt' '-o' '/tmp/graph1135199624499015595.bin' '-w' '/tmp/graph1135199624499015595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1135199624499015595.bin' '-l' '-1' '-v' '-w' '/tmp/graph1135199624499015595.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:13:06] [INFO ] Decomposing Gal with order
[2022-05-19 11:13:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:13:07] [INFO ] Removed a total of 204 redundant transitions.
[2022-05-19 11:13:07] [INFO ] Flatten gal took : 64 ms
[2022-05-19 11:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 11 ms.
[2022-05-19 11:13:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3667132413770542710.gal : 8 ms
[2022-05-19 11:13:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16611051700553406913.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4979076504212506470;'/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/ReachabilityCardinality3667132413770542710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16611051700553406913.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality16611051700553406913.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4 after 4
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :368640 after 2.8468e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.8468e+08 after 2.05411e+24
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.05411e+24 after 1.78277e+45
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5856530273412432103
[2022-05-19 11:13:22] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5856530273412432103
Running compilation step : cd /tmp/ltsmin5856530273412432103;'/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 2160 ms.
Running link step : cd /tmp/ltsmin5856530273412432103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5856530273412432103;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Computed a total of 318 stabilizing places and 318 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 3 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1181 transition count 1081
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1181 transition count 1081
Applied a total of 20 rules in 54 ms. Remains 1181 /1191 variables (removed 10) and now considering 1081/1091 (removed 10) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:13:37] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 11:13:37] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:13:37] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 11:13:38] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:13:38] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 11:13:39] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1191 places, 1081/1091 transitions.
Finished structural reductions, in 1 iterations. Remains : 1181/1191 places, 1081/1091 transitions.
Stuttering acceptance computed with spot in 970 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-00 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:(AND (EQ s659 1) (EQ s1047 1) (EQ s574 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 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-00 finished in 2673 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(((F(p1)||p2)&&p0))))))'
Support contains 4 out of 1191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1190 transition count 850
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 950 transition count 850
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 480 place count 950 transition count 695
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 790 place count 795 transition count 695
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 794 place count 791 transition count 691
Iterating global reduction 2 with 4 rules applied. Total rules applied 798 place count 791 transition count 691
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 798 place count 791 transition count 688
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 804 place count 788 transition count 688
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1486 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1487 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1489 place count 446 transition count 345
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1603 place count 389 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1605 place count 387 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1607 place count 385 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1607 place count 385 transition count 379
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1609 place count 384 transition count 379
Applied a total of 1609 rules in 116 ms. Remains 384 /1191 variables (removed 807) and now considering 379/1091 (removed 712) transitions.
// Phase 1: matrix 379 rows 384 cols
[2022-05-19 11:13:40] [INFO ] Computed 179 place invariants in 6 ms
[2022-05-19 11:13:40] [INFO ] Implicit Places using invariants in 179 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/1191 places, 379/1091 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 382 transition count 378
Applied a total of 2 rules in 15 ms. Remains 382 /383 variables (removed 1) and now considering 378/379 (removed 1) transitions.
// Phase 1: matrix 378 rows 382 cols
[2022-05-19 11:13:40] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:13:40] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 378 rows 382 cols
[2022-05-19 11:13:40] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:13:40] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 382/1191 places, 378/1091 transitions.
Finished structural reductions, in 2 iterations. Remains : 382/1191 places, 378/1091 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s255 1) (EQ s207 1)), p2:(EQ s81 0), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-01 finished in 901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U p1))||X(X(p2)))))'
Support contains 3 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1182 transition count 1082
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1182 transition count 1082
Applied a total of 18 rules in 62 ms. Remains 1182 /1191 variables (removed 9) and now considering 1082/1091 (removed 9) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:13:41] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 11:13:41] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:13:41] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 11:13:42] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:13:42] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 11:13:42] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1191 places, 1082/1091 transitions.
Finished structural reductions, in 1 iterations. Remains : 1182/1191 places, 1082/1091 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR p1 p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=7 dest: 6}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(NEQ s107 1), p0:(EQ s262 1), p2:(EQ s692 0)], 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, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24999 reset in 586 ms.
Product exploration explored 100000 steps with 24979 reset in 542 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1182 stabilizing places and 318/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 1356 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) 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 10) seen :0
Interrupted probabilistic random walk after 159908 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159908 steps, saw 85034 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:13:49] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 11:13:49] [INFO ] [Real]Absence check using 181 positive place invariants in 47 ms returned sat
[2022-05-19 11:13:50] [INFO ] After 397ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2022-05-19 11:13:50] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 1 ms to minimize.
[2022-05-19 11:13:50] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2022-05-19 11:13:50] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 0 ms to minimize.
[2022-05-19 11:13:51] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 1 ms to minimize.
[2022-05-19 11:13:51] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 1 ms to minimize.
[2022-05-19 11:13:51] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:13:51] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:13:51] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:13:52] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
[2022-05-19 11:13:52] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2022-05-19 11:13:52] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2022-05-19 11:13:52] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2022-05-19 11:13:52] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2022-05-19 11:13:52] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2022-05-19 11:13:53] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2022-05-19 11:13:53] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-05-19 11:13:53] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2022-05-19 11:13:53] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2022-05-19 11:13:53] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2022-05-19 11:13:53] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2022-05-19 11:13:54] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 0 ms to minimize.
[2022-05-19 11:13:54] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 5 ms to minimize.
[2022-05-19 11:13:54] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 0 ms to minimize.
[2022-05-19 11:13:54] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 0 ms to minimize.
[2022-05-19 11:13:54] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2022-05-19 11:13:54] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2022-05-19 11:13:54] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2022-05-19 11:13:55] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2022-05-19 11:13:55] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 0 ms to minimize.
[2022-05-19 11:13:55] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 0 ms to minimize.
[2022-05-19 11:13:55] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2022-05-19 11:13:55] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 0 ms to minimize.
[2022-05-19 11:13:55] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2022-05-19 11:13:55] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5701 ms
[2022-05-19 11:13:55] [INFO ] After 6133ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 11:13:55] [INFO ] After 6519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 11:13:56] [INFO ] [Nat]Absence check using 181 positive place invariants in 48 ms returned sat
[2022-05-19 11:13:57] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-19 11:13:57] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 1 ms to minimize.
[2022-05-19 11:13:57] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 1 ms to minimize.
[2022-05-19 11:13:57] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2022-05-19 11:13:57] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 1 ms to minimize.
[2022-05-19 11:13:58] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2022-05-19 11:13:58] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2022-05-19 11:13:58] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2022-05-19 11:13:58] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2022-05-19 11:13:58] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2022-05-19 11:13:58] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2022-05-19 11:13:59] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2022-05-19 11:13:59] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2022-05-19 11:13:59] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-19 11:13:59] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2022-05-19 11:13:59] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2022-05-19 11:13:59] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 1 ms to minimize.
[2022-05-19 11:14:00] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2022-05-19 11:14:00] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2022-05-19 11:14:00] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2022-05-19 11:14:00] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2022-05-19 11:14:00] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2022-05-19 11:14:00] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2022-05-19 11:14:00] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-19 11:14:00] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2022-05-19 11:14:01] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4815 ms
[2022-05-19 11:14:02] [INFO ] After 6223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 410 ms.
[2022-05-19 11:14:02] [INFO ] After 7127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 286 ms.
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1182 transition count 844
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 944 transition count 844
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 476 place count 944 transition count 685
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 794 place count 785 transition count 685
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1474 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1475 place count 445 transition count 344
Renaming transitions due to excessive name length > 1024 char.
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 1477 place count 444 transition count 343
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1591 place count 387 transition count 380
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1592 place count 387 transition count 379
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1593 place count 387 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1594 place count 386 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1614 place count 386 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1615 place count 385 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1617 place count 383 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1617 place count 383 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1619 place count 382 transition count 376
Applied a total of 1619 rules in 85 ms. Remains 382 /1182 variables (removed 800) and now considering 376/1082 (removed 706) transitions.
Finished structural reductions, in 1 iterations. Remains : 382/1182 places, 376/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
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 :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 376 rows 382 cols
[2022-05-19 11:14:04] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:14:04] [INFO ] [Real]Absence check using 179 positive place invariants in 19 ms returned sat
[2022-05-19 11:14:04] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:14:04] [INFO ] [Nat]Absence check using 179 positive place invariants in 25 ms returned sat
[2022-05-19 11:14:04] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:14:04] [INFO ] After 93ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:04] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-19 11:14:04] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 382/382 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 382 /382 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 376/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
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 :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 205698 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205698 steps, saw 132596 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 376 rows 382 cols
[2022-05-19 11:14:08] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:14:08] [INFO ] [Real]Absence check using 179 positive place invariants in 21 ms returned sat
[2022-05-19 11:14:08] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:14:08] [INFO ] [Nat]Absence check using 179 positive place invariants in 21 ms returned sat
[2022-05-19 11:14:09] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:14:09] [INFO ] After 95ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:09] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-05-19 11:14:09] [INFO ] After 699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 382/382 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 382 /382 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 376/376 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 382/382 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 382 /382 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 382 cols
[2022-05-19 11:14:09] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:14:09] [INFO ] Implicit Places using invariants in 173 ms returned [371]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 381/382 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 380 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 380 transition count 375
Applied a total of 2 rules in 8 ms. Remains 380 /381 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:09] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:09] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:09] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:10] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 380/382 places, 375/376 transitions.
Finished structural reductions, in 2 iterations. Remains : 380/382 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
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 :0
Interrupted probabilistic random walk after 219431 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219431 steps, saw 141974 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:13] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:13] [INFO ] [Real]Absence check using 178 positive place invariants in 21 ms returned sat
[2022-05-19 11:14:13] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:14:13] [INFO ] [Nat]Absence check using 178 positive place invariants in 23 ms returned sat
[2022-05-19 11:14:14] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:14] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-05-19 11:14:14] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 380/380 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:14] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:14] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:14] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:15] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2022-05-19 11:14:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:15] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:15] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 380/380 places, 375/375 transitions.
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 380 transition count 375
Applied a total of 41 rules in 10 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:15] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:14:15] [INFO ] [Real]Absence check using 178 positive place invariants in 21 ms returned sat
[2022-05-19 11:14:15] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:14:15] [INFO ] [Nat]Absence check using 178 positive place invariants in 23 ms returned sat
[2022-05-19 11:14:15] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-05-19 11:14:15] [INFO ] After 103ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:16] [INFO ] After 970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-05-19 11:14:16] [INFO ] After 1406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:16] [INFO ] Flatten gal took : 20 ms
[2022-05-19 11:14:16] [INFO ] Flatten gal took : 18 ms
[2022-05-19 11:14:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6528297902467653216.gal : 3 ms
[2022-05-19 11:14:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16184992524098582556.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2736618955148356313;'/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/ReachabilityCardinality6528297902467653216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16184992524098582556.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/ReachabilityCardinality16184992524098582556.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :30 after 87
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :87 after 181
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :181 after 237
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :237 after 541
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :541 after 11294
Reachability property apf8 is true.
Reachability property apf6 is true.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :11294 after 190593
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :190593 after 399391
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :399391 after 1.10535e+07
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.10535e+07 after 8.19355e+07
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :8.19355e+07 after 5.40257e+10
Detected timeout of ITS tools.
[2022-05-19 11:14:31] [INFO ] Flatten gal took : 15 ms
[2022-05-19 11:14:31] [INFO ] Applying decomposition
[2022-05-19 11:14:31] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14574636500954021933.txt' '-o' '/tmp/graph14574636500954021933.bin' '-w' '/tmp/graph14574636500954021933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14574636500954021933.bin' '-l' '-1' '-v' '-w' '/tmp/graph14574636500954021933.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:14:32] [INFO ] Decomposing Gal with order
[2022-05-19 11:14:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:14:32] [INFO ] Removed a total of 211 redundant transitions.
[2022-05-19 11:14:32] [INFO ] Flatten gal took : 23 ms
[2022-05-19 11:14:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2022-05-19 11:14:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11139861622501901879.gal : 4 ms
[2022-05-19 11:14:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6070642453173467790.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2736618955148356313;'/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/ReachabilityCardinality11139861622501901879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6070642453173467790.prop' '--nowitness'

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...299
Loading property file /tmp/ReachabilityCardinality6070642453173467790.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :3 after 420
Reachability property apf7 is true.
Reachability property apf4 is true.
Reachability property apf3 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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\_mod\_flat,3.00266e+15,0.307576,16116,594,136,18475,639,472,69645,78,7865,0
Total reachable state count : 3002664106649600

Verifying 5 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,4.53629e+13,0.30975,16380,209,80,18475,639,482,69645,83,7865,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,4.53629e+13,0.310134,16380,209,80,18475,639,482,69645,83,7865,0
Reachability property apf3 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
apf3,9.07258e+12,0.310732,16380,206,79,18475,639,487,69645,85,7865,0
Reachability property apf4 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
apf4,1.38513e+11,0.311227,16380,135,56,18475,639,495,69645,85,7865,0
Reachability property apf7 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
apf7,3.62903e+13,0.311662,16380,209,79,18475,639,500,69645,87,7865,0
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR (AND p1 p2) (AND p0 p2))))]
Knowledge based reduction with 8 factoid took 444 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 36 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:14:33] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 11:14:33] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:14:33] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 11:14:34] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:14:34] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:14:35] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1182 stabilizing places and 318/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 501 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:14:36] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 11:14:36] [INFO ] [Real]Absence check using 181 positive place invariants in 43 ms returned sat
[2022-05-19 11:14:36] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:14:37] [INFO ] [Nat]Absence check using 181 positive place invariants in 50 ms returned sat
[2022-05-19 11:14:37] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:38] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2022-05-19 11:14:38] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2022-05-19 11:14:38] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2022-05-19 11:14:38] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-05-19 11:14:38] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 1 ms to minimize.
[2022-05-19 11:14:39] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2022-05-19 11:14:39] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 0 ms to minimize.
[2022-05-19 11:14:39] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 0 ms to minimize.
[2022-05-19 11:14:39] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2022-05-19 11:14:39] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2022-05-19 11:14:40] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2022-05-19 11:14:40] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-19 11:14:40] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2022-05-19 11:14:40] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2022-05-19 11:14:40] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2022-05-19 11:14:40] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2022-05-19 11:14:41] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2022-05-19 11:14:41] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2022-05-19 11:14:41] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2022-05-19 11:14:41] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2022-05-19 11:14:41] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 0 ms to minimize.
[2022-05-19 11:14:41] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2022-05-19 11:14:41] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2022-05-19 11:14:42] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2022-05-19 11:14:43] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-19 11:14:43] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2022-05-19 11:14:43] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2022-05-19 11:14:43] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5391 ms
[2022-05-19 11:14:43] [INFO ] After 6497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 276 ms.
[2022-05-19 11:14:44] [INFO ] After 7178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 187 ms.
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1182 transition count 844
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 944 transition count 844
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 476 place count 944 transition count 685
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 794 place count 785 transition count 685
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1474 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1475 place count 445 transition count 344
Renaming transitions due to excessive name length > 1024 char.
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 1477 place count 444 transition count 343
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1591 place count 387 transition count 380
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1592 place count 387 transition count 379
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1593 place count 387 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1594 place count 386 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1614 place count 386 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1615 place count 385 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1617 place count 383 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1617 place count 383 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1619 place count 382 transition count 376
Applied a total of 1619 rules in 87 ms. Remains 382 /1182 variables (removed 800) and now considering 376/1082 (removed 706) transitions.
Finished structural reductions, in 1 iterations. Remains : 382/1182 places, 376/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 195213 steps, run timeout after 3003 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195213 steps, saw 125789 distinct states, run finished after 3003 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 376 rows 382 cols
[2022-05-19 11:14:47] [INFO ] Computed 179 place invariants in 0 ms
[2022-05-19 11:14:47] [INFO ] [Real]Absence check using 179 positive place invariants in 22 ms returned sat
[2022-05-19 11:14:48] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:14:48] [INFO ] [Nat]Absence check using 179 positive place invariants in 20 ms returned sat
[2022-05-19 11:14:48] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:14:48] [INFO ] After 92ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:48] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-05-19 11:14:48] [INFO ] After 691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 3 out of 382 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 382/382 places, 376/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 376/376 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 382/382 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 382 /382 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 382 cols
[2022-05-19 11:14:48] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:14:49] [INFO ] Implicit Places using invariants in 177 ms returned [371]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 381/382 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 380 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 380 transition count 375
Applied a total of 2 rules in 9 ms. Remains 380 /381 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:49] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:49] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:49] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:49] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 380/382 places, 375/376 transitions.
Finished structural reductions, in 2 iterations. Remains : 380/382 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
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 :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
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 :0
Interrupted probabilistic random walk after 208368 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208368 steps, saw 134888 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:52] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:14:53] [INFO ] [Real]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:14:53] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:14:53] [INFO ] [Nat]Absence check using 178 positive place invariants in 24 ms returned sat
[2022-05-19 11:14:53] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:53] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-19 11:14:53] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 380/380 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:53] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:14:54] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:54] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:54] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2022-05-19 11:14:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:54] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:54] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 380/380 places, 375/375 transitions.
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 41 place count 380 transition count 375
Applied a total of 41 rules in 10 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 375 rows 380 cols
[2022-05-19 11:14:54] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:14:54] [INFO ] [Real]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:14:54] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:14:54] [INFO ] [Nat]Absence check using 178 positive place invariants in 31 ms returned sat
[2022-05-19 11:14:55] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-05-19 11:14:55] [INFO ] After 108ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:55] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 106 ms.
[2022-05-19 11:14:55] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:14:55] [INFO ] Flatten gal took : 14 ms
[2022-05-19 11:14:55] [INFO ] Flatten gal took : 13 ms
[2022-05-19 11:14:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality613577689853756888.gal : 2 ms
[2022-05-19 11:14:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1894843759687422576.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14501916905820104471;'/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/ReachabilityCardinality613577689853756888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1894843759687422576.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...318
Loading property file /tmp/ReachabilityCardinality1894843759687422576.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :30 after 87
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :87 after 181
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :181 after 237
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :237 after 541
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :541 after 11294
Reachability property apf8 is true.
Reachability property apf6 is true.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :11294 after 190593
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :190593 after 399391
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :399391 after 1.10535e+07
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.10535e+07 after 8.19355e+07
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :8.19355e+07 after 5.40257e+10
Detected timeout of ITS tools.
[2022-05-19 11:15:10] [INFO ] Flatten gal took : 13 ms
[2022-05-19 11:15:10] [INFO ] Applying decomposition
[2022-05-19 11:15:10] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5836723290082575472.txt' '-o' '/tmp/graph5836723290082575472.bin' '-w' '/tmp/graph5836723290082575472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5836723290082575472.bin' '-l' '-1' '-v' '-w' '/tmp/graph5836723290082575472.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:15:10] [INFO ] Decomposing Gal with order
[2022-05-19 11:15:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:15:10] [INFO ] Removed a total of 211 redundant transitions.
[2022-05-19 11:15:10] [INFO ] Flatten gal took : 21 ms
[2022-05-19 11:15:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2022-05-19 11:15:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11645771415012020407.gal : 3 ms
[2022-05-19 11:15:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17094402914560106647.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14501916905820104471;'/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/ReachabilityCardinality11645771415012020407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17094402914560106647.prop' '--nowitness'

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...300
Loading property file /tmp/ReachabilityCardinality17094402914560106647.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :3 after 25920
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :92160 after 9.12673e+10
Reachability property apf7 is true.
Reachability property apf4 is true.
Reachability property apf3 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.94857e+23,1.52502,57828,1174,123,98247,1137,472,317234,84,17481,0
Total reachable state count : 894857153723286305439744

Verifying 5 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,2.49108e+12,1.53048,58092,118,45,98247,1137,482,317234,89,17481,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,2.49108e+12,1.53084,58092,118,45,98247,1137,482,317234,89,17481,0
Reachability property apf3 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
apf3,4.98216e+11,1.53116,58092,115,44,98247,1137,487,317234,91,17481,0
Reachability property apf4 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
apf4,3.41987e+12,1.5318,58092,120,48,98247,1137,495,317234,91,17481,0
Reachability property apf7 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
apf7,1.99286e+12,1.53215,58092,118,44,98247,1137,500,317234,93,17481,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR (AND p1 p2) (AND p0 p2))))]
Knowledge based reduction with 8 factoid took 424 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 1372 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 24996 reset in 519 ms.
Product exploration explored 100000 steps with 25057 reset in 520 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1182 transition count 1082
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 238 place count 1182 transition count 1144
Deduced a syphon composed of 319 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 319 place count 1182 transition count 1144
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 717 places in 0 ms
Iterating global reduction 1 with 398 rules applied. Total rules applied 717 place count 1182 transition count 1145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 718 place count 1182 transition count 1144
Renaming transitions due to excessive name length > 1024 char.
Discarding 159 places :
Symmetric choice reduction at 2 with 159 rule applications. Total rules 877 place count 1023 transition count 985
Deduced a syphon composed of 558 places in 0 ms
Iterating global reduction 2 with 159 rules applied. Total rules applied 1036 place count 1023 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 559 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1037 place count 1023 transition count 985
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1039 place count 1021 transition count 983
Deduced a syphon composed of 557 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1041 place count 1021 transition count 983
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -411
Deduced a syphon composed of 634 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1118 place count 1021 transition count 1394
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1195 place count 944 transition count 1240
Deduced a syphon composed of 557 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1272 place count 944 transition count 1240
Deduced a syphon composed of 557 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1281 place count 944 transition count 1231
Deduced a syphon composed of 557 places in 1 ms
Applied a total of 1281 rules in 564 ms. Remains 944 /1182 variables (removed 238) and now considering 1231/1082 (removed -149) transitions.
[2022-05-19 11:15:16] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1231 rows 944 cols
[2022-05-19 11:15:16] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 11:15:17] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 944/1182 places, 1231/1082 transitions.
Finished structural reductions, in 1 iterations. Remains : 944/1182 places, 1231/1082 transitions.
Product exploration explored 100000 steps with 25000 reset in 2092 ms.
Product exploration explored 100000 steps with 24995 reset in 2077 ms.
Built C files in :
/tmp/ltsmin413790390230321456
[2022-05-19 11:15:21] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin413790390230321456
Running compilation step : cd /tmp/ltsmin413790390230321456;'/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 1652 ms.
Running link step : cd /tmp/ltsmin413790390230321456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin413790390230321456;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8257610718453318847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 39 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:15:36] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:15:36] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:15:36] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 11:15:37] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:15:37] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 11:15:37] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1182/1182 places, 1082/1082 transitions.
Built C files in :
/tmp/ltsmin7148251823609602764
[2022-05-19 11:15:37] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7148251823609602764
Running compilation step : cd /tmp/ltsmin7148251823609602764;'/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 1569 ms.
Running link step : cd /tmp/ltsmin7148251823609602764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7148251823609602764;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11497357816358236376.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 11:15:53] [INFO ] Flatten gal took : 26 ms
[2022-05-19 11:15:53] [INFO ] Flatten gal took : 25 ms
[2022-05-19 11:15:53] [INFO ] Time to serialize gal into /tmp/LTL5643897184987829136.gal : 3 ms
[2022-05-19 11:15:53] [INFO ] Time to serialize properties into /tmp/LTL13869387065224196876.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5643897184987829136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13869387065224196876.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5643897...267
Read 1 LTL properties
Checking formula 0 : !((G((G(("(p305==1)")U("(p118!=1)")))||(X(X("(p813==0)"))))))
Formula 0 simplified : !G(G("(p305==1)" U "(p118!=1)") | XX"(p813==0)")
Detected timeout of ITS tools.
[2022-05-19 11:16:08] [INFO ] Flatten gal took : 41 ms
[2022-05-19 11:16:08] [INFO ] Applying decomposition
[2022-05-19 11:16:08] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph902523779792764900.txt' '-o' '/tmp/graph902523779792764900.bin' '-w' '/tmp/graph902523779792764900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph902523779792764900.bin' '-l' '-1' '-v' '-w' '/tmp/graph902523779792764900.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:16:08] [INFO ] Decomposing Gal with order
[2022-05-19 11:16:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:16:08] [INFO ] Removed a total of 203 redundant transitions.
[2022-05-19 11:16:08] [INFO ] Flatten gal took : 51 ms
[2022-05-19 11:16:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 11:16:08] [INFO ] Time to serialize gal into /tmp/LTL10648835330506337340.gal : 11 ms
[2022-05-19 11:16:08] [INFO ] Time to serialize properties into /tmp/LTL11261566431259590580.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10648835330506337340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11261566431259590580.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1064883...247
Read 1 LTL properties
Checking formula 0 : !((G((G(("(i4.i1.u101.p305==1)")U("(i1.i3.u40.p118!=1)")))||(X(X("(i11.i4.u262.p813==0)"))))))
Formula 0 simplified : !G(G("(i4.i1.u101.p305==1)" U "(i1.i3.u40.p118!=1)") | XX"(i11.i4.u262.p813==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9993639049770441708
[2022-05-19 11:16:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9993639049770441708
Running compilation step : cd /tmp/ltsmin9993639049770441708;'/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 1662 ms.
Running link step : cd /tmp/ltsmin9993639049770441708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9993639049770441708;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](((LTLAPp0==true) U (LTLAPp1==true)))||X(X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-02 finished in 177465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(X((G(p0) U (G(F(p2))&&p1)))) U (p2 U p3)))'
Support contains 7 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1181 transition count 1081
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1181 transition count 1081
Applied a total of 20 rules in 79 ms. Remains 1181 /1191 variables (removed 10) and now considering 1081/1091 (removed 10) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:16:38] [INFO ] Computed 181 place invariants in 3 ms
[2022-05-19 11:16:39] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:16:39] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 11:16:39] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:16:39] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:16:40] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1191 places, 1081/1091 transitions.
Finished structural reductions, in 1 iterations. Remains : 1181/1191 places, 1081/1091 transitions.
Stuttering acceptance computed with spot in 601 ms :[p3, true, p3, (AND p1 p2 p3), (AND p1 p2), (AND p1 p2 p3), (AND p3 p1 p2), p2, (AND p1 p0 p2), (AND p1 p0 p3 p2), (AND p3 p1 p0 p2), (AND p2 p3), (AND p2 p0), (AND p2 p0 p3 (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 4}, { cond=(NOT p3), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND p3 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=5 dest: 6}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=5 dest: 10}], [{ cond=(AND p3 p1), acceptance={} source=6 dest: 7}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=6 dest: 11}], [{ cond=(NOT p2), acceptance={} source=7 dest: 7}, { cond=p2, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 12}], [{ cond=(AND p3 p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p0), acceptance={} source=9 dest: 9}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=9 dest: 10}], [{ cond=(AND p3 p0 p1), acceptance={} source=10 dest: 12}, { cond=(AND p2 (NOT p3) p0 p1), acceptance={} source=10 dest: 13}], [{ cond=p3, acceptance={} source=11 dest: 7}, { cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p2) p0), acceptance={} source=12 dest: 12}, { cond=(AND p2 p0), acceptance={0} source=12 dest: 12}], [{ cond=(AND p3 p0 (NOT p1)), acceptance={} source=13 dest: 12}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=13 dest: 13}]], initial=0, aps=[p3:(AND (EQ s916 1) (EQ s941 1) (EQ s950 1)), p2:(EQ s1096 1), p1:(AND (EQ s334 1) (EQ s415 1)), p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 647 ms.
Product exploration explored 100000 steps with 33333 reset in 642 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (X (NOT (AND p2 (NOT p3))))), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 (NOT p3) p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p3 p1))))
Knowledge based reduction with 14 factoid took 459 ms. Reduced automaton from 14 states, 34 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-020B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-03 finished in 4286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(!(p0 U X(p1)))||G(F(G(p2)))))))'
Support contains 2 out of 1191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1190 transition count 849
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 949 transition count 849
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 482 place count 949 transition count 694
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 792 place count 794 transition count 694
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 795 place count 791 transition count 691
Iterating global reduction 2 with 3 rules applied. Total rules applied 798 place count 791 transition count 691
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 798 place count 791 transition count 689
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 802 place count 789 transition count 689
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: 344
Deduced a syphon composed of 344 places in 0 ms
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 2 with 688 rules applied. Total rules applied 1490 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1491 place count 445 transition count 344
Renaming transitions due to excessive name length > 1024 char.
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 1493 place count 444 transition count 343
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1611 place count 385 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1613 place count 383 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1615 place count 381 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1615 place count 381 transition count 379
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1617 place count 380 transition count 379
Applied a total of 1617 rules in 99 ms. Remains 380 /1191 variables (removed 811) and now considering 379/1091 (removed 712) transitions.
// Phase 1: matrix 379 rows 380 cols
[2022-05-19 11:16:42] [INFO ] Computed 179 place invariants in 2 ms
[2022-05-19 11:16:43] [INFO ] Implicit Places using invariants in 180 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/1191 places, 379/1091 transitions.
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 2 place count 378 transition count 378
Applied a total of 2 rules in 9 ms. Remains 378 /379 variables (removed 1) and now considering 378/379 (removed 1) transitions.
// Phase 1: matrix 378 rows 378 cols
[2022-05-19 11:16:43] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:16:43] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 378 rows 378 cols
[2022-05-19 11:16:43] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:16:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 11:16:43] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 378/1191 places, 378/1091 transitions.
Finished structural reductions, in 2 iterations. Remains : 378/1191 places, 378/1091 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p2) p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(EQ s262 0), p1:(EQ s193 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 463 ms.
Product exploration explored 100000 steps with 0 reset in 651 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/378 stabilizing places and 2/378 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 485 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 378 rows 378 cols
[2022-05-19 11:16:45] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:16:45] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:16:45] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:16:46] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:16:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 11:16:46] [INFO ] After 13ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:16:46] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-19 11:16:46] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 378/378 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 378 transition count 377
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 378 transition count 377
Applied a total of 2 rules in 13 ms. Remains 378 /378 variables (removed 0) and now considering 377/378 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 377/378 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 586678 steps, run timeout after 3011 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 586678 steps, saw 377031 distinct states, run finished after 3011 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 377 rows 378 cols
[2022-05-19 11:16:49] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:16:49] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:16:49] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:16:49] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:16:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 11:16:49] [INFO ] After 23ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:16:49] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-19 11:16:49] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 377/377 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 377/377 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 377/377 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 377/377 (removed 0) transitions.
// Phase 1: matrix 377 rows 378 cols
[2022-05-19 11:16:49] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:16:49] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 377 rows 378 cols
[2022-05-19 11:16:49] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:16:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 11:16:50] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2022-05-19 11:16:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 377 rows 378 cols
[2022-05-19 11:16:50] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:16:50] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 377/377 transitions.
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 378 transition count 377
Applied a total of 42 rules in 9 ms. Remains 378 /378 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 377 rows 378 cols
[2022-05-19 11:16:50] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:16:50] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:16:50] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:16:50] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:16:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 11:16:50] [INFO ] After 16ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:16:50] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-19 11:16:50] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:16:50] [INFO ] Flatten gal took : 13 ms
[2022-05-19 11:16:50] [INFO ] Flatten gal took : 11 ms
[2022-05-19 11:16:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9906144377332088154.gal : 2 ms
[2022-05-19 11:16:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18262328812538896598.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2748674182229374430;'/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/ReachabilityCardinality9906144377332088154.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18262328812538896598.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/ReachabilityCardinality18262328812538896598.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 54
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :54 after 119
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :119 after 187
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :187 after 2066
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2066 after 32273
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :32273 after 2.70335e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.70335e+07 after 7.51619e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.51619e+13 after 2.95436e+27
Reachability property apf3 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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,1.59578e+39,0.293434,13836,2,1752,16,43239,6,0,1891,55529,0
Total reachable state count : 1595782081891310510612152320000000000000

Verifying 1 reachability properties.
Reachability property apf3 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
apf3,1,0.294699,13836,2,379,16,43239,7,0,1897,55529,0
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 401 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p2) p1)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 378/378 transitions.
Applied a total of 0 rules in 9 ms. Remains 378 /378 variables (removed 0) and now considering 378/378 (removed 0) transitions.
// Phase 1: matrix 378 rows 378 cols
[2022-05-19 11:16:51] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:16:51] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 378 rows 378 cols
[2022-05-19 11:16:51] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:16:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 11:16:51] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2022-05-19 11:16:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 378 rows 378 cols
[2022-05-19 11:16:51] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:16:51] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 378/378 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/378 stabilizing places and 2/378 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 968 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :3
Finished Best-First random walk after 7976 steps, including 2 resets, run visited all 1 properties in 18 ms. (steps per millisecond=443 )
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND (NOT p2) p1)), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 394 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p2) p1)]
Product exploration explored 100000 steps with 0 reset in 427 ms.
Product exploration explored 100000 steps with 0 reset in 558 ms.
Built C files in :
/tmp/ltsmin3209063868071539375
[2022-05-19 11:16:54] [INFO ] Computing symmetric may disable matrix : 378 transitions.
[2022-05-19 11:16:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:16:54] [INFO ] Computing symmetric may enable matrix : 378 transitions.
[2022-05-19 11:16:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:16:54] [INFO ] Computing Do-Not-Accords matrix : 378 transitions.
[2022-05-19 11:16:54] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:16:54] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3209063868071539375
Running compilation step : cd /tmp/ltsmin3209063868071539375;'/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 758 ms.
Running link step : cd /tmp/ltsmin3209063868071539375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin3209063868071539375;'/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/stateBased10367688792029895342.hoa' '--buchi-type=spotba'
LTSmin run took 920 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-020B-LTLFireability-04 finished in 13473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||!(F(p1) U p2))))'
Support contains 5 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1182 transition count 1082
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1182 transition count 1082
Applied a total of 18 rules in 67 ms. Remains 1182 /1191 variables (removed 9) and now considering 1082/1091 (removed 9) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:16:56] [INFO ] Computed 181 place invariants in 8 ms
[2022-05-19 11:16:56] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:16:56] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 11:16:57] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:16:57] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:16:57] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1191 places, 1082/1091 transitions.
Finished structural reductions, in 1 iterations. Remains : 1182/1191 places, 1082/1091 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), p1, p2, (AND p1 p2), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND p1 p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=p2, acceptance={} source=9 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 3}]], initial=8, aps=[p0:(OR (EQ s549 1) (AND (EQ s46 1) (EQ s71 1) (EQ s80 1))), p2:(EQ s651 1), p1:(AND (EQ s46 1) (EQ s71 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 53288 steps with 0 reset in 232 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-05 finished in 2248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 2 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1182 transition count 1082
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1182 transition count 1082
Applied a total of 18 rules in 67 ms. Remains 1182 /1191 variables (removed 9) and now considering 1082/1091 (removed 9) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:16:58] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:16:58] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:16:58] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:16:59] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:16:59] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 11:17:00] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1191 places, 1082/1091 transitions.
Finished structural reductions, in 1 iterations. Remains : 1182/1191 places, 1082/1091 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-06 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s919 0), p1:(NEQ s94 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 387 ms.
Product exploration explored 100000 steps with 0 reset in 523 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308798 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308798 steps, saw 156626 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:17:04] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 11:17:04] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2022-05-19 11:17:05] [INFO ] After 386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 11:17:05] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2022-05-19 11:17:05] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2022-05-19 11:17:05] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 0 ms to minimize.
[2022-05-19 11:17:06] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2022-05-19 11:17:06] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2022-05-19 11:17:06] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:17:06] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 0 ms to minimize.
[2022-05-19 11:17:06] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2022-05-19 11:17:07] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 0 ms to minimize.
[2022-05-19 11:17:07] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 1 ms to minimize.
[2022-05-19 11:17:07] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2022-05-19 11:17:07] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2022-05-19 11:17:07] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 0 ms to minimize.
[2022-05-19 11:17:07] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2022-05-19 11:17:08] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-05-19 11:17:08] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2022-05-19 11:17:08] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2022-05-19 11:17:08] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 0 ms to minimize.
[2022-05-19 11:17:08] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 0 ms to minimize.
[2022-05-19 11:17:08] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2022-05-19 11:17:09] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-19 11:17:09] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2022-05-19 11:17:09] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 0 ms to minimize.
[2022-05-19 11:17:09] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 0 ms to minimize.
[2022-05-19 11:17:09] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4366 ms
[2022-05-19 11:17:09] [INFO ] After 4792ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:09] [INFO ] After 4981ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:09] [INFO ] [Nat]Absence check using 181 positive place invariants in 42 ms returned sat
[2022-05-19 11:17:10] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:10] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 0 ms to minimize.
[2022-05-19 11:17:10] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 0 ms to minimize.
[2022-05-19 11:17:10] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 0 ms to minimize.
[2022-05-19 11:17:10] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2022-05-19 11:17:11] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:17:11] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:17:11] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2022-05-19 11:17:11] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:17:11] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 1 ms to minimize.
[2022-05-19 11:17:12] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 0 ms to minimize.
[2022-05-19 11:17:12] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2022-05-19 11:17:12] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2022-05-19 11:17:12] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 0 ms to minimize.
[2022-05-19 11:17:12] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2022-05-19 11:17:12] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2022-05-19 11:17:13] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2022-05-19 11:17:13] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2022-05-19 11:17:13] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2022-05-19 11:17:13] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2022-05-19 11:17:13] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2022-05-19 11:17:13] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2022-05-19 11:17:14] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2022-05-19 11:17:14] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2022-05-19 11:17:14] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2022-05-19 11:17:14] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 0 ms to minimize.
[2022-05-19 11:17:14] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4337 ms
[2022-05-19 11:17:14] [INFO ] After 4754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-19 11:17:14] [INFO ] After 4985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1182 transition count 842
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 942 transition count 842
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 480 place count 942 transition count 682
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 800 place count 782 transition count 682
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1480 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1481 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1483 place count 441 transition count 340
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1601 place count 382 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1602 place count 382 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1622 place count 382 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1623 place count 381 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1625 place count 379 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1625 place count 379 transition count 376
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 1627 place count 378 transition count 376
Applied a total of 1627 rules in 70 ms. Remains 378 /1182 variables (removed 804) and now considering 376/1082 (removed 706) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/1182 places, 376/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 582828 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 582828 steps, saw 374499 distinct states, run finished after 3002 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 378 cols
[2022-05-19 11:17:17] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:17:17] [INFO ] [Real]Absence check using 179 positive place invariants in 20 ms returned sat
[2022-05-19 11:17:17] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 11:17:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:17:17] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:17] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:17] [INFO ] [Nat]Absence check using 179 positive place invariants in 19 ms returned sat
[2022-05-19 11:17:18] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:18] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:18] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-19 11:17:18] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 376/376 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 4 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 378 cols
[2022-05-19 11:17:18] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:17:18] [INFO ] Implicit Places using invariants in 185 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 187 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 377/378 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 375
Applied a total of 2 rules in 7 ms. Remains 376 /377 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:18] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:18] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:18] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:17:18] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 376/378 places, 375/376 transitions.
Finished structural reductions, in 2 iterations. Remains : 376/378 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 568763 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568763 steps, saw 365197 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:21] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:21] [INFO ] [Real]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:17:22] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:22] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:17:22] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:22] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-19 11:17:22] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 376/376 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 376/376 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 376/376 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:22] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:17:22] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:22] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:22] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2022-05-19 11:17:22] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:22] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:17:23] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 376/376 places, 375/375 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 376 transition count 375
Applied a total of 40 rules in 9 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:23] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:23] [INFO ] [Real]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:17:23] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 11:17:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-19 11:17:23] [INFO ] After 24ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:23] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:23] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:17:23] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:23] [INFO ] After 30ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:23] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-19 11:17:23] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:23] [INFO ] Flatten gal took : 14 ms
[2022-05-19 11:17:23] [INFO ] Flatten gal took : 13 ms
[2022-05-19 11:17:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13439983780787353858.gal : 2 ms
[2022-05-19 11:17:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9903269058122319620.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17519556393941832543;'/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/ReachabilityCardinality13439983780787353858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9903269058122319620.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/ReachabilityCardinality9903269058122319620.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 603
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,10850,0.112594,7424,2,1168,12,6835,6,0,1863,4855,0
Total reachable state count : 10850

Verifying 1 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,752,0.113831,7688,2,482,12,6835,7,0,1866,4855,0
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 1182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 38 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:17:23] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 11:17:24] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:17:24] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 11:17:25] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:17:25] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 11:17:25] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 2917 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 305930 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305930 steps, saw 155142 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:17:31] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 11:17:31] [INFO ] [Real]Absence check using 181 positive place invariants in 42 ms returned sat
[2022-05-19 11:17:32] [INFO ] After 386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 11:17:32] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
[2022-05-19 11:17:32] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2022-05-19 11:17:32] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 0 ms to minimize.
[2022-05-19 11:17:33] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2022-05-19 11:17:33] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:17:33] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:17:33] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2022-05-19 11:17:33] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 0 ms to minimize.
[2022-05-19 11:17:34] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2022-05-19 11:17:34] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2022-05-19 11:17:34] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-19 11:17:34] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 1 ms to minimize.
[2022-05-19 11:17:34] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2022-05-19 11:17:34] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2022-05-19 11:17:35] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2022-05-19 11:17:35] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2022-05-19 11:17:35] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2022-05-19 11:17:35] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2022-05-19 11:17:35] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2022-05-19 11:17:35] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 0 ms to minimize.
[2022-05-19 11:17:36] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2022-05-19 11:17:36] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2022-05-19 11:17:36] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2022-05-19 11:17:36] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2022-05-19 11:17:36] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4335 ms
[2022-05-19 11:17:36] [INFO ] After 4756ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:36] [INFO ] After 4938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:36] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2022-05-19 11:17:37] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:37] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2022-05-19 11:17:37] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 1 ms to minimize.
[2022-05-19 11:17:37] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 0 ms to minimize.
[2022-05-19 11:17:38] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2022-05-19 11:17:38] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 0 ms to minimize.
[2022-05-19 11:17:38] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:17:38] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:17:38] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2022-05-19 11:17:39] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 1 ms to minimize.
[2022-05-19 11:17:39] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2022-05-19 11:17:39] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2022-05-19 11:17:39] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2022-05-19 11:17:39] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2022-05-19 11:17:39] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2022-05-19 11:17:40] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2022-05-19 11:17:40] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-05-19 11:17:40] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2022-05-19 11:17:40] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 0 ms to minimize.
[2022-05-19 11:17:40] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2022-05-19 11:17:40] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2022-05-19 11:17:41] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2022-05-19 11:17:41] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2022-05-19 11:17:41] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2022-05-19 11:17:41] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2022-05-19 11:17:41] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 0 ms to minimize.
[2022-05-19 11:17:41] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4442 ms
[2022-05-19 11:17:41] [INFO ] After 4863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-19 11:17:41] [INFO ] After 5087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1182 transition count 842
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 942 transition count 842
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 480 place count 942 transition count 682
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 800 place count 782 transition count 682
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1480 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1481 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
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 1483 place count 441 transition count 340
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1601 place count 382 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1602 place count 382 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1622 place count 382 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1623 place count 381 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1625 place count 379 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1625 place count 379 transition count 376
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1627 place count 378 transition count 376
Applied a total of 1627 rules in 68 ms. Remains 378 /1182 variables (removed 804) and now considering 376/1082 (removed 706) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/1182 places, 376/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 575509 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 575509 steps, saw 369893 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 378 cols
[2022-05-19 11:17:44] [INFO ] Computed 179 place invariants in 2 ms
[2022-05-19 11:17:44] [INFO ] [Real]Absence check using 179 positive place invariants in 19 ms returned sat
[2022-05-19 11:17:45] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 11:17:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:17:45] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:45] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:45] [INFO ] [Nat]Absence check using 179 positive place invariants in 20 ms returned sat
[2022-05-19 11:17:45] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:45] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:45] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-19 11:17:45] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 378/378 places, 376/376 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 378 cols
[2022-05-19 11:17:45] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:17:45] [INFO ] Implicit Places using invariants in 178 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 377/378 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 375
Applied a total of 2 rules in 6 ms. Remains 376 /377 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:45] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:45] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:45] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:17:45] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 376/378 places, 375/376 transitions.
Finished structural reductions, in 2 iterations. Remains : 376/378 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596215 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596215 steps, saw 382509 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:49] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:49] [INFO ] [Real]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:17:49] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:49] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:17:49] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:49] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-19 11:17:49] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 376/376 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 376/376 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 376/376 places, 375/375 transitions.
Applied a total of 0 rules in 4 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:49] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:17:49] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:49] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:49] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2022-05-19 11:17:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:49] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:50] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 376/376 places, 375/375 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 376 transition count 375
Applied a total of 40 rules in 9 ms. Remains 376 /376 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 376 cols
[2022-05-19 11:17:50] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:17:50] [INFO ] [Real]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:17:50] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 11:17:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-19 11:17:50] [INFO ] After 22ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:50] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:17:50] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:17:50] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:50] [INFO ] After 32ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:50] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-19 11:17:50] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:17:50] [INFO ] Flatten gal took : 13 ms
[2022-05-19 11:17:50] [INFO ] Flatten gal took : 13 ms
[2022-05-19 11:17:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7462862620882658857.gal : 2 ms
[2022-05-19 11:17:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2079718314688474196.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8823404917494617171;'/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/ReachabilityCardinality7462862620882658857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2079718314688474196.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/ReachabilityCardinality2079718314688474196.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 603
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,10850,0.106368,7424,2,1168,12,6835,6,0,1863,4855,0
Total reachable state count : 10850

Verifying 1 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,752,0.107512,7688,2,482,12,6835,7,0,1866,4855,0
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 411 ms.
Product exploration explored 100000 steps with 0 reset in 483 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1182 transition count 1082
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 240 place count 1182 transition count 1144
Deduced a syphon composed of 321 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 321 place count 1182 transition count 1144
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 720 places in 1 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 720 place count 1182 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 721 place count 1182 transition count 1143
Renaming transitions due to excessive name length > 1024 char.
Discarding 161 places :
Symmetric choice reduction at 2 with 161 rule applications. Total rules 882 place count 1021 transition count 982
Deduced a syphon composed of 559 places in 1 ms
Iterating global reduction 2 with 161 rules applied. Total rules applied 1043 place count 1021 transition count 982
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1044 place count 1021 transition count 982
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1046 place count 1019 transition count 980
Deduced a syphon composed of 558 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1048 place count 1019 transition count 980
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -424
Deduced a syphon composed of 637 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1127 place count 1019 transition count 1404
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 1206 place count 940 transition count 1246
Deduced a syphon composed of 558 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 1285 place count 940 transition count 1246
Deduced a syphon composed of 558 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1294 place count 940 transition count 1237
Deduced a syphon composed of 558 places in 0 ms
Applied a total of 1294 rules in 261 ms. Remains 940 /1182 variables (removed 242) and now considering 1237/1082 (removed -155) transitions.
[2022-05-19 11:17:52] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1237 rows 940 cols
[2022-05-19 11:17:52] [INFO ] Computed 181 place invariants in 9 ms
[2022-05-19 11:17:52] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1182 places, 1237/1082 transitions.
Finished structural reductions, in 1 iterations. Remains : 940/1182 places, 1237/1082 transitions.
Entered a terminal (fully accepting) state of product in 28885 steps with 0 reset in 177 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-06 finished in 54598 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1190 transition count 850
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 950 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 949 transition count 849
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 482 place count 949 transition count 694
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 792 place count 794 transition count 694
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 796 place count 790 transition count 690
Iterating global reduction 3 with 4 rules applied. Total rules applied 800 place count 790 transition count 690
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 800 place count 790 transition count 687
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 806 place count 787 transition count 687
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: 344
Deduced a syphon composed of 344 places in 0 ms
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 3 with 688 rules applied. Total rules applied 1494 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1495 place count 443 transition count 342
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1497 place count 442 transition count 341
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1613 place count 384 transition count 378
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1615 place count 382 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1617 place count 380 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1617 place count 380 transition count 375
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 1619 place count 379 transition count 375
Applied a total of 1619 rules in 84 ms. Remains 379 /1191 variables (removed 812) and now considering 375/1091 (removed 716) transitions.
// Phase 1: matrix 375 rows 379 cols
[2022-05-19 11:17:53] [INFO ] Computed 179 place invariants in 2 ms
[2022-05-19 11:17:53] [INFO ] Implicit Places using invariants in 180 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/1191 places, 375/1091 transitions.
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 2 place count 377 transition count 374
Applied a total of 2 rules in 7 ms. Remains 377 /378 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:17:53] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:17:53] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:17:53] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:17:53] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/1191 places, 374/1091 transitions.
Finished structural reductions, in 2 iterations. Remains : 377/1191 places, 374/1091 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-07 finished in 779 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U !(G(p1)||p2))))'
Support contains 3 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1182 transition count 1082
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1182 transition count 1082
Applied a total of 18 rules in 67 ms. Remains 1182 /1191 variables (removed 9) and now considering 1082/1091 (removed 9) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:17:54] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 11:17:54] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:17:54] [INFO ] Computed 181 place invariants in 2 ms
[2022-05-19 11:17:55] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
// Phase 1: matrix 1082 rows 1182 cols
[2022-05-19 11:17:55] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 11:17:55] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1191 places, 1082/1091 transitions.
Finished structural reductions, in 1 iterations. Remains : 1182/1191 places, 1082/1091 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), p0, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=1, aps=[p2:(NEQ s174 1), p1:(EQ s842 1), p0:(EQ s81 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 891 ms.
Product exploration explored 100000 steps with 50000 reset in 909 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1182 stabilizing places and 318/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1))))
Knowledge based reduction with 11 factoid took 161 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-020B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-08 finished in 3817 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 1191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1190 transition count 850
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 950 transition count 850
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 480 place count 950 transition count 695
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 790 place count 795 transition count 695
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 794 place count 791 transition count 691
Iterating global reduction 2 with 4 rules applied. Total rules applied 798 place count 791 transition count 691
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 798 place count 791 transition count 688
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 804 place count 788 transition count 688
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 1 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1484 place count 448 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1485 place count 448 transition count 347
Renaming transitions due to excessive name length > 1024 char.
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 1487 place count 447 transition count 346
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1605 place count 388 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1607 place count 386 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1609 place count 384 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1609 place count 384 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1611 place count 383 transition count 382
Applied a total of 1611 rules in 88 ms. Remains 383 /1191 variables (removed 808) and now considering 382/1091 (removed 709) transitions.
// Phase 1: matrix 382 rows 383 cols
[2022-05-19 11:17:57] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:17:58] [INFO ] Implicit Places using invariants in 181 ms returned [372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 382/1191 places, 382/1091 transitions.
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 2 place count 381 transition count 381
Applied a total of 2 rules in 7 ms. Remains 381 /382 variables (removed 1) and now considering 381/382 (removed 1) transitions.
// Phase 1: matrix 381 rows 381 cols
[2022-05-19 11:17:58] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:17:58] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 381 rows 381 cols
[2022-05-19 11:17:58] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:17:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:17:58] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 381/1191 places, 381/1091 transitions.
Finished structural reductions, in 2 iterations. Remains : 381/1191 places, 381/1091 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s283 1) (AND (EQ s228 1) (EQ s128 1) (EQ s144 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-09 finished in 789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1181 transition count 1081
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1181 transition count 1081
Applied a total of 20 rules in 73 ms. Remains 1181 /1191 variables (removed 10) and now considering 1081/1091 (removed 10) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:17:58] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 11:17:58] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:17:58] [INFO ] Computed 181 place invariants in 5 ms
[2022-05-19 11:17:59] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:17:59] [INFO ] Computed 181 place invariants in 4 ms
[2022-05-19 11:18:00] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1191 places, 1081/1091 transitions.
Finished structural reductions, in 1 iterations. Remains : 1181/1191 places, 1081/1091 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1148 1) (EQ s1171 1) (EQ s1180 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1151 reset in 233 ms.
Product exploration explored 100000 steps with 1144 reset in 289 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
// Phase 1: matrix 1081 rows 1181 cols
[2022-05-19 11:18:01] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 11:18:01] [INFO ] [Real]Absence check using 181 positive place invariants in 135 ms returned sat
[2022-05-19 11:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:18:04] [INFO ] [Real]Absence check using state equation in 2656 ms returned sat
[2022-05-19 11:18:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:18:04] [INFO ] [Nat]Absence check using 181 positive place invariants in 135 ms returned sat
[2022-05-19 11:18:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:18:07] [INFO ] [Nat]Absence check using state equation in 2687 ms returned sat
[2022-05-19 11:18:07] [INFO ] Computed and/alt/rep : 1080/1621/1080 causal constraints (skipped 0 transitions) in 52 ms.
[2022-05-19 11:18:19] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 11:18:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 3 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1180 transition count 841
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 941 transition count 841
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 478 place count 941 transition count 683
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 794 place count 783 transition count 683
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1470 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1471 place count 445 transition count 344
Renaming transitions due to excessive name length > 1024 char.
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 1473 place count 444 transition count 343
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1591 place count 385 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1593 place count 383 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1594 place count 382 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1594 place count 382 transition count 379
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1596 place count 381 transition count 379
Applied a total of 1596 rules in 70 ms. Remains 381 /1181 variables (removed 800) and now considering 379/1081 (removed 702) transitions.
// Phase 1: matrix 379 rows 381 cols
[2022-05-19 11:18:19] [INFO ] Computed 180 place invariants in 2 ms
[2022-05-19 11:18:19] [INFO ] Implicit Places using invariants in 175 ms returned [366]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1181 places, 379/1081 transitions.
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 2 place count 379 transition count 378
Applied a total of 2 rules in 9 ms. Remains 379 /380 variables (removed 1) and now considering 378/379 (removed 1) transitions.
// Phase 1: matrix 378 rows 379 cols
[2022-05-19 11:18:19] [INFO ] Computed 179 place invariants in 1 ms
[2022-05-19 11:18:20] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 378 rows 379 cols
[2022-05-19 11:18:20] [INFO ] Computed 179 place invariants in 0 ms
[2022-05-19 11:18:20] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1181 places, 378/1081 transitions.
Finished structural reductions, in 2 iterations. Remains : 379/1181 places, 378/1081 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 p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
// Phase 1: matrix 378 rows 379 cols
[2022-05-19 11:18:20] [INFO ] Computed 179 place invariants in 2 ms
[2022-05-19 11:18:20] [INFO ] [Real]Absence check using 179 positive place invariants in 48 ms returned sat
[2022-05-19 11:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:18:21] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2022-05-19 11:18:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:18:21] [INFO ] [Nat]Absence check using 179 positive place invariants in 49 ms returned sat
[2022-05-19 11:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:18:21] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2022-05-19 11:18:21] [INFO ] Computed and/alt/rep : 375/581/375 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-19 11:18:23] [INFO ] Added : 281 causal constraints over 57 iterations in 1781 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 454 ms.
Product exploration explored 100000 steps with 25000 reset in 518 ms.
Built C files in :
/tmp/ltsmin17511824596037699395
[2022-05-19 11:18:24] [INFO ] Computing symmetric may disable matrix : 378 transitions.
[2022-05-19 11:18:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:18:24] [INFO ] Computing symmetric may enable matrix : 378 transitions.
[2022-05-19 11:18:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:18:24] [INFO ] Computing Do-Not-Accords matrix : 378 transitions.
[2022-05-19 11:18:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:18:24] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17511824596037699395
Running compilation step : cd /tmp/ltsmin17511824596037699395;'/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 766 ms.
Running link step : cd /tmp/ltsmin17511824596037699395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17511824596037699395;'/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/stateBased13712899266278557721.hoa' '--buchi-type=spotba'
LTSmin run took 539 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-020B-LTLFireability-10 finished in 27409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F((F(p0)&&X(p1)))||F(p2))) U p3))'
Support contains 4 out of 1191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1190 transition count 851
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 951 transition count 851
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 478 place count 951 transition count 697
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 786 place count 797 transition count 697
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 789 place count 794 transition count 694
Iterating global reduction 2 with 3 rules applied. Total rules applied 792 place count 794 transition count 694
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 792 place count 794 transition count 692
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 796 place count 792 transition count 692
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 2 with 690 rules applied. Total rules applied 1486 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1487 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
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 1489 place count 446 transition count 345
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1603 place count 389 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1605 place count 387 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1607 place count 385 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1607 place count 385 transition count 378
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1609 place count 384 transition count 378
Applied a total of 1609 rules in 96 ms. Remains 384 /1191 variables (removed 807) and now considering 378/1091 (removed 713) transitions.
// Phase 1: matrix 378 rows 384 cols
[2022-05-19 11:18:26] [INFO ] Computed 179 place invariants in 2 ms
[2022-05-19 11:18:26] [INFO ] Implicit Places using invariants in 176 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/1191 places, 378/1091 transitions.
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 2 place count 382 transition count 377
Applied a total of 2 rules in 8 ms. Remains 382 /383 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 382 cols
[2022-05-19 11:18:26] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:18:26] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 377 rows 382 cols
[2022-05-19 11:18:26] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:18:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:18:26] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 382/1191 places, 377/1091 transitions.
Finished structural reductions, in 2 iterations. Remains : 382/1191 places, 377/1091 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s20 1), p2:(EQ s156 1), p0:(EQ s329 1), p1:(EQ s114 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-12 finished in 1085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1190 transition count 849
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 949 transition count 849
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 482 place count 949 transition count 694
Deduced a syphon composed of 155 places in 0 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 792 place count 794 transition count 694
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 796 place count 790 transition count 690
Iterating global reduction 2 with 4 rules applied. Total rules applied 800 place count 790 transition count 690
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 800 place count 790 transition count 687
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 806 place count 787 transition count 687
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: 344
Deduced a syphon composed of 344 places in 0 ms
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 2 with 688 rules applied. Total rules applied 1494 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1495 place count 443 transition count 342
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1497 place count 442 transition count 341
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1613 place count 384 transition count 379
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1615 place count 382 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1617 place count 380 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1617 place count 380 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1619 place count 379 transition count 376
Applied a total of 1619 rules in 89 ms. Remains 379 /1191 variables (removed 812) and now considering 376/1091 (removed 715) transitions.
// Phase 1: matrix 376 rows 379 cols
[2022-05-19 11:18:27] [INFO ] Computed 179 place invariants in 2 ms
[2022-05-19 11:18:27] [INFO ] Implicit Places using invariants in 177 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/1191 places, 376/1091 transitions.
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 2 place count 377 transition count 375
Applied a total of 2 rules in 7 ms. Remains 377 /378 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 377 cols
[2022-05-19 11:18:27] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:27] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 375 rows 377 cols
[2022-05-19 11:18:27] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:27] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/1191 places, 375/1091 transitions.
Finished structural reductions, in 2 iterations. Remains : 377/1191 places, 375/1091 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s54 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 410 ms.
Product exploration explored 100000 steps with 0 reset in 490 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 610928 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610928 steps, saw 372764 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 377 cols
[2022-05-19 11:18:31] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:31] [INFO ] [Real]Absence check using 178 positive place invariants in 18 ms returned sat
[2022-05-19 11:18:32] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:18:32] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:18:32] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:18:32] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-19 11:18:32] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 377 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 377/377 places, 375/375 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 377 transition count 374
Applied a total of 1 rules in 7 ms. Remains 377 /377 variables (removed 0) and now considering 374/375 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 374/375 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627356 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627356 steps, saw 397334 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:35] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:35] [INFO ] [Real]Absence check using 178 positive place invariants in 23 ms returned sat
[2022-05-19 11:18:35] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:18:35] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:18:35] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:18:35] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-19 11:18:35] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 377 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 377/377 places, 374/374 transitions.
Applied a total of 0 rules in 6 ms. Remains 377 /377 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 374/374 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 377/377 places, 374/374 transitions.
Applied a total of 0 rules in 6 ms. Remains 377 /377 variables (removed 0) and now considering 374/374 (removed 0) transitions.
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:35] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:36] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:36] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:18:36] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2022-05-19 11:18:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:36] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:36] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 374/374 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 377 transition count 374
Applied a total of 39 rules in 8 ms. Remains 377 /377 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:36] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:18:36] [INFO ] [Real]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:18:36] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 11:18:36] [INFO ] After 130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-19 11:18:36] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-19 11:18:36] [INFO ] Flatten gal took : 17 ms
[2022-05-19 11:18:36] [INFO ] Flatten gal took : 13 ms
[2022-05-19 11:18:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12451957509179758445.gal : 2 ms
[2022-05-19 11:18:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2416935035817647809.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1022224448460785652;'/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/ReachabilityCardinality12451957509179758445.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2416935035817647809.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/ReachabilityCardinality2416935035817647809.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 188
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :188 after 3435
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3435 after 37059
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37059 after 312534
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,1.84418e+10,0.138555,7464,2,1033,14,14475,6,0,1885,14012,0
Total reachable state count : 18441830247

Verifying 1 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,1.31072e+08,0.139767,7464,2,483,14,14475,7,0,1888,14012,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 1 out of 377 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 377/377 places, 375/375 transitions.
Applied a total of 0 rules in 10 ms. Remains 377 /377 variables (removed 0) and now considering 375/375 (removed 0) transitions.
// Phase 1: matrix 375 rows 377 cols
[2022-05-19 11:18:37] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:37] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 375 rows 377 cols
[2022-05-19 11:18:37] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:18:37] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2022-05-19 11:18:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 375 rows 377 cols
[2022-05-19 11:18:37] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:18:37] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 375/375 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631696 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631696 steps, saw 386228 distinct states, run finished after 3002 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 377 cols
[2022-05-19 11:18:40] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:40] [INFO ] [Real]Absence check using 178 positive place invariants in 34 ms returned sat
[2022-05-19 11:18:41] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:18:41] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:18:41] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:18:41] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-19 11:18:41] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 377 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 377/377 places, 375/375 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 377 transition count 374
Applied a total of 1 rules in 7 ms. Remains 377 /377 variables (removed 0) and now considering 374/375 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 374/375 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618578 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 618578 steps, saw 391650 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:44] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:18:44] [INFO ] [Real]Absence check using 178 positive place invariants in 20 ms returned sat
[2022-05-19 11:18:44] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:18:44] [INFO ] [Nat]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:18:44] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:18:44] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-19 11:18:44] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 377 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 377/377 places, 374/374 transitions.
Applied a total of 0 rules in 5 ms. Remains 377 /377 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 374/374 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 377/377 places, 374/374 transitions.
Applied a total of 0 rules in 5 ms. Remains 377 /377 variables (removed 0) and now considering 374/374 (removed 0) transitions.
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:44] [INFO ] Computed 178 place invariants in 2 ms
[2022-05-19 11:18:44] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:44] [INFO ] Computed 178 place invariants in 0 ms
[2022-05-19 11:18:45] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2022-05-19 11:18:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:45] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:45] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 377/377 places, 374/374 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 377 transition count 374
Applied a total of 39 rules in 8 ms. Remains 377 /377 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 377 cols
[2022-05-19 11:18:45] [INFO ] Computed 178 place invariants in 1 ms
[2022-05-19 11:18:45] [INFO ] [Real]Absence check using 178 positive place invariants in 19 ms returned sat
[2022-05-19 11:18:45] [INFO ] After 105ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 11:18:45] [INFO ] After 126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-19 11:18:45] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-19 11:18:45] [INFO ] Flatten gal took : 10 ms
[2022-05-19 11:18:45] [INFO ] Flatten gal took : 10 ms
[2022-05-19 11:18:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10060818411456694436.gal : 2 ms
[2022-05-19 11:18:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3442978234215750361.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8359809537192147089;'/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/ReachabilityCardinality10060818411456694436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3442978234215750361.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/ReachabilityCardinality3442978234215750361.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 188
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :188 after 3435
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3435 after 37059
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :37059 after 312534
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,1.84418e+10,0.137968,7460,2,1033,14,14475,6,0,1885,14012,0
Total reachable state count : 18441830247

Verifying 1 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,1.31072e+08,0.139185,7460,2,483,14,14475,7,0,1888,14012,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Stack based approach found an accepted trace after 8471 steps with 0 reset with depth 8472 and stack size 7922 in 41 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-13 finished in 19476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)&&p1)))||F(p2)))'
Support contains 3 out of 1191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1191/1191 places, 1091/1091 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1183 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1183 transition count 1083
Applied a total of 16 rules in 71 ms. Remains 1183 /1191 variables (removed 8) and now considering 1083/1091 (removed 8) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2022-05-19 11:18:46] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:18:46] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 1083 rows 1183 cols
[2022-05-19 11:18:46] [INFO ] Computed 181 place invariants in 6 ms
[2022-05-19 11:18:47] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
// Phase 1: matrix 1083 rows 1183 cols
[2022-05-19 11:18:47] [INFO ] Computed 181 place invariants in 7 ms
[2022-05-19 11:18:48] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1191 places, 1083/1091 transitions.
Finished structural reductions, in 1 iterations. Remains : 1183/1191 places, 1083/1091 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}]], initial=3, aps=[p2:(EQ s864 1), p1:(EQ s298 1), p0:(EQ s1094 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 374 ms.
Stack based approach found an accepted trace after 4635 steps with 2 reset with depth 845 and stack size 845 in 21 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-15 finished in 2511 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U p1))||X(X(p2)))))'
[2022-05-19 11:18:49] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2279485722326608385
[2022-05-19 11:18:49] [INFO ] Applying decomposition
[2022-05-19 11:18:49] [INFO ] Computing symmetric may disable matrix : 1091 transitions.
[2022-05-19 11:18:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:18:49] [INFO ] Computing symmetric may enable matrix : 1091 transitions.
[2022-05-19 11:18:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:18:49] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9412631406453913433.txt' '-o' '/tmp/graph9412631406453913433.bin' '-w' '/tmp/graph9412631406453913433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9412631406453913433.bin' '-l' '-1' '-v' '-w' '/tmp/graph9412631406453913433.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:18:49] [INFO ] Computing Do-Not-Accords matrix : 1091 transitions.
[2022-05-19 11:18:49] [INFO ] Decomposing Gal with order
[2022-05-19 11:18:49] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:18:49] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2279485722326608385
Running compilation step : cd /tmp/ltsmin2279485722326608385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-19 11:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:18:49] [INFO ] Removed a total of 196 redundant transitions.
[2022-05-19 11:18:49] [INFO ] Flatten gal took : 48 ms
[2022-05-19 11:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-19 11:18:49] [INFO ] Time to serialize gal into /tmp/LTLFireability14588904733871134845.gal : 8 ms
[2022-05-19 11:18:49] [INFO ] Time to serialize properties into /tmp/LTLFireability14193614902189595777.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14588904733871134845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14193614902189595777.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((G((G(("(i4.i1.u99.p305==1)")U("(i1.i3.u41.p118!=1)")))||(X(X("(i11.i3.u259.p813==0)"))))))
Formula 0 simplified : !G(G("(i4.i1.u99.p305==1)" U "(i1.i3.u41.p118!=1)") | XX"(i11.i3.u259.p813==0)")
Compilation finished in 3022 ms.
Running link step : cd /tmp/ltsmin2279485722326608385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2279485722326608385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](((LTLAPp0==true) U (LTLAPp1==true)))||X(X((LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.043: LTL layer: formula: [](([](((LTLAPp0==true) U (LTLAPp1==true)))||X(X((LTLAPp2==true)))))
pins2lts-mc-linux64( 1/ 8), 0.043: "[](([](((LTLAPp0==true) U (LTLAPp1==true)))||X(X((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.043: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.101: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.244: DFS-FIFO for weak LTL, using special progress label 1095
pins2lts-mc-linux64( 0/ 8), 0.244: There are 1096 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.244: State length is 1192, there are 1111 groups
pins2lts-mc-linux64( 0/ 8), 0.244: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.244: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.244: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.244: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.329: ~1 levels ~960 states ~3824 transitions
pins2lts-mc-linux64( 1/ 8), 0.401: ~1 levels ~1920 states ~8416 transitions
pins2lts-mc-linux64( 1/ 8), 0.575: ~1 levels ~3840 states ~19952 transitions
pins2lts-mc-linux64( 1/ 8), 0.861: ~1 levels ~7680 states ~43648 transitions
pins2lts-mc-linux64( 1/ 8), 1.481: ~1 levels ~15360 states ~96144 transitions
pins2lts-mc-linux64( 0/ 8), 2.653: ~1 levels ~30720 states ~221064 transitions
pins2lts-mc-linux64( 1/ 8), 4.749: ~1 levels ~61440 states ~426280 transitions
pins2lts-mc-linux64( 1/ 8), 8.931: ~1 levels ~122880 states ~927328 transitions
pins2lts-mc-linux64( 1/ 8), 16.957: ~1 levels ~245760 states ~1973056 transitions
pins2lts-mc-linux64( 1/ 8), 32.669: ~1 levels ~491520 states ~4353320 transitions
pins2lts-mc-linux64( 1/ 8), 64.418: ~1 levels ~983040 states ~9322336 transitions
pins2lts-mc-linux64( 1/ 8), 129.199: ~1 levels ~1966080 states ~19686160 transitions
pins2lts-mc-linux64( 1/ 8), 258.967: ~1 levels ~3932160 states ~41123104 transitions
pins2lts-mc-linux64( 1/ 8), 523.616: ~1 levels ~7864320 states ~86193064 transitions
pins2lts-mc-linux64( 4/ 8), 829.637: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 829.852:
pins2lts-mc-linux64( 0/ 8), 829.852: mean standard work distribution: 8.4% (states) 8.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 829.852:
pins2lts-mc-linux64( 0/ 8), 829.853: Explored 11627762 states 140796494 transitions, fanout: 12.109
pins2lts-mc-linux64( 0/ 8), 829.853: Total exploration time 829.580 sec (829.380 sec minimum, 829.438 sec on average)
pins2lts-mc-linux64( 0/ 8), 829.853: States per second: 14016, Transitions per second: 169720
pins2lts-mc-linux64( 0/ 8), 829.853:
pins2lts-mc-linux64( 0/ 8), 829.853: Progress states detected: 28438424
pins2lts-mc-linux64( 0/ 8), 829.853: Redundant explorations: -59.1126
pins2lts-mc-linux64( 0/ 8), 829.853:
pins2lts-mc-linux64( 0/ 8), 829.853: Queue width: 8B, total height: 28406188, memory: 216.72MB
pins2lts-mc-linux64( 0/ 8), 829.853: Tree memory: 473.0MB, 17.4 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 829.853: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 829.853: Stored 1155 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 829.853: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 829.853: Est. total memory use: 689.7MB (~1240.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2279485722326608385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](((LTLAPp0==true) U (LTLAPp1==true)))||X(X((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2279485722326608385;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](((LTLAPp0==true) U (LTLAPp1==true)))||X(X((LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 11:40:58] [INFO ] Applying decomposition
[2022-05-19 11:40:58] [INFO ] Flatten gal took : 24 ms
[2022-05-19 11:40:58] [INFO ] Decomposing Gal with order
[2022-05-19 11:40:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:40:58] [INFO ] Removed a total of 57 redundant transitions.
[2022-05-19 11:40:58] [INFO ] Flatten gal took : 41 ms
[2022-05-19 11:40:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-19 11:40:58] [INFO ] Time to serialize gal into /tmp/LTLFireability16341785585522125923.gal : 8 ms
[2022-05-19 11:40:58] [INFO ] Time to serialize properties into /tmp/LTLFireability13332679660553611609.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16341785585522125923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13332679660553611609.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((G((G(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u406.p305==1)")U("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...261
Formula 0 simplified : !G(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u406.p305==1)" U "(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...250
Detected timeout of ITS tools.
[2022-05-19 12:03:09] [INFO ] Flatten gal took : 279 ms
[2022-05-19 12:03:10] [INFO ] Input system was already deterministic with 1091 transitions.
[2022-05-19 12:03:10] [INFO ] Transformed 1191 places.
[2022-05-19 12:03:10] [INFO ] Transformed 1091 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 12:03:10] [INFO ] Time to serialize gal into /tmp/LTLFireability351079880598340171.gal : 10 ms
[2022-05-19 12:03:10] [INFO ] Time to serialize properties into /tmp/LTLFireability14418701963311836712.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability351079880598340171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14418701963311836712.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((G(("(p305==1)")U("(p118!=1)")))||(X(X("(p813==0)"))))))
Formula 0 simplified : !G(G("(p305==1)" U "(p118!=1)") | XX"(p813==0)")

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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 r222-tall-165286025000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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