About the Execution of ITS-Tools for Szymanski-PT-b10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15074.640 | 3600000.00 | 11268867.00 | 6503.00 | FFFT?FFFF?FFFFF? | 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.r312-tall-165472283101068.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 Szymanski-PT-b10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472283101068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Jun 7 17:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Jun 7 17:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 140K Jun 7 17:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.7M Jun 6 12:11 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 Szymanski-PT-b10-LTLFireability-00
FORMULA_NAME Szymanski-PT-b10-LTLFireability-01
FORMULA_NAME Szymanski-PT-b10-LTLFireability-02
FORMULA_NAME Szymanski-PT-b10-LTLFireability-03
FORMULA_NAME Szymanski-PT-b10-LTLFireability-04
FORMULA_NAME Szymanski-PT-b10-LTLFireability-05
FORMULA_NAME Szymanski-PT-b10-LTLFireability-06
FORMULA_NAME Szymanski-PT-b10-LTLFireability-07
FORMULA_NAME Szymanski-PT-b10-LTLFireability-08
FORMULA_NAME Szymanski-PT-b10-LTLFireability-09
FORMULA_NAME Szymanski-PT-b10-LTLFireability-10
FORMULA_NAME Szymanski-PT-b10-LTLFireability-11
FORMULA_NAME Szymanski-PT-b10-LTLFireability-12
FORMULA_NAME Szymanski-PT-b10-LTLFireability-13
FORMULA_NAME Szymanski-PT-b10-LTLFireability-14
FORMULA_NAME Szymanski-PT-b10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1654984904700
Running Version 202205111006
[2022-06-11 22:01: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-06-11 22:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 22:01:46] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2022-06-11 22:01:46] [INFO ] Transformed 568 places.
[2022-06-11 22:01:46] [INFO ] Transformed 8320 transitions.
[2022-06-11 22:01:46] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 501 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 260 places in 31 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 127 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:01:46] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:01:46] [INFO ] Computed 1 place invariants in 57 ms
[2022-06-11 22:01:47] [INFO ] Implicit Places using invariants in 528 ms returned []
[2022-06-11 22:01:47] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:01:47] [INFO ] Computed 1 place invariants in 29 ms
[2022-06-11 22:01:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:01:51] [INFO ] Implicit Places using invariants and state equation in 3769 ms returned []
Implicit Place search using SMT with State Equation took 4325 ms to find 0 implicit places.
[2022-06-11 22:01:51] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:01:51] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 22:01:53] [INFO ] Dead Transitions using invariants and state equation in 2055 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/308 places, 8064/8064 transitions.
Support contains 65 out of 306 places after structural reductions.
[2022-06-11 22:01:53] [INFO ] Flatten gal took : 435 ms
[2022-06-11 22:01:54] [INFO ] Flatten gal took : 281 ms
[2022-06-11 22:01:54] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 64 out of 306 places (down from 65) after GAL structural reductions.
Incomplete random walk after 10005 steps, including 3 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 39) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) 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 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) 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 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2022-06-11 22:01:55] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:01:55] [INFO ] Computed 1 place invariants in 34 ms
[2022-06-11 22:01:55] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 10 ms returned sat
[2022-06-11 22:02:04] [INFO ] After 8697ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:27
[2022-06-11 22:02:04] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:02:14] [INFO ] After 9915ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :27
[2022-06-11 22:02:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:02:22] [INFO ] After 7617ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :27
[2022-06-11 22:02:29] [INFO ] After 14724ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :26
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 22:02:29] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :26
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 700 ms.
Support contains 45 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 306 transition count 7957
Applied a total of 107 rules in 418 ms. Remains 306 /306 variables (removed 0) and now considering 7957/8064 (removed 107) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7957/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 86490 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{1=1, 11=1}
Probabilistic random walk after 86490 steps, saw 66821 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :2
Running SMT prover for 23 properties.
[2022-06-11 22:02:33] [INFO ] Flow matrix only has 2626 transitions (discarded 5331 similar events)
// Phase 1: matrix 2626 rows 306 cols
[2022-06-11 22:02:33] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:02:33] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:02:39] [INFO ] After 5869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-06-11 22:02:39] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:02:52] [INFO ] After 12348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-06-11 22:02:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:02:57] [INFO ] After 5454ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2022-06-11 22:02:59] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 3 ms to minimize.
[2022-06-11 22:02:59] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 2 ms to minimize.
[2022-06-11 22:02:59] [INFO ] Deduced a trap composed of 58 places in 306 ms of which 50 ms to minimize.
[2022-06-11 22:02:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1034 ms
[2022-06-11 22:03:02] [INFO ] After 10078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 2320 ms.
[2022-06-11 22:03:04] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 546 ms.
Support contains 40 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7957/7957 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 7955
Applied a total of 2 rules in 338 ms. Remains 306 /306 variables (removed 0) and now considering 7955/7957 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7955/7957 transitions.
Incomplete random walk after 10001 steps, including 3 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 93072 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93072 steps, saw 71905 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 21 properties.
[2022-06-11 22:03:08] [INFO ] Flow matrix only has 2624 transitions (discarded 5331 similar events)
// Phase 1: matrix 2624 rows 306 cols
[2022-06-11 22:03:08] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:03:09] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:03:14] [INFO ] After 5953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-06-11 22:03:15] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:03:22] [INFO ] After 7700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2022-06-11 22:03:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:03:32] [INFO ] After 9849ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2022-06-11 22:03:33] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 2 ms to minimize.
[2022-06-11 22:03:33] [INFO ] Deduced a trap composed of 58 places in 244 ms of which 0 ms to minimize.
[2022-06-11 22:03:34] [INFO ] Deduced a trap composed of 72 places in 251 ms of which 0 ms to minimize.
[2022-06-11 22:03:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 996 ms
[2022-06-11 22:03:36] [INFO ] After 13891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 3196 ms.
[2022-06-11 22:03:39] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 560 ms.
Support contains 37 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7955/7955 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 306 transition count 7954
Applied a total of 1 rules in 204 ms. Remains 306 /306 variables (removed 0) and now considering 7954/7955 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7954/7955 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA Szymanski-PT-b10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 2432 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 191 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:03:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:03:41] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 22:03:41] [INFO ] Implicit Places using invariants in 453 ms returned []
[2022-06-11 22:03:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:03:42] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 22:03:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:03:48] [INFO ] Implicit Places using invariants and state equation in 6171 ms returned []
Implicit Place search using SMT with State Equation took 6625 ms to find 0 implicit places.
[2022-06-11 22:03:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:03:48] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 22:03:50] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-01 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 (GEQ s32 1) (GEQ s262 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]]
Stuttering criterion allowed to conclude after 224 steps with 0 reset in 9 ms.
FORMULA Szymanski-PT-b10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-01 finished in 8969 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U p1)||X(G(F(p0)))||p2)))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 480 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:03:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:03:50] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:03:51] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-06-11 22:03:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:03:51] [INFO ] Computed 1 place invariants in 26 ms
[2022-06-11 22:03:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:03:58] [INFO ] Implicit Places using invariants and state equation in 7205 ms returned []
Implicit Place search using SMT with State Equation took 7623 ms to find 0 implicit places.
[2022-06-11 22:03:59] [INFO ] Redundant transitions in 908 ms returned []
[2022-06-11 22:03:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:03:59] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:04:01] [INFO ] Dead Transitions using invariants and state equation in 2080 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s118 1) (GEQ s272 1)), p1:(AND (GEQ s52 1) (GEQ s273 1)), p0:(AND (GEQ s59 1) (GEQ s267 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 236 steps with 0 reset in 9 ms.
FORMULA Szymanski-PT-b10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-02 finished in 11229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U !p1))||X(X((G(!p1)&&p2)))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 34 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:04:01] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:04:01] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 22:04:01] [INFO ] Implicit Places using invariants in 431 ms returned []
[2022-06-11 22:04:01] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:04:01] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:04:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:04:07] [INFO ] Implicit Places using invariants and state equation in 5097 ms returned []
Implicit Place search using SMT with State Equation took 5529 ms to find 0 implicit places.
[2022-06-11 22:04:07] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:04:07] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:04:09] [INFO ] Dead Transitions using invariants and state equation in 2106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 441 ms :[true, p1, p1, p1, (OR (NOT p2) p1), p1]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s30 1) (GEQ s286 1)), p0:(AND (GEQ s78 1) (GEQ s282 1)), p2:(OR (LT s107 1) (LT s262 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]]
Product exploration explored 100000 steps with 50000 reset in 807 ms.
Product exploration explored 100000 steps with 50000 reset in 657 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Szymanski-PT-b10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b10-LTLFireability-03 finished in 9766 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p0)&&!(F(X(p1)) U (p2 U p3))))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 239 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:04:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:04:11] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 22:04:11] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-11 22:04:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:04:11] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:04:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:04:18] [INFO ] Implicit Places using invariants and state equation in 6307 ms returned []
Implicit Place search using SMT with State Equation took 6738 ms to find 0 implicit places.
[2022-06-11 22:04:19] [INFO ] Redundant transitions in 822 ms returned []
[2022-06-11 22:04:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:04:19] [INFO ] Computed 1 place invariants in 26 ms
[2022-06-11 22:04:21] [INFO ] Dead Transitions using invariants and state equation in 2181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR p3 p0), true, (AND (NOT p1) p3), p0, (AND p1 p3), p1]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (GEQ s14 1) (GEQ s290 1)), p2:(AND (GEQ s82 1) (GEQ s293 1)), p0:(AND (GEQ s113 1) (GEQ s289 1)), p1:(AND (GEQ s127 1) (GEQ s282 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, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 65 reset in 464 ms.
Product exploration explored 100000 steps with 71 reset in 553 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND p3 p1))), true, (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 567 ms. Reduced automaton from 6 states, 14 edges and 4 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[true, (AND p1 p3), p3, p1, (AND p1 p3)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-11 22:04:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:04:23] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:04:23] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:04:23] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-11 22:04:23] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:04:26] [INFO ] After 2722ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-06-11 22:04:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:04:37] [INFO ] After 11103ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2022-06-11 22:04:40] [INFO ] After 14176ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 367 ms.
[2022-06-11 22:04:41] [INFO ] After 17372ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 248 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10009 steps, including 4 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 110603 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110603 steps, saw 86352 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:04:44] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 22:04:44] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:04:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:04:45] [INFO ] After 870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:04:45] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:04:48] [INFO ] After 2565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:04:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:04:54] [INFO ] After 6663ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:04:56] [INFO ] After 8328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1091 ms.
[2022-06-11 22:04:57] [INFO ] After 12083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 67 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2022-06-11 22:04:58] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 22:04:58] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:04:58] [INFO ] Implicit Places using invariants in 403 ms returned []
[2022-06-11 22:04:58] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 22:04:58] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-11 22:04:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:05:05] [INFO ] Implicit Places using invariants and state equation in 6751 ms returned []
Implicit Place search using SMT with State Equation took 7161 ms to find 0 implicit places.
[2022-06-11 22:05:05] [INFO ] Redundant transitions in 668 ms returned []
[2022-06-11 22:05:05] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 22:05:05] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:05:07] [INFO ] Dead Transitions using invariants and state equation in 1951 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4624 edges and 305 vertex of which 34 / 305 are part of one of the 3 SCC in 5 ms
Free SCC test removed 31 places
Drop transitions removed 3432 transitions
Ensure Unique test removed 1941 transitions
Reduce isomorphic transitions removed 5373 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 274 transition count 2437
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 273 transition count 2436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 272 transition count 2435
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 422 place count 272 transition count 2019
Applied a total of 422 rules in 252 ms. Remains 272 /305 variables (removed 33) and now considering 2019/7811 (removed 5792) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2019 rows 272 cols
[2022-06-11 22:05:08] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:05:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:05:08] [INFO ] After 479ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-06-11 22:05:08] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 22:05:08] [INFO ] After 161ms SMT Verify possible using 504 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:05:08] [INFO ] After 724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:05:08] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:05:09] [INFO ] After 666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:05:11] [INFO ] After 1638ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:05:12] [INFO ] After 2684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1194 ms.
[2022-06-11 22:05:13] [INFO ] After 4620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND p3 p1))), true, (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (G (NOT (AND p3 p1))), (G (NOT (AND (NOT p3) p2 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p2)))), (F (AND (NOT p3) p2))]
Knowledge based reduction with 17 factoid took 627 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p2) (NOT p1)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p3), (AND p1 (NOT p2) p3)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p1)), (AND p1 (NOT p2)), (AND p1 (NOT p2) p3), (AND p1 (NOT p2) p3)]
Support contains 6 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 37 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 22:05:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:05:14] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 22:05:14] [INFO ] Implicit Places using invariants in 427 ms returned []
[2022-06-11 22:05:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:05:14] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:05:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:05:21] [INFO ] Implicit Places using invariants and state equation in 6756 ms returned []
Implicit Place search using SMT with State Equation took 7186 ms to find 0 implicit places.
[2022-06-11 22:05:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:05:21] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:05:23] [INFO ] Dead Transitions using invariants and state equation in 2221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p2) p1), (AND (NOT p2) p1 p3), (AND (NOT p2) p1 p3)]
Incomplete random walk after 10003 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 136011 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136011 steps, saw 107038 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:05:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:05:27] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:05:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:05:28] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-06-11 22:05:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:05:29] [INFO ] After 1383ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-06-11 22:05:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:05:33] [INFO ] After 3699ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-06-11 22:05:33] [INFO ] After 4110ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 497 ms.
[2022-06-11 22:05:34] [INFO ] After 6076ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 138403 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138403 steps, saw 107577 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-11 22:05:37] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 22:05:37] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:05:37] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:05:39] [INFO ] After 2129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 22:05:39] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:05:41] [INFO ] After 1543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 22:05:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:05:44] [INFO ] After 2867ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 22:05:44] [INFO ] After 3363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 298 ms.
[2022-06-11 22:05:44] [INFO ] After 5294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2022-06-11 22:05:45] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 22:05:45] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:05:45] [INFO ] Implicit Places using invariants in 420 ms returned []
[2022-06-11 22:05:45] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 22:05:45] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:05:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:05:52] [INFO ] Implicit Places using invariants and state equation in 6290 ms returned []
Implicit Place search using SMT with State Equation took 6712 ms to find 0 implicit places.
[2022-06-11 22:05:52] [INFO ] Redundant transitions in 679 ms returned []
[2022-06-11 22:05:52] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2022-06-11 22:05:52] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:05:54] [INFO ] Dead Transitions using invariants and state equation in 1947 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4624 edges and 305 vertex of which 34 / 305 are part of one of the 3 SCC in 1 ms
Free SCC test removed 31 places
Drop transitions removed 3432 transitions
Ensure Unique test removed 1941 transitions
Reduce isomorphic transitions removed 5373 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 274 transition count 2437
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 273 transition count 2436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 272 transition count 2435
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 422 place count 272 transition count 2019
Applied a total of 422 rules in 163 ms. Remains 272 /305 variables (removed 33) and now considering 2019/7811 (removed 5792) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2019 rows 272 cols
[2022-06-11 22:05:54] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:05:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:05:55] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 22:05:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:05:56] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 22:05:56] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 22:05:56] [INFO ] After 811ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 22:05:57] [INFO ] After 1490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 514 ms.
[2022-06-11 22:05:58] [INFO ] After 2711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 235 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[true, p1, (AND p1 p3), (AND p3 p1)]
Stuttering acceptance computed with spot in 97 ms :[true, p1, (AND p1 p3), (AND p3 p1)]
Stuttering acceptance computed with spot in 110 ms :[true, p1, (AND p1 p3), (AND p3 p1)]
Product exploration explored 100000 steps with 52 reset in 422 ms.
Product exploration explored 100000 steps with 53 reset in 466 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 127 ms :[true, p1, (AND p1 p3), (AND p3 p1)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 226 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 22:06:00] [INFO ] Redundant transitions in 667 ms returned []
[2022-06-11 22:06:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:06:00] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:06:02] [INFO ] Dead Transitions using invariants and state equation in 2024 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Product exploration explored 100000 steps with 71 reset in 450 ms.
Product exploration explored 100000 steps with 14 reset in 443 ms.
Built C files in :
/tmp/ltsmin10080501319548854636
[2022-06-11 22:06:03] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10080501319548854636
Running compilation step : cd /tmp/ltsmin10080501319548854636;'/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/ltsmin10080501319548854636;'/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/ltsmin10080501319548854636;'/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)
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 22:06:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:06:06] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:06:07] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-06-11 22:06:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:06:07] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:06:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:06:13] [INFO ] Implicit Places using invariants and state equation in 6374 ms returned []
Implicit Place search using SMT with State Equation took 6810 ms to find 0 implicit places.
[2022-06-11 22:06:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:06:13] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:06:15] [INFO ] Dead Transitions using invariants and state equation in 2063 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin1651240441383691032
[2022-06-11 22:06:16] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1651240441383691032
Running compilation step : cd /tmp/ltsmin1651240441383691032;'/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/ltsmin1651240441383691032;'/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/ltsmin1651240441383691032;'/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-06-11 22:06:19] [INFO ] Flatten gal took : 368 ms
[2022-06-11 22:06:20] [INFO ] Flatten gal took : 258 ms
[2022-06-11 22:06:20] [INFO ] Time to serialize gal into /tmp/LTL8149185796333668867.gal : 61 ms
[2022-06-11 22:06:20] [INFO ] Time to serialize properties into /tmp/LTL15738413619093278718.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/LTL8149185796333668867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15738413619093278718.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/LTL8149185...267
Read 1 LTL properties
Checking formula 0 : !(((("((p113>=1)&&(l35>=1))")U(!("((p113>=1)&&(l35>=1))")))&&(!((F(X("((p127>=1)&&(l26>=1))")))U(("((p82>=1)&&(l39>=1))")U("((p14>=1)&...172
Formula 0 simplified : !(("((p113>=1)&&(l35>=1))" U !"((p113>=1)&&(l35>=1))") & !(FX"((p127>=1)&&(l26>=1))" U ("((p82>=1)&&(l39>=1))" U "((p14>=1)&&(l36>=1...161
Detected timeout of ITS tools.
[2022-06-11 22:06:35] [INFO ] Flatten gal took : 241 ms
[2022-06-11 22:06:35] [INFO ] Applying decomposition
[2022-06-11 22:06:35] [INFO ] Flatten gal took : 258 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/graph2185485660818430729.txt' '-o' '/tmp/graph2185485660818430729.bin' '-w' '/tmp/graph2185485660818430729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2185485660818430729.bin' '-l' '-1' '-v' '-w' '/tmp/graph2185485660818430729.weights' '-q' '0' '-e' '0.001'
[2022-06-11 22:06:36] [INFO ] Decomposing Gal with order
[2022-06-11 22:06:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 22:06:37] [INFO ] Removed a total of 17839 redundant transitions.
[2022-06-11 22:06:37] [INFO ] Flatten gal took : 862 ms
[2022-06-11 22:06:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1133 labels/synchronizations in 354 ms.
[2022-06-11 22:06:37] [INFO ] Time to serialize gal into /tmp/LTL3770962823238221620.gal : 35 ms
[2022-06-11 22:06:38] [INFO ] Time to serialize properties into /tmp/LTL6862852884222892767.ltl : 33 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/LTL3770962823238221620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6862852884222892767.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/LTL3770962...245
Read 1 LTL properties
Checking formula 0 : !(((("((i7.u39.p113>=1)&&(i6.i1.u56.l35>=1))")U(!("((i7.u39.p113>=1)&&(i6.i1.u56.l35>=1))")))&&(!((F(X("((i6.i1.u43.p127>=1)&&(i2.u53....256
Formula 0 simplified : !(("((i7.u39.p113>=1)&&(i6.i1.u56.l35>=1))" U !"((i7.u39.p113>=1)&&(i6.i1.u56.l35>=1))") & !(FX"((i6.i1.u43.p127>=1)&&(i2.u53.l26>=1...245
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14949544694379814535
[2022-06-11 22:06:53] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14949544694379814535
Running compilation step : cd /tmp/ltsmin14949544694379814535;'/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/ltsmin14949544694379814535;'/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/ltsmin14949544694379814535;'/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)
Treatment of property Szymanski-PT-b10-LTLFireability-04 finished in 164921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G((F((G(p1)&&p0))||p2))))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 244 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:06:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:06:56] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 22:06:56] [INFO ] Implicit Places using invariants in 458 ms returned []
[2022-06-11 22:06:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:06:56] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:06:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:07:05] [INFO ] Implicit Places using invariants and state equation in 8450 ms returned []
Implicit Place search using SMT with State Equation took 8913 ms to find 0 implicit places.
[2022-06-11 22:07:06] [INFO ] Redundant transitions in 666 ms returned []
[2022-06-11 22:07:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:07:06] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 22:07:08] [INFO ] Dead Transitions using invariants and state equation in 2245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s102 1) (GEQ s265 1)), p1:(AND (GEQ s4 1) (GEQ s302 1)), p2:(AND (GEQ s97 1) (GEQ s259 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 193 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-05 finished in 12275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(G(p0)))&&(X(p1)||p2))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 58 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:07:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:07:08] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:07:08] [INFO ] Implicit Places using invariants in 458 ms returned []
[2022-06-11 22:07:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:07:08] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:07:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:07:15] [INFO ] Implicit Places using invariants and state equation in 6922 ms returned []
Implicit Place search using SMT with State Equation took 7383 ms to find 0 implicit places.
[2022-06-11 22:07:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:07:15] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:07:17] [INFO ] Dead Transitions using invariants and state equation in 2064 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s119 1) (GEQ s285 1)), p0:(OR (LT s1 1) (LT s276 1)), p1:(AND (GEQ s63 1) (GEQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 4 ms.
FORMULA Szymanski-PT-b10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-06 finished in 9660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(p1)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:07:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:07:18] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 22:07:18] [INFO ] Implicit Places using invariants in 480 ms returned []
[2022-06-11 22:07:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:07:18] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:07:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:07:26] [INFO ] Implicit Places using invariants and state equation in 7834 ms returned []
Implicit Place search using SMT with State Equation took 8318 ms to find 0 implicit places.
[2022-06-11 22:07:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:07:26] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:07:28] [INFO ] Dead Transitions using invariants and state equation in 2147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s65 1) (GEQ s266 1)), p1:(AND (GEQ s55 1) (GEQ s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-07 finished in 10686 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||X(G(X(((G(p1) U p2)||p3)))))))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 34 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:07:28] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:07:28] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 22:07:29] [INFO ] Implicit Places using invariants in 473 ms returned []
[2022-06-11 22:07:29] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:07:29] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:07:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:07:35] [INFO ] Implicit Places using invariants and state equation in 5759 ms returned []
Implicit Place search using SMT with State Equation took 6236 ms to find 0 implicit places.
[2022-06-11 22:07:35] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:07:35] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 22:07:37] [INFO ] Dead Transitions using invariants and state equation in 2179 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR p3 p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s109 1) (LT s296 1)), p3:(AND (GEQ s98 1) (GEQ s286 1)), p2:(AND (GEQ s112 1) (GEQ s258 1)), p1:(AND (GEQ s61 1) (GEQ s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 560 ms.
Product exploration explored 100000 steps with 1 reset in 518 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR p3 p2 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 357 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Incomplete random walk after 10001 steps, including 3 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:07:39] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:07:39] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:07:39] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:07:42] [INFO ] After 3297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:07:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:07:46] [INFO ] After 3667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:07:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:07:58] [INFO ] After 12298ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 22:08:03] [INFO ] After 16489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2947 ms.
[2022-06-11 22:08:06] [INFO ] After 23207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 84 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 306 transition count 7937
Applied a total of 127 rules in 195 ms. Remains 306 /306 variables (removed 0) and now considering 7937/8064 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/8064 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 110486 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110486 steps, saw 85834 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:08:09] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:08:09] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-11 22:08:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:08:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:08:12] [INFO ] After 2581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:08:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:08:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:08:16] [INFO ] After 3675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:08:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:08:27] [INFO ] After 11863ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:08:37] [INFO ] After 21258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-06-11 22:08:37] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 84 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 254 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/7937 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 192 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
[2022-06-11 22:08:37] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:08:37] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 22:08:38] [INFO ] Implicit Places using invariants in 481 ms returned []
[2022-06-11 22:08:38] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:08:38] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-11 22:08:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:08:45] [INFO ] Implicit Places using invariants and state equation in 7386 ms returned []
Implicit Place search using SMT with State Equation took 7872 ms to find 0 implicit places.
[2022-06-11 22:08:46] [INFO ] Redundant transitions in 651 ms returned []
[2022-06-11 22:08:46] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:08:46] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 22:08:48] [INFO ] Dead Transitions using invariants and state equation in 2038 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/7937 transitions.
Graph (trivial) has 4560 edges and 306 vertex of which 28 / 306 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2286 transitions
Reduce isomorphic transitions removed 5366 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 283 transition count 2567
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 279 transition count 2567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 278 transition count 2566
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 427 place count 278 transition count 2150
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 278 transition count 2149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 429 place count 277 transition count 2149
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 430 place count 277 transition count 2148
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 432 place count 277 transition count 2148
Applied a total of 432 rules in 291 ms. Remains 277 /306 variables (removed 29) and now considering 2148/7937 (removed 5789) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2148 rows 277 cols
[2022-06-11 22:08:48] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 22:08:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:08:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:08:49] [INFO ] After 1231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:08:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:08:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:08:51] [INFO ] After 1786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:08:51] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 22:08:53] [INFO ] After 1989ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:08:56] [INFO ] After 4724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3275 ms.
[2022-06-11 22:08:59] [INFO ] After 9868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR p3 p2 p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR p1 p2 p3))]
Knowledge based reduction with 6 factoid took 380 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 33 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:09:00] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:09:00] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 22:09:01] [INFO ] Implicit Places using invariants in 453 ms returned []
[2022-06-11 22:09:01] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:09:01] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:09:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:09:06] [INFO ] Implicit Places using invariants and state equation in 5826 ms returned []
Implicit Place search using SMT with State Equation took 6280 ms to find 0 implicit places.
[2022-06-11 22:09:07] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:09:07] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 22:09:09] [INFO ] Dead Transitions using invariants and state equation in 2132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (OR p1 p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 301 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:09:09] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:09:09] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:09:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:09:13] [INFO ] After 3217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:09:13] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:09:16] [INFO ] After 3587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:09:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:09:29] [INFO ] After 12280ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 22:09:38] [INFO ] After 21329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-11 22:09:38] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 90 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 306 transition count 7937
Applied a total of 127 rules in 201 ms. Remains 306 /306 variables (removed 0) and now considering 7937/8064 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/8064 transitions.
Incomplete random walk after 10000 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 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 131666 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131666 steps, saw 102354 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:09:41] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:09:41] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-11 22:09:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:09:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:09:44] [INFO ] After 2298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:09:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:09:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:09:47] [INFO ] After 3433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:09:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:09:58] [INFO ] After 10858ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:10:09] [INFO ] After 21484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-11 22:10:09] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 74 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 198 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/7937 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 195 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
[2022-06-11 22:10:09] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:10:09] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 22:10:10] [INFO ] Implicit Places using invariants in 464 ms returned []
[2022-06-11 22:10:10] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:10:10] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-11 22:10:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:10:18] [INFO ] Implicit Places using invariants and state equation in 8023 ms returned []
Implicit Place search using SMT with State Equation took 8489 ms to find 0 implicit places.
[2022-06-11 22:10:18] [INFO ] Redundant transitions in 709 ms returned []
[2022-06-11 22:10:18] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:10:18] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 22:10:20] [INFO ] Dead Transitions using invariants and state equation in 2090 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/7937 transitions.
Graph (trivial) has 4560 edges and 306 vertex of which 28 / 306 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2286 transitions
Reduce isomorphic transitions removed 5366 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 283 transition count 2567
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 279 transition count 2567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 278 transition count 2566
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 427 place count 278 transition count 2150
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 278 transition count 2149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 429 place count 277 transition count 2149
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 430 place count 277 transition count 2148
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 432 place count 277 transition count 2148
Applied a total of 432 rules in 252 ms. Remains 277 /306 variables (removed 29) and now considering 2148/7937 (removed 5789) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2148 rows 277 cols
[2022-06-11 22:10:21] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-11 22:10:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:10:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:10:22] [INFO ] After 1177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:10:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:10:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:10:24] [INFO ] After 1602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:10:24] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 22:10:25] [INFO ] After 1837ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:10:28] [INFO ] After 4414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3140 ms.
[2022-06-11 22:10:31] [INFO ] After 9234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (OR p1 p2 p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR p1 p2 p3))]
Knowledge based reduction with 6 factoid took 364 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 16 reset in 447 ms.
Product exploration explored 100000 steps with 5 reset in 360 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 194 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:10:34] [INFO ] Redundant transitions in 665 ms returned []
[2022-06-11 22:10:34] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:10:34] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:10:36] [INFO ] Dead Transitions using invariants and state equation in 1982 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Product exploration explored 100000 steps with 5 reset in 368 ms.
Product exploration explored 100000 steps with 30 reset in 381 ms.
Built C files in :
/tmp/ltsmin8907111787391662709
[2022-06-11 22:10:37] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8907111787391662709
Running compilation step : cd /tmp/ltsmin8907111787391662709;'/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/ltsmin8907111787391662709;'/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/ltsmin8907111787391662709;'/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)
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 33 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:10:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:10:40] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:10:40] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-06-11 22:10:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:10:40] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 22:10:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:10:45] [INFO ] Implicit Places using invariants and state equation in 5063 ms returned []
Implicit Place search using SMT with State Equation took 5490 ms to find 0 implicit places.
[2022-06-11 22:10:45] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:10:45] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:10:48] [INFO ] Dead Transitions using invariants and state equation in 2408 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin15300526001755532697
[2022-06-11 22:10:48] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15300526001755532697
Running compilation step : cd /tmp/ltsmin15300526001755532697;'/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/ltsmin15300526001755532697;'/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/ltsmin15300526001755532697;'/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-06-11 22:10:51] [INFO ] Flatten gal took : 222 ms
[2022-06-11 22:10:52] [INFO ] Flatten gal took : 299 ms
[2022-06-11 22:10:52] [INFO ] Time to serialize gal into /tmp/LTL2559414312242999932.gal : 31 ms
[2022-06-11 22:10:52] [INFO ] Time to serialize properties into /tmp/LTL15103585801796107595.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/LTL2559414312242999932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15103585801796107595.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/LTL2559414...267
Read 1 LTL properties
Checking formula 0 : !((G((X("((p109<1)||(l42<1))"))||(X(G(X(((G("((p61>=1)&&(l50>=1))"))U("((p112>=1)&&(l2>=1))"))||("((p98>=1)&&(l32>=1))"))))))))
Formula 0 simplified : !G(X"((p109<1)||(l42<1))" | XGX("((p98>=1)&&(l32>=1))" | (G"((p61>=1)&&(l50>=1))" U "((p112>=1)&&(l2>=1))")))
Detected timeout of ITS tools.
[2022-06-11 22:11:07] [INFO ] Flatten gal took : 222 ms
[2022-06-11 22:11:07] [INFO ] Applying decomposition
[2022-06-11 22:11:07] [INFO ] Flatten gal took : 230 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/graph11712199179897772163.txt' '-o' '/tmp/graph11712199179897772163.bin' '-w' '/tmp/graph11712199179897772163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11712199179897772163.bin' '-l' '-1' '-v' '-w' '/tmp/graph11712199179897772163.weights' '-q' '0' '-e' '0.001'
[2022-06-11 22:11:08] [INFO ] Decomposing Gal with order
[2022-06-11 22:11:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 22:11:08] [INFO ] Removed a total of 18619 redundant transitions.
[2022-06-11 22:11:08] [INFO ] Flatten gal took : 552 ms
[2022-06-11 22:11:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 1198 labels/synchronizations in 264 ms.
[2022-06-11 22:11:09] [INFO ] Time to serialize gal into /tmp/LTL8713265988954756346.gal : 34 ms
[2022-06-11 22:11:09] [INFO ] Time to serialize properties into /tmp/LTL17534076518863798695.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/LTL8713265988954756346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17534076518863798695.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/LTL8713265...246
Read 1 LTL properties
Checking formula 0 : !((G((X("((i1.i0.u38.p109<1)||(i7.i1.u61.l42<1))"))||(X(G(X(((G("((i0.u21.p61>=1)&&(i8.u63.l50>=1))"))U("((i5.u51.p112>=1)&&(i2.i0.u45...219
Formula 0 simplified : !G(X"((i1.i0.u38.p109<1)||(i7.i1.u61.l42<1))" | XGX("((i2.i1.u47.p98>=1)&&(i1.i1.u57.l32>=1))" | (G"((i0.u21.p61>=1)&&(i8.u63.l50>=1...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin880548566056262532
[2022-06-11 22:11:24] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin880548566056262532
Running compilation step : cd /tmp/ltsmin880548566056262532;'/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/ltsmin880548566056262532;'/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/ltsmin880548566056262532;'/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)
Treatment of property Szymanski-PT-b10-LTLFireability-08 finished in 238561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 217 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:11:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:11:27] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 22:11:28] [INFO ] Implicit Places using invariants in 437 ms returned []
[2022-06-11 22:11:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:11:28] [INFO ] Computed 1 place invariants in 25 ms
[2022-06-11 22:11:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:11:34] [INFO ] Implicit Places using invariants and state equation in 6370 ms returned []
Implicit Place search using SMT with State Equation took 6819 ms to find 0 implicit places.
[2022-06-11 22:11:35] [INFO ] Redundant transitions in 655 ms returned []
[2022-06-11 22:11:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:11:35] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:11:37] [INFO ] Dead Transitions using invariants and state equation in 2299 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7 reset in 434 ms.
Product exploration explored 100000 steps with 30 reset in 498 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 257382 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257382 steps, saw 201607 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 22:11:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:11:41] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 22:11:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:11:42] [INFO ] After 1080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 22:11:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:11:43] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 22:11:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:11:46] [INFO ] After 2933ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 22:11:55] [INFO ] After 11951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 22:11:55] [INFO ] After 12842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 223 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 241962 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241962 steps, saw 187003 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 22:11:58] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 22:11:58] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:11:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:11:59] [INFO ] After 1052ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 22:11:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:12:01] [INFO ] After 1167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 22:12:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:12:05] [INFO ] After 4167ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 22:12:05] [INFO ] After 4388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1426 ms.
[2022-06-11 22:12:06] [INFO ] After 7051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 203 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 22:12:07] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 22:12:07] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:12:07] [INFO ] Implicit Places using invariants in 447 ms returned []
[2022-06-11 22:12:07] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 22:12:07] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:12:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:12:15] [INFO ] Implicit Places using invariants and state equation in 7318 ms returned []
Implicit Place search using SMT with State Equation took 7766 ms to find 0 implicit places.
[2022-06-11 22:12:15] [INFO ] Redundant transitions in 673 ms returned []
[2022-06-11 22:12:15] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 22:12:15] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 22:12:17] [INFO ] Dead Transitions using invariants and state equation in 2121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 192 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2022-06-11 22:12:18] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:12:18] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:12:18] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 22:12:18] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:12:19] [INFO ] After 836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 22:12:19] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-06-11 22:12:20] [INFO ] After 347ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 22:12:20] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 184 ms.
[2022-06-11 22:12:20] [INFO ] After 1575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 219 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 22:12:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:12:20] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 22:12:21] [INFO ] Implicit Places using invariants in 466 ms returned []
[2022-06-11 22:12:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:12:21] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 22:12:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:12:28] [INFO ] Implicit Places using invariants and state equation in 6690 ms returned []
Implicit Place search using SMT with State Equation took 7160 ms to find 0 implicit places.
[2022-06-11 22:12:28] [INFO ] Redundant transitions in 666 ms returned []
[2022-06-11 22:12:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:12:28] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 22:12:30] [INFO ] Dead Transitions using invariants and state equation in 2062 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 257490 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257490 steps, saw 201640 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 22:12:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:12:34] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 22:12:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:12:35] [INFO ] After 1047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 22:12:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:12:36] [INFO ] After 843ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 22:12:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:12:39] [INFO ] After 2951ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 22:12:48] [INFO ] After 11976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 22:12:48] [INFO ] After 12878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 240516 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240516 steps, saw 186779 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 22:12:51] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 22:12:51] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 22:12:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:12:52] [INFO ] After 1051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 22:12:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:12:53] [INFO ] After 1198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 22:12:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:12:57] [INFO ] After 4343ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 22:12:58] [INFO ] After 4569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1468 ms.
[2022-06-11 22:12:59] [INFO ] After 7298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 22:13:00] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 22:13:00] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:13:00] [INFO ] Implicit Places using invariants in 426 ms returned []
[2022-06-11 22:13:00] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 22:13:00] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 22:13:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:13:07] [INFO ] Implicit Places using invariants and state equation in 6916 ms returned []
Implicit Place search using SMT with State Equation took 7342 ms to find 0 implicit places.
[2022-06-11 22:13:08] [INFO ] Redundant transitions in 675 ms returned []
[2022-06-11 22:13:08] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 22:13:08] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 22:13:10] [INFO ] Dead Transitions using invariants and state equation in 1994 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 183 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2022-06-11 22:13:10] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:13:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:13:10] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 22:13:11] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:13:11] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 22:13:11] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-06-11 22:13:12] [INFO ] After 364ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 22:13:12] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 189 ms.
[2022-06-11 22:13:12] [INFO ] After 1617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29 reset in 407 ms.
Product exploration explored 100000 steps with 48 reset in 401 ms.
Built C files in :
/tmp/ltsmin1860171207704913073
[2022-06-11 22:13:13] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 22:13:13] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1860171207704913073
Running compilation step : cd /tmp/ltsmin1860171207704913073;'/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/ltsmin1860171207704913073;'/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/ltsmin1860171207704913073;'/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)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 221 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 22:13:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:13:16] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:13:17] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-06-11 22:13:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:13:17] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:13:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:13:25] [INFO ] Implicit Places using invariants and state equation in 7731 ms returned []
Implicit Place search using SMT with State Equation took 8182 ms to find 0 implicit places.
[2022-06-11 22:13:25] [INFO ] Redundant transitions in 715 ms returned []
[2022-06-11 22:13:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:13:25] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:13:28] [INFO ] Dead Transitions using invariants and state equation in 2456 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin11921954660881910498
[2022-06-11 22:13:28] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 22:13:28] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11921954660881910498
Running compilation step : cd /tmp/ltsmin11921954660881910498;'/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/ltsmin11921954660881910498;'/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/ltsmin11921954660881910498;'/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-06-11 22:13:31] [INFO ] Flatten gal took : 259 ms
[2022-06-11 22:13:32] [INFO ] Flatten gal took : 304 ms
[2022-06-11 22:13:32] [INFO ] Time to serialize gal into /tmp/LTL588156931273312401.gal : 19 ms
[2022-06-11 22:13:32] [INFO ] Time to serialize properties into /tmp/LTL16717207949779838825.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/LTL588156931273312401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16717207949779838825.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/LTL5881569...266
Read 1 LTL properties
Checking formula 0 : !((F(G("((s7<1)||(l21<1))"))))
Formula 0 simplified : !FG"((s7<1)||(l21<1))"
Detected timeout of ITS tools.
[2022-06-11 22:13:47] [INFO ] Flatten gal took : 213 ms
[2022-06-11 22:13:47] [INFO ] Applying decomposition
[2022-06-11 22:13:47] [INFO ] Flatten gal took : 221 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/graph14059451848804675777.txt' '-o' '/tmp/graph14059451848804675777.bin' '-w' '/tmp/graph14059451848804675777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14059451848804675777.bin' '-l' '-1' '-v' '-w' '/tmp/graph14059451848804675777.weights' '-q' '0' '-e' '0.001'
[2022-06-11 22:13:47] [INFO ] Decomposing Gal with order
[2022-06-11 22:13:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 22:13:48] [INFO ] Removed a total of 18142 redundant transitions.
[2022-06-11 22:13:48] [INFO ] Flatten gal took : 572 ms
[2022-06-11 22:13:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1181 labels/synchronizations in 216 ms.
[2022-06-11 22:13:49] [INFO ] Time to serialize gal into /tmp/LTL16372395676215128960.gal : 16 ms
[2022-06-11 22:13:49] [INFO ] Time to serialize properties into /tmp/LTL2839917336764965354.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/LTL16372395676215128960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2839917336764965354.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/LTL1637239...246
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.i1.u2.s7<1)||(i7.u53.l21<1))"))))
Formula 0 simplified : !FG"((i1.i1.u2.s7<1)||(i7.u53.l21<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5891090839622099808
[2022-06-11 22:14:04] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5891090839622099808
Running compilation step : cd /tmp/ltsmin5891090839622099808;'/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/ltsmin5891090839622099808;'/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/ltsmin5891090839622099808;'/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)
Treatment of property Szymanski-PT-b10-LTLFireability-09 finished in 159750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(G((((F(p0)&&X(p1)) U p1)||X(p2))))))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:14:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:07] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 22:14:07] [INFO ] Implicit Places using invariants in 424 ms returned []
[2022-06-11 22:14:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:07] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:14:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:14:15] [INFO ] Implicit Places using invariants and state equation in 7820 ms returned []
Implicit Place search using SMT with State Equation took 8262 ms to find 0 implicit places.
[2022-06-11 22:14:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:15] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 22:14:17] [INFO ] Dead Transitions using invariants and state equation in 2112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s87 1) (GEQ s290 1)), p0:(AND (GEQ s73 1) (GEQ s275 1)), p2:(AND (GEQ s90 1) (GEQ s271 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 211 steps with 0 reset in 5 ms.
FORMULA Szymanski-PT-b10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-10 finished in 10608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(G(p0)))||G(X((X(p1)||p2)))))'
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:14:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:17] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:14:18] [INFO ] Implicit Places using invariants in 410 ms returned []
[2022-06-11 22:14:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:18] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:14:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:14:24] [INFO ] Implicit Places using invariants and state equation in 6333 ms returned []
Implicit Place search using SMT with State Equation took 6769 ms to find 0 implicit places.
[2022-06-11 22:14:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:24] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:14:26] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(AND (GEQ s26 1) (GEQ s261 1)), p2:(AND (GEQ s67 1) (GEQ s272 1)), p0:(AND (GEQ s102 1) (GEQ s261 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-12 finished in 9032 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 50 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:14:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:26] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 22:14:27] [INFO ] Implicit Places using invariants in 494 ms returned []
[2022-06-11 22:14:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:27] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:14:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:14:33] [INFO ] Implicit Places using invariants and state equation in 6533 ms returned []
Implicit Place search using SMT with State Equation took 7050 ms to find 0 implicit places.
[2022-06-11 22:14:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:33] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 22:14:35] [INFO ] Dead Transitions using invariants and state equation in 2006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (GEQ s60 1) (GEQ s283 1)), p0:(AND (GEQ s106 1) (GEQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-13 finished in 9243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:14:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:36] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 22:14:36] [INFO ] Implicit Places using invariants in 445 ms returned []
[2022-06-11 22:14:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:36] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:14:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:14:44] [INFO ] Implicit Places using invariants and state equation in 8260 ms returned []
Implicit Place search using SMT with State Equation took 8707 ms to find 0 implicit places.
[2022-06-11 22:14:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:44] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 22:14:46] [INFO ] Dead Transitions using invariants and state equation in 1975 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s96 1) (GEQ s275 1)), p1:(OR (LT s96 1) (LT s275 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 261 steps with 0 reset in 4 ms.
FORMULA Szymanski-PT-b10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-14 finished in 10886 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U p1))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 266 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 22:14:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:47] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 22:14:47] [INFO ] Implicit Places using invariants in 433 ms returned []
[2022-06-11 22:14:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:47] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:14:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:14:55] [INFO ] Implicit Places using invariants and state equation in 7555 ms returned []
Implicit Place search using SMT with State Equation took 7990 ms to find 0 implicit places.
[2022-06-11 22:14:55] [INFO ] Redundant transitions in 685 ms returned []
[2022-06-11 22:14:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:55] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 22:14:57] [INFO ] Dead Transitions using invariants and state equation in 1970 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), true, p0]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s92 1) (GEQ s267 1)), p0:(AND (GEQ s100 1) (GEQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4 reset in 452 ms.
Product exploration explored 100000 steps with 17 reset in 444 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 304 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-11 22:14:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:14:59] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:14:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:15:00] [INFO ] After 1410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 22:15:00] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:15:03] [INFO ] After 2292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 22:15:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:15:05] [INFO ] After 2475ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 22:15:06] [INFO ] After 2916ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 438 ms.
[2022-06-11 22:15:06] [INFO ] After 5715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 157386 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157386 steps, saw 123191 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 22:15:09] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:15:09] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-11 22:15:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-11 22:15:11] [INFO ] After 1561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 22:15:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-11 22:15:13] [INFO ] After 2015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 22:15:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:15:17] [INFO ] After 3573ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 22:15:17] [INFO ] After 4119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 502 ms.
[2022-06-11 22:15:18] [INFO ] After 6705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 22:15:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:15:18] [INFO ] Computed 2 place invariants in 20 ms
[2022-06-11 22:15:19] [INFO ] Implicit Places using invariants in 448 ms returned []
[2022-06-11 22:15:19] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:15:19] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 22:15:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:15:26] [INFO ] Implicit Places using invariants and state equation in 7906 ms returned []
Implicit Place search using SMT with State Equation took 8355 ms to find 0 implicit places.
[2022-06-11 22:15:27] [INFO ] Redundant transitions in 680 ms returned []
[2022-06-11 22:15:27] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:15:27] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 22:15:29] [INFO ] Dead Transitions using invariants and state equation in 1986 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 3104 transitions
Ensure Unique test removed 2327 transitions
Reduce isomorphic transitions removed 5431 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 282 transition count 2377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2377
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 281 transition count 2374
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 278 transition count 2374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 277 transition count 2373
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 277 transition count 2372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 277 transition count 2371
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 276 transition count 2371
Applied a total of 14 rules in 120 ms. Remains 276 /305 variables (removed 29) and now considering 2371/7809 (removed 5438) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2371 rows 276 cols
[2022-06-11 22:15:29] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 22:15:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-11 22:15:30] [INFO ] After 891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 22:15:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 22:15:31] [INFO ] After 825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 22:15:31] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-06-11 22:15:32] [INFO ] After 698ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 22:15:33] [INFO ] After 1659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 628 ms.
[2022-06-11 22:15:33] [INFO ] After 3174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), true, p0]
[2022-06-11 22:15:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:15:34] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 22:15:36] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 22:15:36] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2022-06-11 22:15:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 22:15:38] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 22:15:39] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2022-06-11 22:15:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:15:41] [INFO ] [Nat]Added 147 Read/Feed constraints in 2076 ms returned sat
[2022-06-11 22:15:42] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 563 ms.
[2022-06-11 22:15:42] [INFO ] Added : 0 causal constraints over 0 iterations in 729 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 22:15:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:15:42] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:15:42] [INFO ] Implicit Places using invariants in 459 ms returned []
[2022-06-11 22:15:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:15:42] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:15:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:15:50] [INFO ] Implicit Places using invariants and state equation in 7855 ms returned []
Implicit Place search using SMT with State Equation took 8318 ms to find 0 implicit places.
[2022-06-11 22:15:51] [INFO ] Redundant transitions in 696 ms returned []
[2022-06-11 22:15:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:15:51] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:15:53] [INFO ] Dead Transitions using invariants and state equation in 1968 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 360 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), true, p0]
Incomplete random walk after 10005 steps, including 4 resets, run finished after 69 ms. (steps per millisecond=145 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 148151 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148151 steps, saw 116707 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-11 22:15:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:15:57] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:15:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:15:57] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 22:15:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:16:01] [INFO ] After 4109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 22:16:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:16:05] [INFO ] After 4304ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 22:16:15] [INFO ] After 14246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 795 ms.
[2022-06-11 22:16:16] [INFO ] After 19226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 58 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 227 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-11 22:16:16] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:16:16] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-11 22:16:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 8 ms returned sat
[2022-06-11 22:16:18] [INFO ] After 1533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 22:16:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 22:16:20] [INFO ] After 1979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 22:16:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:16:23] [INFO ] After 3471ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 22:16:24] [INFO ] After 3997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 493 ms.
[2022-06-11 22:16:24] [INFO ] After 6546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 148358 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148358 steps, saw 115585 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 22:16:28] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:16:28] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 22:16:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 22:16:29] [INFO ] After 1529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 22:16:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 22:16:31] [INFO ] After 1962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 22:16:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:16:35] [INFO ] After 3525ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 22:16:35] [INFO ] After 4072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 502 ms.
[2022-06-11 22:16:36] [INFO ] After 6609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 215 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 22:16:36] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:16:36] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 22:16:37] [INFO ] Implicit Places using invariants in 440 ms returned []
[2022-06-11 22:16:37] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:16:37] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 22:16:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:16:44] [INFO ] Implicit Places using invariants and state equation in 7204 ms returned []
Implicit Place search using SMT with State Equation took 7646 ms to find 0 implicit places.
[2022-06-11 22:16:44] [INFO ] Redundant transitions in 665 ms returned []
[2022-06-11 22:16:44] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 22:16:45] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 22:16:46] [INFO ] Dead Transitions using invariants and state equation in 1932 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3104 transitions
Ensure Unique test removed 2327 transitions
Reduce isomorphic transitions removed 5431 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 282 transition count 2377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2377
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 281 transition count 2374
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 278 transition count 2374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 277 transition count 2373
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 277 transition count 2372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 277 transition count 2371
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 276 transition count 2371
Applied a total of 14 rules in 116 ms. Remains 276 /305 variables (removed 29) and now considering 2371/7809 (removed 5438) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2371 rows 276 cols
[2022-06-11 22:16:47] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-11 22:16:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 22:16:48] [INFO ] After 911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 22:16:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 22:16:48] [INFO ] After 825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 22:16:48] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-06-11 22:16:49] [INFO ] After 698ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 22:16:50] [INFO ] After 1675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 632 ms.
[2022-06-11 22:16:51] [INFO ] After 3194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 304 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), true, p0]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), true, p0]
[2022-06-11 22:16:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:16:51] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:16:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 22:16:54] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2022-06-11 22:16:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 22:16:56] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 22:16:56] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2022-06-11 22:16:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:16:58] [INFO ] [Nat]Added 147 Read/Feed constraints in 2048 ms returned sat
[2022-06-11 22:16:59] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 513 ms.
[2022-06-11 22:16:59] [INFO ] Added : 0 causal constraints over 0 iterations in 683 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), true, p0]
Product exploration explored 100000 steps with 18 reset in 541 ms.
Product exploration explored 100000 steps with 15 reset in 521 ms.
Built C files in :
/tmp/ltsmin5553326528034035087
[2022-06-11 22:17:00] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 22:17:00] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5553326528034035087
Running compilation step : cd /tmp/ltsmin5553326528034035087;'/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/ltsmin5553326528034035087;'/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/ltsmin5553326528034035087;'/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)
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 22:17:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:17:03] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:17:04] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-06-11 22:17:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:17:04] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:17:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:17:11] [INFO ] Implicit Places using invariants and state equation in 7010 ms returned []
Implicit Place search using SMT with State Equation took 7448 ms to find 0 implicit places.
[2022-06-11 22:17:11] [INFO ] Redundant transitions in 688 ms returned []
[2022-06-11 22:17:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 22:17:11] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:17:14] [INFO ] Dead Transitions using invariants and state equation in 2252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin14240294669595732396
[2022-06-11 22:17:14] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 22:17:14] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14240294669595732396
Running compilation step : cd /tmp/ltsmin14240294669595732396;'/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/ltsmin14240294669595732396;'/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/ltsmin14240294669595732396;'/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-06-11 22:17:17] [INFO ] Flatten gal took : 213 ms
[2022-06-11 22:17:17] [INFO ] Flatten gal took : 219 ms
[2022-06-11 22:17:17] [INFO ] Time to serialize gal into /tmp/LTL17337739448956601830.gal : 32 ms
[2022-06-11 22:17:17] [INFO ] Time to serialize properties into /tmp/LTL6732983625605093030.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/LTL17337739448956601830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6732983625605093030.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/LTL1733773...267
Read 1 LTL properties
Checking formula 0 : !(((!(F("((p100>=1)&&(l29>=1))")))U("((p92>=1)&&(l11>=1))")))
Formula 0 simplified : !(!F"((p100>=1)&&(l29>=1))" U "((p92>=1)&&(l11>=1))")
Detected timeout of ITS tools.
[2022-06-11 22:17:33] [INFO ] Flatten gal took : 240 ms
[2022-06-11 22:17:33] [INFO ] Applying decomposition
[2022-06-11 22:17:33] [INFO ] Flatten gal took : 252 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/graph1631124460309568678.txt' '-o' '/tmp/graph1631124460309568678.bin' '-w' '/tmp/graph1631124460309568678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1631124460309568678.bin' '-l' '-1' '-v' '-w' '/tmp/graph1631124460309568678.weights' '-q' '0' '-e' '0.001'
[2022-06-11 22:17:33] [INFO ] Decomposing Gal with order
[2022-06-11 22:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 22:17:34] [INFO ] Removed a total of 18365 redundant transitions.
[2022-06-11 22:17:34] [INFO ] Flatten gal took : 411 ms
[2022-06-11 22:17:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1003 labels/synchronizations in 170 ms.
[2022-06-11 22:17:34] [INFO ] Time to serialize gal into /tmp/LTL6347550237061632154.gal : 16 ms
[2022-06-11 22:17:34] [INFO ] Time to serialize properties into /tmp/LTL9942027462281560865.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/LTL6347550237061632154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9942027462281560865.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/LTL6347550...245
Read 1 LTL properties
Checking formula 0 : !(((!(F("((i1.i1.u34.p100>=1)&&(i2.u49.l29>=1))")))U("((i6.u31.p92>=1)&&(i2.u49.l11>=1))")))
Formula 0 simplified : !(!F"((i1.i1.u34.p100>=1)&&(i2.u49.l29>=1))" U "((i6.u31.p92>=1)&&(i2.u49.l11>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12548664945653658800
[2022-06-11 22:17:49] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12548664945653658800
Running compilation step : cd /tmp/ltsmin12548664945653658800;'/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/ltsmin12548664945653658800;'/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/ltsmin12548664945653658800;'/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)
Treatment of property Szymanski-PT-b10-LTLFireability-15 finished in 186007 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p0)&&!(F(X(p1)) U (p2 U p3))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||X(G(X(((G(p1) U p2)||p3)))))))'
Found a SL insensitive property : Szymanski-PT-b10-LTLFireability-08
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 58 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:17:53] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:17:53] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:17:54] [INFO ] Implicit Places using invariants in 529 ms returned []
[2022-06-11 22:17:54] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:17:54] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:17:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:17:58] [INFO ] Implicit Places using invariants and state equation in 4709 ms returned []
Implicit Place search using SMT with State Equation took 5240 ms to find 0 implicit places.
[2022-06-11 22:17:58] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:17:58] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:18:00] [INFO ] Dead Transitions using invariants and state equation in 2096 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR p3 p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s109 1) (LT s296 1)), p3:(AND (GEQ s98 1) (GEQ s286 1)), p2:(AND (GEQ s112 1) (GEQ s258 1)), p1:(AND (GEQ s61 1) (GEQ s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 432 ms.
Product exploration explored 100000 steps with 21 reset in 482 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR p3 p2 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 356 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Incomplete random walk after 10005 steps, including 3 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:18:02] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:18:02] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 22:18:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:18:05] [INFO ] After 3014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:18:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:18:09] [INFO ] After 3427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:18:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:18:21] [INFO ] After 12083ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 22:18:30] [INFO ] After 21496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-11 22:18:30] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 94 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 306 transition count 7937
Applied a total of 127 rules in 232 ms. Remains 306 /306 variables (removed 0) and now considering 7937/8064 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 127301 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127301 steps, saw 99017 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:18:34] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:18:34] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 22:18:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:18:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:18:36] [INFO ] After 2399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:18:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-11 22:18:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:18:40] [INFO ] After 3512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:18:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:18:51] [INFO ] After 11057ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:19:01] [INFO ] After 21413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-11 22:19:01] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 73 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 187 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/7937 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 228 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
[2022-06-11 22:19:02] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:19:02] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-11 22:19:02] [INFO ] Implicit Places using invariants in 484 ms returned []
[2022-06-11 22:19:02] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:19:02] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-11 22:19:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:19:12] [INFO ] Implicit Places using invariants and state equation in 9565 ms returned []
Implicit Place search using SMT with State Equation took 10054 ms to find 0 implicit places.
[2022-06-11 22:19:12] [INFO ] Redundant transitions in 637 ms returned []
[2022-06-11 22:19:12] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:19:12] [INFO ] Computed 2 place invariants in 19 ms
[2022-06-11 22:19:14] [INFO ] Dead Transitions using invariants and state equation in 2045 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/7937 transitions.
Graph (trivial) has 4560 edges and 306 vertex of which 28 / 306 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2286 transitions
Reduce isomorphic transitions removed 5366 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 283 transition count 2567
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 279 transition count 2567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 278 transition count 2566
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 427 place count 278 transition count 2150
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 278 transition count 2149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 429 place count 277 transition count 2149
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 430 place count 277 transition count 2148
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 432 place count 277 transition count 2148
Applied a total of 432 rules in 240 ms. Remains 277 /306 variables (removed 29) and now considering 2148/7937 (removed 5789) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2148 rows 277 cols
[2022-06-11 22:19:15] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 22:19:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:19:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:19:16] [INFO ] After 1160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:19:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 22:19:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:19:18] [INFO ] After 1664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:19:18] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 22:19:20] [INFO ] After 1872ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:19:22] [INFO ] After 4468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3160 ms.
[2022-06-11 22:19:25] [INFO ] After 9395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR p3 p2 p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR p1 p2 p3))]
Knowledge based reduction with 6 factoid took 379 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 33 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:19:26] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:19:26] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:19:27] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-06-11 22:19:27] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:19:27] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:19:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:19:31] [INFO ] Implicit Places using invariants and state equation in 4450 ms returned []
Implicit Place search using SMT with State Equation took 4889 ms to find 0 implicit places.
[2022-06-11 22:19:31] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:19:31] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 22:19:33] [INFO ] Dead Transitions using invariants and state equation in 1978 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (OR p1 p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 280 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Incomplete random walk after 10005 steps, including 3 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:19:34] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:19:34] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 22:19:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:19:37] [INFO ] After 3051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:19:37] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 22:19:40] [INFO ] After 3454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:19:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:19:52] [INFO ] After 12019ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 22:20:02] [INFO ] After 21468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-06-11 22:20:02] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 81 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 306 transition count 7937
Applied a total of 127 rules in 194 ms. Remains 306 /306 variables (removed 0) and now considering 7937/8064 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/8064 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 109519 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109519 steps, saw 85057 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-11 22:20:05] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:20:05] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-11 22:20:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 22:20:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2022-06-11 22:20:08] [INFO ] After 2274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:20:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 22:20:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:20:11] [INFO ] After 3495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:20:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:20:22] [INFO ] After 10928ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:20:33] [INFO ] After 21423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-11 22:20:33] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 73 ms.
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 189 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/7937 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7937/7937 transitions.
Applied a total of 0 rules in 213 ms. Remains 306 /306 variables (removed 0) and now considering 7937/7937 (removed 0) transitions.
[2022-06-11 22:20:33] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:20:33] [INFO ] Computed 2 place invariants in 20 ms
[2022-06-11 22:20:34] [INFO ] Implicit Places using invariants in 463 ms returned []
[2022-06-11 22:20:34] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:20:34] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-11 22:20:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:20:42] [INFO ] Implicit Places using invariants and state equation in 8656 ms returned []
Implicit Place search using SMT with State Equation took 9120 ms to find 0 implicit places.
[2022-06-11 22:20:43] [INFO ] Redundant transitions in 692 ms returned []
[2022-06-11 22:20:43] [INFO ] Flow matrix only has 2606 transitions (discarded 5331 similar events)
// Phase 1: matrix 2606 rows 306 cols
[2022-06-11 22:20:43] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 22:20:45] [INFO ] Dead Transitions using invariants and state equation in 1990 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7937/7937 transitions.
Graph (trivial) has 4560 edges and 306 vertex of which 28 / 306 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2286 transitions
Reduce isomorphic transitions removed 5366 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 283 transition count 2567
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 279 transition count 2567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 278 transition count 2566
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 427 place count 278 transition count 2150
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 428 place count 278 transition count 2149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 429 place count 277 transition count 2149
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 430 place count 277 transition count 2148
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 432 place count 277 transition count 2148
Applied a total of 432 rules in 235 ms. Remains 277 /306 variables (removed 29) and now considering 2148/7937 (removed 5789) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2148 rows 277 cols
[2022-06-11 22:20:45] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 22:20:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:20:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:20:46] [INFO ] After 1130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 22:20:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 22:20:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 22:20:48] [INFO ] After 1576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 22:20:48] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-06-11 22:20:50] [INFO ] After 1802ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 22:20:52] [INFO ] After 4279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3055 ms.
[2022-06-11 22:20:55] [INFO ] After 8993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (OR p1 p2 p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR p1 p2 p3))]
Knowledge based reduction with 6 factoid took 376 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 2 reset in 527 ms.
Product exploration explored 100000 steps with 37 reset in 595 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2)]
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 196 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:20:59] [INFO ] Redundant transitions in 692 ms returned []
[2022-06-11 22:20:59] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:20:59] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 22:21:01] [INFO ] Dead Transitions using invariants and state equation in 2089 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Product exploration explored 100000 steps with 43 reset in 421 ms.
Product exploration explored 100000 steps with 48 reset in 436 ms.
Built C files in :
/tmp/ltsmin14845919069238403697
[2022-06-11 22:21:02] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14845919069238403697
Running compilation step : cd /tmp/ltsmin14845919069238403697;'/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/ltsmin14845919069238403697;'/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/ltsmin14845919069238403697;'/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)
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 29 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 22:21:05] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:21:05] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 22:21:05] [INFO ] Implicit Places using invariants in 423 ms returned []
[2022-06-11 22:21:05] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:21:05] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:21:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 22:21:10] [INFO ] Implicit Places using invariants and state equation in 4733 ms returned []
Implicit Place search using SMT with State Equation took 5157 ms to find 0 implicit places.
[2022-06-11 22:21:10] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 22:21:10] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 22:21:12] [INFO ] Dead Transitions using invariants and state equation in 1972 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin12235758946615749267
[2022-06-11 22:21:12] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12235758946615749267
Running compilation step : cd /tmp/ltsmin12235758946615749267;'/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/ltsmin12235758946615749267;'/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/ltsmin12235758946615749267;'/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-06-11 22:21:16] [INFO ] Flatten gal took : 217 ms
[2022-06-11 22:21:16] [INFO ] Flatten gal took : 244 ms
[2022-06-11 22:21:16] [INFO ] Time to serialize gal into /tmp/LTL17750269366956731528.gal : 17 ms
[2022-06-11 22:21:16] [INFO ] Time to serialize properties into /tmp/LTL9539936004735553769.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/LTL17750269366956731528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9539936004735553769.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/LTL1775026...267
Read 1 LTL properties
Checking formula 0 : !((G((X("((p109<1)||(l42<1))"))||(X(G(X(((G("((p61>=1)&&(l50>=1))"))U("((p112>=1)&&(l2>=1))"))||("((p98>=1)&&(l32>=1))"))))))))
Formula 0 simplified : !G(X"((p109<1)||(l42<1))" | XGX("((p98>=1)&&(l32>=1))" | (G"((p61>=1)&&(l50>=1))" U "((p112>=1)&&(l2>=1))")))
Detected timeout of ITS tools.
[2022-06-11 22:21:31] [INFO ] Flatten gal took : 212 ms
[2022-06-11 22:21:31] [INFO ] Applying decomposition
[2022-06-11 22:21:31] [INFO ] Flatten gal took : 218 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/graph10472720501740399106.txt' '-o' '/tmp/graph10472720501740399106.bin' '-w' '/tmp/graph10472720501740399106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10472720501740399106.bin' '-l' '-1' '-v' '-w' '/tmp/graph10472720501740399106.weights' '-q' '0' '-e' '0.001'
[2022-06-11 22:21:32] [INFO ] Decomposing Gal with order
[2022-06-11 22:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 22:21:32] [INFO ] Removed a total of 18396 redundant transitions.
[2022-06-11 22:21:32] [INFO ] Flatten gal took : 406 ms
[2022-06-11 22:21:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1123 labels/synchronizations in 255 ms.
[2022-06-11 22:21:33] [INFO ] Time to serialize gal into /tmp/LTL103009914437240811.gal : 16 ms
[2022-06-11 22:21:33] [INFO ] Time to serialize properties into /tmp/LTL13290565568865785186.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/LTL103009914437240811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13290565568865785186.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/LTL1030099...245
Read 1 LTL properties
Checking formula 0 : !((G((X("((i8.u38.p109<1)||(i6.u60.l42<1))"))||(X(G(X(((G("((i1.i1.u21.p61>=1)&&(i8.u62.l50>=1))"))U("((i4.u51.p112>=1)&&(i2.i0.u45.l2...216
Formula 0 simplified : !G(X"((i8.u38.p109<1)||(i6.u60.l42<1))" | XGX("((i2.i1.u47.p98>=1)&&(i1.i1.u56.l32>=1))" | (G"((i1.i1.u21.p61>=1)&&(i8.u62.l50>=1))"...200
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10594489946107252070
[2022-06-11 22:21:48] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10594489946107252070
Running compilation step : cd /tmp/ltsmin10594489946107252070;'/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/ltsmin10594489946107252070;'/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/ltsmin10594489946107252070;'/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)
Treatment of property Szymanski-PT-b10-LTLFireability-08 finished in 238046 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U p1))'
[2022-06-11 22:21:51] [INFO ] Flatten gal took : 259 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11847828270668824451
[2022-06-11 22:21:51] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2022-06-11 22:21:51] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11847828270668824451
Running compilation step : cd /tmp/ltsmin11847828270668824451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 22:21:51] [INFO ] Applying decomposition
[2022-06-11 22:21:51] [INFO ] Flatten gal took : 233 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/graph4914418082613100199.txt' '-o' '/tmp/graph4914418082613100199.bin' '-w' '/tmp/graph4914418082613100199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4914418082613100199.bin' '-l' '-1' '-v' '-w' '/tmp/graph4914418082613100199.weights' '-q' '0' '-e' '0.001'
[2022-06-11 22:21:52] [INFO ] Decomposing Gal with order
[2022-06-11 22:21:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 22:21:52] [INFO ] Removed a total of 18093 redundant transitions.
[2022-06-11 22:21:53] [INFO ] Flatten gal took : 453 ms
[2022-06-11 22:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1104 labels/synchronizations in 196 ms.
[2022-06-11 22:21:53] [INFO ] Time to serialize gal into /tmp/LTLFireability7371616258818585221.gal : 20 ms
[2022-06-11 22:21:53] [INFO ] Time to serialize properties into /tmp/LTLFireability3816236395815984834.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/LTLFireability7371616258818585221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3816236395815984834.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...267
Read 4 LTL properties
Checking formula 0 : !(((("((i7.i0.u39.p113>=1)&&(i6.i1.u56.l35>=1))")U(!("((i7.i0.u39.p113>=1)&&(i6.i1.u56.l35>=1))")))&&(!((F(X("((i6.i1.u42.p127>=1)&&(i...262
Formula 0 simplified : !(("((i7.i0.u39.p113>=1)&&(i6.i1.u56.l35>=1))" U !"((i7.i0.u39.p113>=1)&&(i6.i1.u56.l35>=1))") & !(FX"((i6.i1.u42.p127>=1)&&(i0.u54....251
Compilation finished in 32173 ms.
Running link step : cd /tmp/ltsmin11847828270668824451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin11847828270668824451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U !(LTLAPp0==true))&&!(<>(X((LTLAPp1==true))) U ((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11847828270668824451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U !(LTLAPp0==true))&&!(<>(X((LTLAPp1==true))) U ((LTLAPp2==true) U (LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11847828270668824451;'/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((LTLAPp4==true))||X([](X((([]((LTLAPp5==true)) U (LTLAPp6==true))||(LTLAPp7==true)))))))' '--buchi-type=spotba'
LTSmin run took 182679 ms.
FORMULA Szymanski-PT-b10-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11847828270668824451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp8==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 22:48:36] [INFO ] Flatten gal took : 680 ms
[2022-06-11 22:48:36] [INFO ] Time to serialize gal into /tmp/LTLFireability239266821151242676.gal : 48 ms
[2022-06-11 22:48:36] [INFO ] Time to serialize properties into /tmp/LTLFireability18081272835273285449.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/LTLFireability239266821151242676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18081272835273285449.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/LTLFireabi...288
Read 3 LTL properties
Checking formula 0 : !(((("((p113>=1)&&(l35>=1))")U(!("((p113>=1)&&(l35>=1))")))&&(!((F(X("((p127>=1)&&(l26>=1))")))U(("((p82>=1)&&(l39>=1))")U("((p14>=1)&...172
Formula 0 simplified : !(("((p113>=1)&&(l35>=1))" U !"((p113>=1)&&(l35>=1))") & !(FX"((p127>=1)&&(l26>=1))" U ("((p82>=1)&&(l39>=1))" U "((p14>=1)&&(l36>=1...161
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin11847828270668824451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp8==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11847828270668824451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(!<>((LTLAPp9==true)) U (LTLAPp10==true))' '--buchi-type=spotba'
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="Szymanski-PT-b10"
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 Szymanski-PT-b10, 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 r312-tall-165472283101068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b10.tgz
mv Szymanski-PT-b10 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 ;