About the Execution of ITS-Tools for ShieldIIPt-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.592 | 3600000.00 | 4143500.00 | 367571.50 | TF?FFFFFFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025100340.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-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025100340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.4K Apr 29 19:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 19:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 18:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 18:59 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 4.0K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 539K 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-100A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652968184361
Running Version 202205111006
[2022-05-19 13:49:45] [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 13:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:49:45] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2022-05-19 13:49:45] [INFO ] Transformed 1903 places.
[2022-05-19 13:49:45] [INFO ] Transformed 1403 transitions.
[2022-05-19 13:49:45] [INFO ] Found NUPN structural information;
[2022-05-19 13:49:45] [INFO ] Parsed PT model containing 1903 places and 1403 transitions in 317 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 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 246 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:46] [INFO ] Computed 901 place invariants in 29 ms
[2022-05-19 13:49:47] [INFO ] Implicit Places using invariants in 1392 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:47] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 13:49:50] [INFO ] Implicit Places using invariants and state equation in 2584 ms returned []
Implicit Place search using SMT with State Equation took 4005 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:50] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 13:49:51] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Support contains 75 out of 1903 places after structural reductions.
[2022-05-19 13:49:51] [INFO ] Flatten gal took : 286 ms
[2022-05-19 13:49:52] [INFO ] Flatten gal took : 169 ms
[2022-05-19 13:49:52] [INFO ] Input system was already deterministic with 1402 transitions.
Support contains 72 out of 1903 places (down from 75) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=14 ) properties (out of 33) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Interrupted probabilistic random walk after 60476 steps, run timeout after 3006 ms. (steps per millisecond=20 ) properties seen :{0=1, 1=1, 3=1, 7=1, 15=1, 17=1, 18=1, 19=1, 20=1, 24=1, 26=1, 27=1, 28=1, 29=1}
Probabilistic random walk after 60476 steps, saw 59569 distinct states, run finished after 3007 ms. (steps per millisecond=20 ) properties seen :14
Running SMT prover for 16 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:49:56] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 13:49:57] [INFO ] [Real]Absence check using 901 positive place invariants in 153 ms returned sat
[2022-05-19 13:49:57] [INFO ] After 1023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 13:49:58] [INFO ] [Nat]Absence check using 901 positive place invariants in 140 ms returned sat
[2022-05-19 13:50:08] [INFO ] After 9950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-19 13:50:13] [INFO ] After 14657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 7311 ms.
[2022-05-19 13:50:20] [INFO ] After 23392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 4968 ms.
Support contains 44 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 194 times.
Drop transitions removed 194 transitions
Iterating global reduction 0 with 194 rules applied. Total rules applied 198 place count 1901 transition count 1400
Applied a total of 198 rules in 523 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 72589 steps, run timeout after 3006 ms. (steps per millisecond=24 ) properties seen :{3=1, 4=1, 6=1, 7=1, 8=1, 12=1, 14=1, 15=1}
Probabilistic random walk after 72589 steps, saw 71256 distinct states, run finished after 3006 ms. (steps per millisecond=24 ) properties seen :8
Running SMT prover for 8 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:50:30] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 13:50:30] [INFO ] [Real]Absence check using 901 positive place invariants in 147 ms returned sat
[2022-05-19 13:50:30] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 13:50:31] [INFO ] [Nat]Absence check using 901 positive place invariants in 165 ms returned sat
[2022-05-19 13:50:34] [INFO ] After 3173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 13:50:34] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-19 13:50:37] [INFO ] After 2688ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-19 13:50:40] [INFO ] After 5198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2040 ms.
[2022-05-19 13:50:42] [INFO ] After 11344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 2945 ms.
Support contains 23 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 129 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 84509 steps, run timeout after 3006 ms. (steps per millisecond=28 ) properties seen :{3=1}
Probabilistic random walk after 84509 steps, saw 83104 distinct states, run finished after 3006 ms. (steps per millisecond=28 ) properties seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:50:49] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 13:50:50] [INFO ] [Real]Absence check using 901 positive place invariants in 148 ms returned sat
[2022-05-19 13:50:50] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 13:50:50] [INFO ] [Nat]Absence check using 901 positive place invariants in 169 ms returned sat
[2022-05-19 13:50:54] [INFO ] After 3139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 13:50:54] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-19 13:50:55] [INFO ] After 1573ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 13:50:56] [INFO ] After 2733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 915 ms.
[2022-05-19 13:50:57] [INFO ] After 7625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1854 ms.
Support contains 20 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 68 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 90054 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 90054 steps, saw 88618 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :2
Running SMT prover for 5 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:51:03] [INFO ] Computed 901 place invariants in 14 ms
[2022-05-19 13:51:04] [INFO ] [Real]Absence check using 901 positive place invariants in 142 ms returned sat
[2022-05-19 13:51:04] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 13:51:04] [INFO ] [Nat]Absence check using 901 positive place invariants in 146 ms returned sat
[2022-05-19 13:51:06] [INFO ] After 1883ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 13:51:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-19 13:51:08] [INFO ] After 1732ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-19 13:51:09] [INFO ] After 2948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 428 ms.
[2022-05-19 13:51:10] [INFO ] After 5950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1697 ms.
Support contains 16 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 82 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 91002 steps, run timeout after 3007 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91002 steps, saw 89561 distinct states, run finished after 3008 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:51:16] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 13:51:16] [INFO ] [Real]Absence check using 901 positive place invariants in 153 ms returned sat
[2022-05-19 13:51:16] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 13:51:17] [INFO ] [Nat]Absence check using 901 positive place invariants in 152 ms returned sat
[2022-05-19 13:51:19] [INFO ] After 1922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 13:51:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-19 13:51:21] [INFO ] After 1741ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-19 13:51:22] [INFO ] After 2948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 426 ms.
[2022-05-19 13:51:22] [INFO ] After 6019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1650 ms.
Support contains 16 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 62 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 61 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:51:24] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:51:25] [INFO ] Implicit Places using invariants in 1385 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1392 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 72 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2022-05-19 13:51:25] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 13:51:27] [INFO ] Implicit Places using invariants in 1345 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1349 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 121 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:51:27] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 13:51:28] [INFO ] Implicit Places using invariants in 995 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:51:28] [INFO ] Computed 898 place invariants in 9 ms
[2022-05-19 13:51:29] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-19 13:51:33] [INFO ] Implicit Places using invariants and state equation in 4715 ms returned []
Implicit Place search using SMT with State Equation took 5718 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions, in 3 iterations. Remains : 1896/1901 places, 1398/1400 transitions.
FORMULA ShieldIIPt-PT-100A-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-100A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||F(p1)))))'
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 58 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:51:33] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:51:34] [INFO ] Implicit Places using invariants in 1211 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:51:34] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 13:51:37] [INFO ] Implicit Places using invariants and state equation in 2488 ms returned []
Implicit Place search using SMT with State Equation took 3701 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:51:37] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:51:38] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1761 0) (EQ s1767 0) (EQ s1769 0)), p0:(AND (EQ s1476 1) (EQ s1482 1) (EQ s1484 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6859 ms.
Product exploration explored 100000 steps with 50000 reset in 6985 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-100A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-00 finished in 18971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p0)&&G((F((p1 U !p0)) U p1))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 153 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:51:52] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 13:51:53] [INFO ] Implicit Places using invariants in 1317 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1321 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 72 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2022-05-19 13:51:53] [INFO ] Computed 899 place invariants in 2 ms
[2022-05-19 13:51:55] [INFO ] Implicit Places using invariants in 1228 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1230 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 108 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:51:55] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 13:51:56] [INFO ] Implicit Places using invariants in 1266 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:51:56] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 13:51:58] [INFO ] Implicit Places using invariants and state equation in 2373 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s778 1), p1:(AND (EQ s70 1) (EQ s76 1) (EQ s78 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]]
Product exploration explored 100000 steps with 0 reset in 1143 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-01 finished in 7867 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&X(G(p1)))))'
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 77 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:00] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:52:01] [INFO ] Implicit Places using invariants in 1168 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:01] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:52:03] [INFO ] Implicit Places using invariants and state equation in 2351 ms returned []
Implicit Place search using SMT with State Equation took 3521 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:03] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:52:04] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1629 0), p1:(OR (AND (EQ s505 1) (EQ s509 1) (EQ s515 1)) (EQ s1629 1) (EQ s12 0) (EQ s37 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1192 ms.
Product exploration explored 100000 steps with 0 reset in 1568 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 166442 steps, run timeout after 3004 ms. (steps per millisecond=55 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 166442 steps, saw 164820 distinct states, run finished after 3004 ms. (steps per millisecond=55 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:11] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 13:52:12] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:52:12] [INFO ] [Nat]Absence check using 901 positive place invariants in 153 ms returned sat
[2022-05-19 13:52:14] [INFO ] After 2226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:52:15] [INFO ] After 2548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 245 ms.
[2022-05-19 13:52:15] [INFO ] After 3237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 152 ms.
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 204 place count 1901 transition count 1400
Applied a total of 204 rules in 250 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Finished probabilistic random walk after 101587 steps, run visited all 1 properties in 1738 ms. (steps per millisecond=58 )
Probabilistic random walk after 101587 steps, saw 100090 distinct states, run finished after 1739 ms. (steps per millisecond=58 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 275 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 74 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:18] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 13:52:19] [INFO ] Implicit Places using invariants in 1183 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:19] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 13:52:21] [INFO ] Implicit Places using invariants and state equation in 2503 ms returned []
Implicit Place search using SMT with State Equation took 3688 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:21] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 13:52:22] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 174453 steps, run timeout after 3008 ms. (steps per millisecond=57 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 174453 steps, saw 172788 distinct states, run finished after 3009 ms. (steps per millisecond=57 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:26] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 13:52:27] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:52:27] [INFO ] [Nat]Absence check using 901 positive place invariants in 144 ms returned sat
[2022-05-19 13:52:29] [INFO ] After 2163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:52:29] [INFO ] After 2504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 248 ms.
[2022-05-19 13:52:30] [INFO ] After 3185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 140 ms.
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 204 place count 1901 transition count 1400
Applied a total of 204 rules in 244 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Finished probabilistic random walk after 101587 steps, run visited all 1 properties in 1717 ms. (steps per millisecond=59 )
Probabilistic random walk after 101587 steps, saw 100090 distinct states, run finished after 1718 ms. (steps per millisecond=59 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1193 ms.
Product exploration explored 100000 steps with 0 reset in 1538 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 314 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2022-05-19 13:52:36] [INFO ] Redundant transitions in 99 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:36] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:52:37] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Product exploration explored 100000 steps with 0 reset in 1194 ms.
Product exploration explored 100000 steps with 0 reset in 1536 ms.
Built C files in :
/tmp/ltsmin18350250675203705689
[2022-05-19 13:52:40] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18350250675203705689
Running compilation step : cd /tmp/ltsmin18350250675203705689;'/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 2881 ms.
Running link step : cd /tmp/ltsmin18350250675203705689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18350250675203705689;'/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/stateBased13302036112726751394.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 54 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:55] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:52:56] [INFO ] Implicit Places using invariants in 1190 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:56] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 13:52:59] [INFO ] Implicit Places using invariants and state equation in 2469 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:52:59] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 13:53:00] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin13923129435470397612
[2022-05-19 13:53:00] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13923129435470397612
Running compilation step : cd /tmp/ltsmin13923129435470397612;'/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 2733 ms.
Running link step : cd /tmp/ltsmin13923129435470397612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13923129435470397612;'/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/stateBased1410382750142843220.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:53:15] [INFO ] Flatten gal took : 115 ms
[2022-05-19 13:53:15] [INFO ] Flatten gal took : 112 ms
[2022-05-19 13:53:15] [INFO ] Time to serialize gal into /tmp/LTL870372247491467716.gal : 12 ms
[2022-05-19 13:53:15] [INFO ] Time to serialize properties into /tmp/LTL16064034882848596594.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/LTL870372247491467716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16064034882848596594.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/LTL8703722...266
Read 1 LTL properties
Checking formula 0 : !((F((X("(p1629==0)"))&&(X(G("(((((p505==1)&&(p509==1))&&(p515==1))||(p1629==1))||((p12==0)||(p37==0)))"))))))
Formula 0 simplified : !F(X"(p1629==0)" & XG"(((((p505==1)&&(p509==1))&&(p515==1))||(p1629==1))||((p12==0)||(p37==0)))")
Detected timeout of ITS tools.
[2022-05-19 13:53:30] [INFO ] Flatten gal took : 107 ms
[2022-05-19 13:53:30] [INFO ] Applying decomposition
[2022-05-19 13:53:30] [INFO ] Flatten gal took : 105 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/graph1948352429016691873.txt' '-o' '/tmp/graph1948352429016691873.bin' '-w' '/tmp/graph1948352429016691873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1948352429016691873.bin' '-l' '-1' '-v' '-w' '/tmp/graph1948352429016691873.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:53:31] [INFO ] Decomposing Gal with order
[2022-05-19 13:53:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:53:31] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-19 13:53:31] [INFO ] Flatten gal took : 170 ms
[2022-05-19 13:53:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 171 ms.
[2022-05-19 13:53:31] [INFO ] Time to serialize gal into /tmp/LTL11147621928339462290.gal : 41 ms
[2022-05-19 13:53:31] [INFO ] Time to serialize properties into /tmp/LTL11722845222654380917.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/LTL11147621928339462290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11722845222654380917.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/LTL1114762...247
Read 1 LTL properties
Checking formula 0 : !((F((X("(i36.i1.i1.u685.p1629==0)"))&&(X(G("(((((i11.i0.i3.u211.p505==1)&&(i11.i1.i2.u213.p509==1))&&(i11.i1.i1.u216.p515==1))||(i36....231
Formula 0 simplified : !F(X"(i36.i1.i1.u685.p1629==0)" & XG"(((((i11.i0.i3.u211.p505==1)&&(i11.i1.i2.u213.p509==1))&&(i11.i1.i1.u216.p515==1))||(i36.i1.i1....220
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2580099916629350502
[2022-05-19 13:53:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2580099916629350502
Running compilation step : cd /tmp/ltsmin2580099916629350502;'/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 2774 ms.
Running link step : cd /tmp/ltsmin2580099916629350502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2580099916629350502;'/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' '<>((X((LTLAPp0==true))&&X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-LTLFireability-02 finished in 121733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(X(X(p0))))&&F(G(F(p1))))))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 58 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:02] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:54:03] [INFO ] Implicit Places using invariants in 1142 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:03] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 13:54:05] [INFO ] Implicit Places using invariants and state equation in 2471 ms returned []
Implicit Place search using SMT with State Equation took 3617 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:05] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 13:54:06] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s558 0) (EQ s560 0)), p0:(OR (EQ s198 0) (EQ s209 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1158 ms.
Product exploration explored 100000 steps with 0 reset in 1500 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 142416 steps, run timeout after 3002 ms. (steps per millisecond=47 ) properties seen :{0=1}
Probabilistic random walk after 142416 steps, saw 140942 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:13] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 13:54:13] [INFO ] [Real]Absence check using 901 positive place invariants in 145 ms returned sat
[2022-05-19 13:54:14] [INFO ] After 1236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:54:15] [INFO ] [Nat]Absence check using 901 positive place invariants in 151 ms returned sat
[2022-05-19 13:54:17] [INFO ] After 2305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:54:17] [INFO ] After 2436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-19 13:54:17] [INFO ] After 2986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 142 ms.
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 204 place count 1901 transition count 1400
Applied a total of 204 rules in 177 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Finished probabilistic random walk after 86660 steps, run visited all 1 properties in 1460 ms. (steps per millisecond=59 )
Probabilistic random walk after 86660 steps, saw 85241 distinct states, run finished after 1462 ms. (steps per millisecond=59 ) properties seen :1
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 46 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:20] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 13:54:21] [INFO ] Implicit Places using invariants in 1209 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:21] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:54:23] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned []
Implicit Place search using SMT with State Equation took 3702 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:23] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 13:54:25] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 143264 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{0=1}
Probabilistic random walk after 143264 steps, saw 141784 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:28] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:54:29] [INFO ] [Real]Absence check using 901 positive place invariants in 147 ms returned sat
[2022-05-19 13:54:29] [INFO ] After 1163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:54:30] [INFO ] [Nat]Absence check using 901 positive place invariants in 150 ms returned sat
[2022-05-19 13:54:32] [INFO ] After 2261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:54:32] [INFO ] After 2395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-19 13:54:32] [INFO ] After 2934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 127 ms.
Support contains 2 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 204 place count 1901 transition count 1400
Applied a total of 204 rules in 145 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 86660 steps, run visited all 1 properties in 1470 ms. (steps per millisecond=58 )
Probabilistic random walk after 86660 steps, saw 85241 distinct states, run finished after 1472 ms. (steps per millisecond=58 ) properties seen :1
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 7 states, 10 edges and 2 AP to 7 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1179 ms.
Product exploration explored 100000 steps with 0 reset in 1526 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 6 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 120 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2022-05-19 13:54:38] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:38] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:54:39] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Product exploration explored 100000 steps with 0 reset in 1168 ms.
Product exploration explored 100000 steps with 0 reset in 1536 ms.
Built C files in :
/tmp/ltsmin7726545712103082155
[2022-05-19 13:54:42] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7726545712103082155
Running compilation step : cd /tmp/ltsmin7726545712103082155;'/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 2784 ms.
Running link step : cd /tmp/ltsmin7726545712103082155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7726545712103082155;'/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/stateBased5420818282634381276.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 39 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:57] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:54:58] [INFO ] Implicit Places using invariants in 1180 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:54:58] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:55:01] [INFO ] Implicit Places using invariants and state equation in 2522 ms returned []
Implicit Place search using SMT with State Equation took 3711 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:55:01] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 13:55:02] [INFO ] Dead Transitions using invariants and state equation in 1037 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin11867029325287433696
[2022-05-19 13:55:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11867029325287433696
Running compilation step : cd /tmp/ltsmin11867029325287433696;'/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 2748 ms.
Running link step : cd /tmp/ltsmin11867029325287433696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11867029325287433696;'/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/stateBased6313618721313844395.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 13:55:17] [INFO ] Flatten gal took : 105 ms
[2022-05-19 13:55:17] [INFO ] Flatten gal took : 105 ms
[2022-05-19 13:55:17] [INFO ] Time to serialize gal into /tmp/LTL1191515269547159572.gal : 10 ms
[2022-05-19 13:55:17] [INFO ] Time to serialize properties into /tmp/LTL10626012671840292657.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/LTL1191515269547159572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10626012671840292657.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/LTL1191515...267
Read 1 LTL properties
Checking formula 0 : !((F((X(F(X(X("((p198==0)||(p209==0))")))))&&(F(G(F("((p558==0)||(p560==0))")))))))
Formula 0 simplified : !F(XFXX"((p198==0)||(p209==0))" & FGF"((p558==0)||(p560==0))")
Detected timeout of ITS tools.
[2022-05-19 13:55:33] [INFO ] Flatten gal took : 137 ms
[2022-05-19 13:55:33] [INFO ] Applying decomposition
[2022-05-19 13:55:33] [INFO ] Flatten gal took : 104 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/graph9759358657994864087.txt' '-o' '/tmp/graph9759358657994864087.bin' '-w' '/tmp/graph9759358657994864087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9759358657994864087.bin' '-l' '-1' '-v' '-w' '/tmp/graph9759358657994864087.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:55:33] [INFO ] Decomposing Gal with order
[2022-05-19 13:55:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:55:33] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-19 13:55:33] [INFO ] Flatten gal took : 99 ms
[2022-05-19 13:55:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 145 ms.
[2022-05-19 13:55:33] [INFO ] Time to serialize gal into /tmp/LTL3709775560967637499.gal : 23 ms
[2022-05-19 13:55:33] [INFO ] Time to serialize properties into /tmp/LTL7293390298340004798.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/LTL3709775560967637499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7293390298340004798.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/LTL3709775...245
Read 1 LTL properties
Checking formula 0 : !((F((X(F(X(X("((i3.u82.p198==0)||(i3.u87.p209==0))")))))&&(F(G(F("((i12.i0.i3.u234.p558==0)||(i12.i0.i3.u234.p560==0))")))))))
Formula 0 simplified : !F(XFXX"((i3.u82.p198==0)||(i3.u87.p209==0))" & FGF"((i12.i0.i3.u234.p558==0)||(i12.i0.i3.u234.p560==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
4 strongly connected components in search stack
7 transitions explored
4 items max in DFS search stack
215 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.40378,64988,1,0,90584,651,6179,176493,126,3798,160114
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLFireability-03 finished in 94309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0) U (p0 U G(p1))))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 43 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:55:36] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:55:37] [INFO ] Implicit Places using invariants in 1251 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:55:37] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 13:55:40] [INFO ] Implicit Places using invariants and state equation in 2491 ms returned []
Implicit Place search using SMT with State Equation took 3749 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:55:40] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 13:55:41] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s353 1) (EQ s357 1) (EQ s363 1)), p0:(AND (EQ s708 1) (EQ s719 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1144 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-05 finished in 6250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G((F(p1)||p0))&&p2)))))'
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 106 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:55:42] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:55:43] [INFO ] Implicit Places using invariants in 1143 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 58 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2022-05-19 13:55:43] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 13:55:45] [INFO ] Implicit Places using invariants in 1292 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1294 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 94 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:55:45] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 13:55:46] [INFO ] Implicit Places using invariants in 1207 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:55:46] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 13:55:49] [INFO ] Implicit Places using invariants and state equation in 2575 ms returned []
Implicit Place search using SMT with State Equation took 3784 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s16 1) (EQ s711 0) (EQ s722 0)), p0:(OR (AND (EQ s108 1) (EQ s114 1) (EQ s116 1)) (AND (EQ s711 1) (EQ s722 1))), p1:(EQ s1859 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1362 reset in 1454 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-06 finished in 8162 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((F(!(!G(p0) U p1))&&G(p2))))))'
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 46 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:55:50] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:55:52] [INFO ] Implicit Places using invariants in 1266 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:55:52] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 13:55:54] [INFO ] Implicit Places using invariants and state equation in 2597 ms returned []
Implicit Place search using SMT with State Equation took 3865 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:55:54] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 13:55:55] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p2 p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s22 0) (EQ s39 0)), p0:(AND (EQ s635 1) (EQ s646 1)), p1:(AND (EQ s202 1) (EQ s227 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1185 ms.
Product exploration explored 100000 steps with 0 reset in 1549 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (OR (AND p2 (NOT p0)) (AND p2 p1))), (X (X p2)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 79613 steps, run timeout after 3020 ms. (steps per millisecond=26 ) properties seen :{1=1, 2=1, 4=1}
Probabilistic random walk after 79613 steps, saw 78594 distinct states, run finished after 3020 ms. (steps per millisecond=26 ) properties seen :3
Running SMT prover for 4 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:56:03] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:56:03] [INFO ] [Real]Absence check using 901 positive place invariants in 146 ms returned sat
[2022-05-19 13:56:04] [INFO ] After 1681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 13:56:05] [INFO ] [Nat]Absence check using 901 positive place invariants in 144 ms returned sat
[2022-05-19 13:56:07] [INFO ] After 2295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 13:56:08] [INFO ] After 3330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 353 ms.
[2022-05-19 13:56:09] [INFO ] After 4304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1270 ms.
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 204 place count 1901 transition count 1400
Applied a total of 204 rules in 148 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 93135 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 93135 steps, saw 91680 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:56:14] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:56:14] [INFO ] [Real]Absence check using 901 positive place invariants in 152 ms returned sat
[2022-05-19 13:56:15] [INFO ] After 1400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:56:16] [INFO ] [Nat]Absence check using 901 positive place invariants in 151 ms returned sat
[2022-05-19 13:56:17] [INFO ] After 1283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:56:17] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-05-19 13:56:18] [INFO ] After 970ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:56:18] [INFO ] After 1228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 293 ms.
[2022-05-19 13:56:19] [INFO ] After 3306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 550 ms.
Support contains 6 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 46 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 131128 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{0=1}
Probabilistic random walk after 131128 steps, saw 129355 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:56:23] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 13:56:23] [INFO ] [Real]Absence check using 901 positive place invariants in 150 ms returned sat
[2022-05-19 13:56:24] [INFO ] After 1162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:56:24] [INFO ] [Nat]Absence check using 901 positive place invariants in 149 ms returned sat
[2022-05-19 13:56:25] [INFO ] After 1096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:56:25] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-05-19 13:56:26] [INFO ] After 692ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:56:26] [INFO ] After 838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-05-19 13:56:26] [INFO ] After 2489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 151 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 45 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 168936 steps, run timeout after 3003 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168936 steps, saw 166900 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:56:30] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 13:56:30] [INFO ] [Real]Absence check using 901 positive place invariants in 160 ms returned sat
[2022-05-19 13:56:31] [INFO ] After 1275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:56:31] [INFO ] [Nat]Absence check using 901 positive place invariants in 152 ms returned sat
[2022-05-19 13:56:33] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:56:33] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-05-19 13:56:33] [INFO ] After 691ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:56:33] [INFO ] After 822ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2022-05-19 13:56:33] [INFO ] After 2514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 183 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 61 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 46 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:56:34] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 13:56:35] [INFO ] Implicit Places using invariants in 1309 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1315 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 58 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2022-05-19 13:56:35] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 13:56:36] [INFO ] Implicit Places using invariants in 1289 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1298 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 103 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:56:37] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 13:56:37] [INFO ] Implicit Places using invariants in 928 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:56:37] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 13:56:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-19 13:56:42] [INFO ] Implicit Places using invariants and state equation in 4824 ms returned []
Implicit Place search using SMT with State Equation took 5759 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions, in 3 iterations. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 170864 steps, run timeout after 3002 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170864 steps, saw 168833 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:56:46] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 13:56:46] [INFO ] [Real]Absence check using 898 positive place invariants in 141 ms returned sat
[2022-05-19 13:56:47] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:56:47] [INFO ] [Nat]Absence check using 898 positive place invariants in 146 ms returned sat
[2022-05-19 13:56:49] [INFO ] After 1557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:56:49] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-19 13:56:57] [INFO ] After 8590ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:56:59] [INFO ] After 10741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2022-05-19 13:56:59] [INFO ] After 12823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 111 ms.
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 58 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 47 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:57:00] [INFO ] Computed 898 place invariants in 11 ms
[2022-05-19 13:57:01] [INFO ] Implicit Places using invariants in 1025 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:57:01] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 13:57:02] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-19 13:57:06] [INFO ] Implicit Places using invariants and state equation in 5152 ms returned []
Implicit Place search using SMT with State Equation took 6180 ms to find 0 implicit places.
[2022-05-19 13:57:06] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:57:06] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 13:57:07] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 1896 transition count 1398
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 1896 transition count 1298
Applied a total of 200 rules in 174 ms. Remains 1896 /1896 variables (removed 0) and now considering 1298/1398 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1298 rows 1896 cols
[2022-05-19 13:57:07] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 13:57:07] [INFO ] [Real]Absence check using 898 positive place invariants in 146 ms returned sat
[2022-05-19 13:57:08] [INFO ] After 1098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:57:08] [INFO ] [Nat]Absence check using 898 positive place invariants in 143 ms returned sat
[2022-05-19 13:57:10] [INFO ] After 1463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:57:10] [INFO ] After 1794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 13:57:10] [INFO ] After 2241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:57:10] [INFO ] Flatten gal took : 108 ms
[2022-05-19 13:57:10] [INFO ] Flatten gal took : 95 ms
[2022-05-19 13:57:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14250169736006172252.gal : 6 ms
[2022-05-19 13:57:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6233329559524226540.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8637851891769199671;'/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/ReachabilityCardinality14250169736006172252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6233329559524226540.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/ReachabilityCardinality6233329559524226540.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 200
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :200 after 560
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :560 after 95925
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :95925 after 5.01555e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.01555e+07 after 1.27255e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.27255e+10 after 5.32973e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.32973e+13 after 5.78456e+16
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.78456e+16 after 1.26881e+25
Detected timeout of ITS tools.
[2022-05-19 13:57:26] [INFO ] Flatten gal took : 108 ms
[2022-05-19 13:57:26] [INFO ] Applying decomposition
[2022-05-19 13:57:26] [INFO ] Flatten gal took : 99 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/graph13526903799426763552.txt' '-o' '/tmp/graph13526903799426763552.bin' '-w' '/tmp/graph13526903799426763552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13526903799426763552.bin' '-l' '-1' '-v' '-w' '/tmp/graph13526903799426763552.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:57:26] [INFO ] Decomposing Gal with order
[2022-05-19 13:57:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:57:26] [INFO ] Removed a total of 394 redundant transitions.
[2022-05-19 13:57:26] [INFO ] Flatten gal took : 86 ms
[2022-05-19 13:57:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 100 ms.
[2022-05-19 13:57:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13410874234900847556.gal : 28 ms
[2022-05-19 13:57:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12116545596114324070.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8637851891769199671;'/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/ReachabilityCardinality13410874234900847556.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12116545596114324070.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/ReachabilityCardinality12116545596114324070.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 8.64717e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.64717e+07 after 7.96812e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9263268464350275680
[2022-05-19 13:57:41] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9263268464350275680
Running compilation step : cd /tmp/ltsmin9263268464350275680;'/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 2635 ms.
Running link step : cd /tmp/ltsmin9263268464350275680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9263268464350275680;'/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' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (OR (AND p2 (NOT p0)) (AND p2 p1))), (X (X p2)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND p2 p1))))]
Knowledge based reduction with 9 factoid took 485 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 61 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:57:57] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 13:57:58] [INFO ] Implicit Places using invariants in 1198 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:57:58] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 13:58:01] [INFO ] Implicit Places using invariants and state equation in 2484 ms returned []
Implicit Place search using SMT with State Equation took 3683 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:58:01] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 13:58:02] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (OR (AND p2 (NOT p0)) (AND p2 p1))), (X (X p2)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 428 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 61028 steps, run timeout after 3006 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61028 steps, saw 60118 distinct states, run finished after 3006 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 13:58:07] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 13:58:08] [INFO ] [Real]Absence check using 901 positive place invariants in 146 ms returned sat
[2022-05-19 13:58:09] [INFO ] After 2061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 13:58:10] [INFO ] [Nat]Absence check using 901 positive place invariants in 148 ms returned sat
[2022-05-19 13:58:15] [INFO ] After 4698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 13:58:17] [INFO ] After 6851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2934 ms.
[2022-05-19 13:58:20] [INFO ] After 10609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 2287 ms.
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 204 place count 1901 transition count 1400
Applied a total of 204 rules in 159 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 90667 steps, run timeout after 3004 ms. (steps per millisecond=30 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 90667 steps, saw 89225 distinct states, run finished after 3004 ms. (steps per millisecond=30 ) properties seen :5
Running SMT prover for 2 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:58:26] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 13:58:27] [INFO ] [Real]Absence check using 901 positive place invariants in 161 ms returned sat
[2022-05-19 13:58:28] [INFO ] After 1515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 13:58:28] [INFO ] [Nat]Absence check using 901 positive place invariants in 160 ms returned sat
[2022-05-19 13:58:30] [INFO ] After 1480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 13:58:30] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-05-19 13:58:31] [INFO ] After 1104ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 13:58:31] [INFO ] After 1380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 303 ms.
[2022-05-19 13:58:32] [INFO ] After 3719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 577 ms.
Support contains 6 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 50 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 141493 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{0=1}
Probabilistic random walk after 141493 steps, saw 139637 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:58:36] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:58:36] [INFO ] [Real]Absence check using 901 positive place invariants in 168 ms returned sat
[2022-05-19 13:58:37] [INFO ] After 1311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:58:37] [INFO ] [Nat]Absence check using 901 positive place invariants in 145 ms returned sat
[2022-05-19 13:58:38] [INFO ] After 1088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:58:38] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-05-19 13:58:39] [INFO ] After 704ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:58:39] [INFO ] After 833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-19 13:58:39] [INFO ] After 2472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 152 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 65 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 172478 steps, run timeout after 3002 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172478 steps, saw 170422 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:58:43] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 13:58:43] [INFO ] [Real]Absence check using 901 positive place invariants in 150 ms returned sat
[2022-05-19 13:58:44] [INFO ] After 1180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:58:44] [INFO ] [Nat]Absence check using 901 positive place invariants in 148 ms returned sat
[2022-05-19 13:58:46] [INFO ] After 1086ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:58:46] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-05-19 13:58:46] [INFO ] After 684ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:58:46] [INFO ] After 812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-19 13:58:46] [INFO ] After 2440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 145 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 50 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 53 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 13:58:47] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 13:58:48] [INFO ] Implicit Places using invariants in 1404 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1406 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 60 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2022-05-19 13:58:48] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 13:58:49] [INFO ] Implicit Places using invariants in 1286 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1288 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 99 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:58:50] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 13:58:51] [INFO ] Implicit Places using invariants in 929 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:58:51] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 13:58:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-19 13:58:55] [INFO ] Implicit Places using invariants and state equation in 4732 ms returned []
Implicit Place search using SMT with State Equation took 5662 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions, in 3 iterations. Remains : 1896/1901 places, 1398/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 175183 steps, run timeout after 3009 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175183 steps, saw 173128 distinct states, run finished after 3010 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:58:58] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 13:58:59] [INFO ] [Real]Absence check using 898 positive place invariants in 144 ms returned sat
[2022-05-19 13:59:00] [INFO ] After 1098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:59:00] [INFO ] [Nat]Absence check using 898 positive place invariants in 140 ms returned sat
[2022-05-19 13:59:01] [INFO ] After 1526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:59:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-19 13:59:10] [INFO ] After 8599ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:59:12] [INFO ] After 10760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 157 ms.
[2022-05-19 13:59:12] [INFO ] After 12800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 121 ms.
Support contains 4 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 49 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 48 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:59:13] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 13:59:14] [INFO ] Implicit Places using invariants in 936 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:59:14] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 13:59:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-19 13:59:18] [INFO ] Implicit Places using invariants and state equation in 4809 ms returned []
Implicit Place search using SMT with State Equation took 5748 ms to find 0 implicit places.
[2022-05-19 13:59:18] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 13:59:18] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 13:59:19] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 1896 transition count 1398
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 1896 transition count 1298
Applied a total of 200 rules in 154 ms. Remains 1896 /1896 variables (removed 0) and now considering 1298/1398 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1298 rows 1896 cols
[2022-05-19 13:59:19] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 13:59:20] [INFO ] [Real]Absence check using 898 positive place invariants in 156 ms returned sat
[2022-05-19 13:59:21] [INFO ] After 1175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 13:59:21] [INFO ] [Nat]Absence check using 898 positive place invariants in 147 ms returned sat
[2022-05-19 13:59:22] [INFO ] After 1457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 13:59:23] [INFO ] After 1787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-19 13:59:23] [INFO ] After 2248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 13:59:23] [INFO ] Flatten gal took : 95 ms
[2022-05-19 13:59:23] [INFO ] Flatten gal took : 98 ms
[2022-05-19 13:59:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9790835357652423916.gal : 5 ms
[2022-05-19 13:59:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5140999575722567252.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6794261860564323698;'/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/ReachabilityCardinality9790835357652423916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5140999575722567252.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/ReachabilityCardinality5140999575722567252.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 200
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :200 after 560
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :560 after 95925
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :95925 after 5.01555e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.01555e+07 after 1.27255e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.27255e+10 after 5.32973e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.32973e+13 after 5.78456e+16
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.78456e+16 after 1.26881e+25
Detected timeout of ITS tools.
[2022-05-19 13:59:38] [INFO ] Flatten gal took : 98 ms
[2022-05-19 13:59:38] [INFO ] Applying decomposition
[2022-05-19 13:59:38] [INFO ] Flatten gal took : 108 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/graph6418579910333636473.txt' '-o' '/tmp/graph6418579910333636473.bin' '-w' '/tmp/graph6418579910333636473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6418579910333636473.bin' '-l' '-1' '-v' '-w' '/tmp/graph6418579910333636473.weights' '-q' '0' '-e' '0.001'
[2022-05-19 13:59:38] [INFO ] Decomposing Gal with order
[2022-05-19 13:59:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:59:39] [INFO ] Removed a total of 394 redundant transitions.
[2022-05-19 13:59:39] [INFO ] Flatten gal took : 84 ms
[2022-05-19 13:59:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 81 ms.
[2022-05-19 13:59:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16476672859941286121.gal : 12 ms
[2022-05-19 13:59:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1164384850676986618.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms6794261860564323698;'/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/ReachabilityCardinality16476672859941286121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1164384850676986618.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/ReachabilityCardinality1164384850676986618.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :4.41713e+07 after 4.41713e+07
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4.41713e+07 after 4.41713e+07
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4.41713e+07 after 4.41713e+07
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4.41713e+07 after 1.41399e+109
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin897572088383079774
[2022-05-19 13:59:54] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin897572088383079774
Running compilation step : cd /tmp/ltsmin897572088383079774;'/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 2787 ms.
Running link step : cd /tmp/ltsmin897572088383079774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin897572088383079774;'/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' 'apf6==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (OR (AND p2 (NOT p0)) (AND p2 p1))), (X (X p2)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p2 (NOT p0)) (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND p2 p1))))]
Knowledge based reduction with 9 factoid took 531 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 1325 ms.
Product exploration explored 100000 steps with 0 reset in 1729 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (AND (NOT p0) p1)]
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 116 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2022-05-19 14:00:13] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:00:13] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 14:00:14] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Product exploration explored 100000 steps with 0 reset in 1210 ms.
Product exploration explored 100000 steps with 0 reset in 1581 ms.
Built C files in :
/tmp/ltsmin4784696866439255510
[2022-05-19 14:00:17] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4784696866439255510
Running compilation step : cd /tmp/ltsmin4784696866439255510;'/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 2872 ms.
Running link step : cd /tmp/ltsmin4784696866439255510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4784696866439255510;'/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/stateBased4625249961326706910.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 55 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:00:32] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 14:00:34] [INFO ] Implicit Places using invariants in 1262 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:00:34] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 14:00:36] [INFO ] Implicit Places using invariants and state equation in 2547 ms returned []
Implicit Place search using SMT with State Equation took 3811 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:00:36] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 14:00:37] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin14736089830999523981
[2022-05-19 14:00:37] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14736089830999523981
Running compilation step : cd /tmp/ltsmin14736089830999523981;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14736089830999523981;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14736089830999523981;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 14:00:41] [INFO ] Flatten gal took : 124 ms
[2022-05-19 14:00:41] [INFO ] Flatten gal took : 116 ms
[2022-05-19 14:00:41] [INFO ] Time to serialize gal into /tmp/LTL4941588311932881079.gal : 6 ms
[2022-05-19 14:00:41] [INFO ] Time to serialize properties into /tmp/LTL1937635917254685537.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/LTL4941588311932881079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1937635917254685537.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/LTL4941588...266
Read 1 LTL properties
Checking formula 0 : !((G(X(G((F(!((!(G("((p635==1)&&(p646==1))")))U("((p202==1)&&(p227==1))"))))&&(G("((p22==0)||(p39==0))")))))))
Formula 0 simplified : !GXG(F!(!G"((p635==1)&&(p646==1))" U "((p202==1)&&(p227==1))") & G"((p22==0)||(p39==0))")
Detected timeout of ITS tools.
[2022-05-19 14:00:56] [INFO ] Flatten gal took : 101 ms
[2022-05-19 14:00:56] [INFO ] Applying decomposition
[2022-05-19 14:00:56] [INFO ] Flatten gal took : 104 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/graph7560683272114032079.txt' '-o' '/tmp/graph7560683272114032079.bin' '-w' '/tmp/graph7560683272114032079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7560683272114032079.bin' '-l' '-1' '-v' '-w' '/tmp/graph7560683272114032079.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:00:56] [INFO ] Decomposing Gal with order
[2022-05-19 14:00:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:00:56] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-19 14:00:56] [INFO ] Flatten gal took : 81 ms
[2022-05-19 14:00:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 52 ms.
[2022-05-19 14:00:56] [INFO ] Time to serialize gal into /tmp/LTL3511827383668140903.gal : 14 ms
[2022-05-19 14:00:56] [INFO ] Time to serialize properties into /tmp/LTL5091399878286812315.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/LTL3511827383668140903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5091399878286812315.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/LTL3511827...245
Read 1 LTL properties
Checking formula 0 : !((G(X(G((F(!((!(G("((i14.i1.i2.u266.p635==1)&&(i14.i1.i1.u271.p646==1))")))U("((i5.i0.i1.u84.p202==1)&&(i5.i0.i1.u95.p227==1))"))))&&...212
Formula 0 simplified : !GXG(F!(!G"((i14.i1.i2.u266.p635==1)&&(i14.i1.i1.u271.p646==1))" U "((i5.i0.i1.u84.p202==1)&&(i5.i0.i1.u95.p227==1))") & G"((i0.i1.i...193
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
293 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.20178,74336,1,0,106116,530,6125,233205,122,2234,165179
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLFireability-07 finished in 309718 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||(F(p1)&&G(p2))))'
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 51 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:00] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 14:01:01] [INFO ] Implicit Places using invariants in 1276 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:01] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 14:01:04] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3788 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:04] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 14:01:05] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), true, (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p2:(AND (EQ s1020 1) (EQ s1026 1) (EQ s1028 1)), p1:(EQ s94 1), p0:(AND (EQ s1246 1) (EQ s1250 1) (EQ s1256 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-08 finished in 5134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(p1)))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 135 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 14:01:05] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 14:01:06] [INFO ] Implicit Places using invariants in 1201 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1204 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 67 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2022-05-19 14:01:06] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:01:08] [INFO ] Implicit Places using invariants in 1181 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1182 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 103 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:01:08] [INFO ] Computed 898 place invariants in 10 ms
[2022-05-19 14:01:09] [INFO ] Implicit Places using invariants in 1194 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:01:09] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:01:11] [INFO ] Implicit Places using invariants and state equation in 2538 ms returned []
Implicit Place search using SMT with State Equation took 3735 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1319 1) (EQ s1330 1)), p0:(EQ s1424 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1287 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-11 finished in 7806 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 49 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:13] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 14:01:14] [INFO ] Implicit Places using invariants in 1284 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:14] [INFO ] Computed 901 place invariants in 8 ms
[2022-05-19 14:01:17] [INFO ] Implicit Places using invariants and state equation in 2503 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:17] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 14:01:18] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s533 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-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-12 finished in 5056 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 49 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:18] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 14:01:19] [INFO ] Implicit Places using invariants in 1165 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:19] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 14:01:22] [INFO ] Implicit Places using invariants and state equation in 2456 ms returned []
Implicit Place search using SMT with State Equation took 3622 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:22] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 14:01:23] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-13 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 s470 1) (EQ s485 1) (EQ s1354 1) (EQ s1365 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 0 reset in 1189 ms.
Stack based approach found an accepted trace after 103 steps with 0 reset with depth 104 and stack size 104 in 2 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-13 finished in 6000 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)||p0))||F(X(p2)))))'
Support contains 8 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 45 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:24] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 14:01:25] [INFO ] Implicit Places using invariants in 1200 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:25] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 14:01:28] [INFO ] Implicit Places using invariants and state equation in 2405 ms returned []
Implicit Place search using SMT with State Equation took 3609 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:28] [INFO ] Computed 901 place invariants in 2 ms
[2022-05-19 14:01:29] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (EQ s486 1) (EQ s490 1) (EQ s496 1)), p1:(AND (EQ s1647 1) (EQ s1653 1) (EQ s1655 1)), p0:(OR (AND (EQ s1647 1) (EQ s1653 1) (EQ s1655 1)) (EQ s72...], 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 33333 reset in 4895 ms.
Product exploration explored 100000 steps with 33333 reset in 5178 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))
Knowledge based reduction with 3 factoid took 621 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-100A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-14 finished in 15582 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U p1)&&G(p0)&&p2)||p3)))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 52 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:40] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 14:01:41] [INFO ] Implicit Places using invariants in 1216 ms returned []
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:41] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 14:01:43] [INFO ] Implicit Places using invariants and state equation in 2485 ms returned []
Implicit Place search using SMT with State Equation took 3702 ms to find 0 implicit places.
// Phase 1: matrix 1402 rows 1903 cols
[2022-05-19 14:01:43] [INFO ] Computed 901 place invariants in 3 ms
[2022-05-19 14:01:44] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0))), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s1489 1) (EQ s1491 1)), p1:(AND (EQ s801 1) (EQ s818 1)), p3:(AND (EQ s871 0) (OR (EQ s1489 0) (EQ s1491 0))), p2:(EQ s871 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 50000 reset in 6811 ms.
Product exploration explored 100000 steps with 50000 reset in 6956 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p3) p2 p1 p0))), (X (NOT (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p3) p2 (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) p2 (NOT p1) p0)))
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 5 states, 10 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-100A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-15 finished in 19078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&X(G(p1)))))'
Found a CL insensitive property : ShieldIIPt-PT-100A-LTLFireability-02
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 119 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2022-05-19 14:01:59] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 14:02:00] [INFO ] Implicit Places using invariants in 1192 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1196 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 69 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2022-05-19 14:02:00] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 14:02:01] [INFO ] Implicit Places using invariants in 1168 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1169 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 101 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:02] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:02:03] [INFO ] Implicit Places using invariants in 1170 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:03] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:02:05] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3668 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions, in 3 iterations. Remains : 1896/1903 places, 1398/1402 transitions.
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1629 0), p1:(OR (AND (EQ s505 1) (EQ s509 1) (EQ s515 1)) (EQ s1629 1) (EQ s12 0) (EQ s37 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1183 ms.
Product exploration explored 100000 steps with 0 reset in 1573 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 215 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 168755 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 168755 steps, saw 167076 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:12] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:02:12] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:02:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 154 ms returned sat
[2022-05-19 14:02:15] [INFO ] After 2037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:02:15] [INFO ] After 2186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2022-05-19 14:02:15] [INFO ] After 2758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 114 ms.
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1896 transition count 1398
Applied a total of 199 rules in 123 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Finished probabilistic random walk after 99609 steps, run visited all 1 properties in 1686 ms. (steps per millisecond=59 )
Probabilistic random walk after 99609 steps, saw 98148 distinct states, run finished after 1688 ms. (steps per millisecond=59 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 784 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 49 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:18] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:02:20] [INFO ] Implicit Places using invariants in 1269 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:20] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:02:22] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 3835 ms to find 0 implicit places.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:22] [INFO ] Computed 898 place invariants in 8 ms
[2022-05-19 14:02:23] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 177798 steps, run timeout after 3003 ms. (steps per millisecond=59 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 177798 steps, saw 176071 distinct states, run finished after 3003 ms. (steps per millisecond=59 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:27] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:02:27] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:02:28] [INFO ] [Nat]Absence check using 898 positive place invariants in 149 ms returned sat
[2022-05-19 14:02:30] [INFO ] After 1968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:02:30] [INFO ] After 2099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-19 14:02:30] [INFO ] After 2638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 126 ms.
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1896 transition count 1398
Applied a total of 199 rules in 101 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Finished probabilistic random walk after 99609 steps, run visited all 1 properties in 1697 ms. (steps per millisecond=58 )
Probabilistic random walk after 99609 steps, saw 98148 distinct states, run finished after 1698 ms. (steps per millisecond=58 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 482 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1221 ms.
Product exploration explored 100000 steps with 0 reset in 1539 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 514 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 58 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2022-05-19 14:02:37] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:37] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:02:37] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Product exploration explored 100000 steps with 0 reset in 1186 ms.
Product exploration explored 100000 steps with 0 reset in 1581 ms.
Built C files in :
/tmp/ltsmin17526052345294374468
[2022-05-19 14:02:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17526052345294374468
Running compilation step : cd /tmp/ltsmin17526052345294374468;'/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 2822 ms.
Running link step : cd /tmp/ltsmin17526052345294374468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17526052345294374468;'/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/stateBased5370662044516697618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 50 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:55] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:02:57] [INFO ] Implicit Places using invariants in 1192 ms returned []
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:57] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:02:59] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned []
Implicit Place search using SMT with State Equation took 3700 ms to find 0 implicit places.
// Phase 1: matrix 1398 rows 1896 cols
[2022-05-19 14:02:59] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:03:00] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1896/1896 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin2329263469571675508
[2022-05-19 14:03:00] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2329263469571675508
Running compilation step : cd /tmp/ltsmin2329263469571675508;'/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 2746 ms.
Running link step : cd /tmp/ltsmin2329263469571675508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2329263469571675508;'/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/stateBased7528352767165187634.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 14:03:15] [INFO ] Flatten gal took : 95 ms
[2022-05-19 14:03:15] [INFO ] Flatten gal took : 97 ms
[2022-05-19 14:03:15] [INFO ] Time to serialize gal into /tmp/LTL9993844573770278949.gal : 5 ms
[2022-05-19 14:03:15] [INFO ] Time to serialize properties into /tmp/LTL9889287416614469003.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/LTL9993844573770278949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9889287416614469003.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/LTL9993844...266
Read 1 LTL properties
Checking formula 0 : !((F((X("(p1629==0)"))&&(X(G("(((((p505==1)&&(p509==1))&&(p515==1))||(p1629==1))||((p12==0)||(p37==0)))"))))))
Formula 0 simplified : !F(X"(p1629==0)" & XG"(((((p505==1)&&(p509==1))&&(p515==1))||(p1629==1))||((p12==0)||(p37==0)))")
Detected timeout of ITS tools.
[2022-05-19 14:03:31] [INFO ] Flatten gal took : 108 ms
[2022-05-19 14:03:31] [INFO ] Applying decomposition
[2022-05-19 14:03:31] [INFO ] Flatten gal took : 101 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/graph18058863145948974791.txt' '-o' '/tmp/graph18058863145948974791.bin' '-w' '/tmp/graph18058863145948974791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18058863145948974791.bin' '-l' '-1' '-v' '-w' '/tmp/graph18058863145948974791.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:03:31] [INFO ] Decomposing Gal with order
[2022-05-19 14:03:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:03:31] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-19 14:03:31] [INFO ] Flatten gal took : 83 ms
[2022-05-19 14:03:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 56 ms.
[2022-05-19 14:03:31] [INFO ] Time to serialize gal into /tmp/LTL12192333002440633333.gal : 17 ms
[2022-05-19 14:03:31] [INFO ] Time to serialize properties into /tmp/LTL8736491537425581809.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/LTL12192333002440633333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8736491537425581809.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/LTL1219233...246
Read 1 LTL properties
Checking formula 0 : !((F((X("(i37.i1.i3.u685.p1629==0)"))&&(X(G("(((((i10.i0.i3.u211.p505==1)&&(i10.i1.i2.u213.p509==1))&&(i10.i1.i0.u216.p515==1))||(i37....231
Formula 0 simplified : !F(X"(i37.i1.i3.u685.p1629==0)" & XG"(((((i10.i0.i3.u211.p505==1)&&(i10.i1.i2.u213.p509==1))&&(i10.i1.i0.u216.p515==1))||(i37.i1.i3....220
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6166986931698046134
[2022-05-19 14:03:46] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6166986931698046134
Running compilation step : cd /tmp/ltsmin6166986931698046134;'/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 2873 ms.
Running link step : cd /tmp/ltsmin6166986931698046134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6166986931698046134;'/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' '<>((X((LTLAPp0==true))&&X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-100A-LTLFireability-02 finished in 122717 ms.
[2022-05-19 14:04:01] [INFO ] Flatten gal took : 112 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5840866904508990181
[2022-05-19 14:04:01] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2022-05-19 14:04:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:04:01] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2022-05-19 14:04:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 14:04:01] [INFO ] Applying decomposition
[2022-05-19 14:04:02] [INFO ] Flatten gal took : 100 ms
[2022-05-19 14:04:02] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2022-05-19 14:04:02] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph13904762528070772530.txt' '-o' '/tmp/graph13904762528070772530.bin' '-w' '/tmp/graph13904762528070772530.weights'
[2022-05-19 14:04:02] [INFO ] Built C files in 250ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5840866904508990181
Running compilation step : cd /tmp/ltsmin5840866904508990181;'/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'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13904762528070772530.bin' '-l' '-1' '-v' '-w' '/tmp/graph13904762528070772530.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:04:02] [INFO ] Decomposing Gal with order
[2022-05-19 14:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:04:02] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-19 14:04:02] [INFO ] Flatten gal took : 111 ms
[2022-05-19 14:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 57 ms.
[2022-05-19 14:04:02] [INFO ] Time to serialize gal into /tmp/LTLFireability14744260338764388856.gal : 13 ms
[2022-05-19 14:04:03] [INFO ] Time to serialize properties into /tmp/LTLFireability17416565743192341078.ltl : 527 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/LTLFireability14744260338764388856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17416565743192341078.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 : !((F((X("(i36.i0.i2.u685.p1629==0)"))&&(X(G("(((((i12.i0.i3.u211.p505==1)&&(i12.i1.i1.u213.p509==1))&&(i12.i1.i2.u216.p515==1))||(i36....231
Formula 0 simplified : !F(X"(i36.i0.i2.u685.p1629==0)" & XG"(((((i12.i0.i3.u211.p505==1)&&(i12.i1.i1.u213.p509==1))&&(i12.i1.i2.u216.p515==1))||(i36.i0.i2....220
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 4995 ms.
Running link step : cd /tmp/ltsmin5840866904508990181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin5840866904508990181;'/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' '<>((X((LTLAPp0==true))&&X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.097: LTL layer: formula: <>((X((LTLAPp0==true))&&X([]((LTLAPp1==true)))))
pins2lts-mc-linux64( 6/ 8), 0.097: "<>((X((LTLAPp0==true))&&X([]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.098: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.125: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.126: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.126: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.138: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.308: There are 1405 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.309: State length is 1904, there are 1408 groups
pins2lts-mc-linux64( 0/ 8), 0.309: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.309: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.309: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.309: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.425: [Blue] ~120 levels ~960 states ~4608 transitions
pins2lts-mc-linux64( 1/ 8), 0.542: [Blue] ~239 levels ~1920 states ~9496 transitions
pins2lts-mc-linux64( 1/ 8), 0.825: [Blue] ~479 levels ~3840 states ~21224 transitions
pins2lts-mc-linux64( 1/ 8), 1.304: [Blue] ~959 levels ~7680 states ~45728 transitions
pins2lts-mc-linux64( 1/ 8), 2.146: [Blue] ~1919 levels ~15360 states ~95288 transitions
pins2lts-mc-linux64( 2/ 8), 3.711: [Blue] ~3819 levels ~30720 states ~204360 transitions
pins2lts-mc-linux64( 2/ 8), 6.732: [Blue] ~7648 levels ~61440 states ~420248 transitions
pins2lts-mc-linux64( 2/ 8), 12.662: [Blue] ~15312 levels ~122880 states ~869568 transitions
pins2lts-mc-linux64( 1/ 8), 23.904: [Blue] ~30607 levels ~245760 states ~1800920 transitions
pins2lts-mc-linux64( 5/ 8), 49.427: [Blue] ~61381 levels ~491520 states ~3847144 transitions
pins2lts-mc-linux64( 4/ 8), 99.392: [Blue] ~122483 levels ~983040 states ~7810696 transitions
pins2lts-mc-linux64( 7/ 8), 189.790: [Blue] ~245403 levels ~1966080 states ~16108824 transitions
pins2lts-mc-linux64( 7/ 8), 211.812: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 212.122:
pins2lts-mc-linux64( 0/ 8), 212.122: Explored 2173718 states 18729271 transitions, fanout: 8.616
pins2lts-mc-linux64( 0/ 8), 212.122: Total exploration time 211.800 sec (211.520 sec minimum, 211.635 sec on average)
pins2lts-mc-linux64( 0/ 8), 212.122: States per second: 10263, Transitions per second: 88429
pins2lts-mc-linux64( 0/ 8), 212.122:
pins2lts-mc-linux64( 0/ 8), 212.122: State space has 9982210 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 212.122: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 212.122: blue states: 2173718 (21.78%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 212.122: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 212.122: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 212.122:
pins2lts-mc-linux64( 0/ 8), 212.122: Total memory used for local state coloring: 33.1MB
pins2lts-mc-linux64( 0/ 8), 212.122:
pins2lts-mc-linux64( 0/ 8), 212.122: Queue width: 8B, total height: 2170815, memory: 16.56MB
pins2lts-mc-linux64( 0/ 8), 212.122: Tree memory: 332.2MB, 34.9 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 212.122: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 212.122: Stored 1429 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 212.122: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 212.122: Est. total memory use: 348.7MB (~1040.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5840866904508990181;'/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' '<>((X((LTLAPp0==true))&&X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5840866904508990181;'/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' '<>((X((LTLAPp0==true))&&X([]((LTLAPp1==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 14:28:48] [INFO ] Applying decomposition
[2022-05-19 14:28:48] [INFO ] Flatten gal took : 97 ms
[2022-05-19 14:28:48] [INFO ] Decomposing Gal with order
[2022-05-19 14:28:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:28:48] [INFO ] Removed a total of 400 redundant transitions.
[2022-05-19 14:28:48] [INFO ] Flatten gal took : 79 ms
[2022-05-19 14:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 49 ms.
[2022-05-19 14:28:48] [INFO ] Time to serialize gal into /tmp/LTLFireability10408306341598350164.gal : 13 ms
[2022-05-19 14:28:48] [INFO ] Time to serialize properties into /tmp/LTLFireability9602806917045952959.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/LTLFireability10408306341598350164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9602806917045952959.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...268
Read 1 LTL properties
Checking formula 0 : !((F((X("(u858.p1629==0)"))&&(X(G("(((((u266.p505==1)&&(u268.p509==1))&&(u271.p515==1))||(u858.p1629==1))||((u7.p12==0)||(u20.p37==0))...163
Formula 0 simplified : !F(X"(u858.p1629==0)" & XG"(((((u266.p505==1)&&(u268.p509==1))&&(u271.p515==1))||(u858.p1629==1))||((u7.p12==0)||(u20.p37==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-100A"
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-100A, 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-165286025100340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A 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 '
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 ;