About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.327 | 3600000.00 | 4581417.00 | 405847.50 | TFFT?FFFTT??FFFF | 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.r132-tall-165271821300756.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 MultiCrashLeafsetExtension-PT-S24C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821300756
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 12K Apr 29 17:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 17:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 9 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 15M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652853392467
Running Version 202205111006
[2022-05-18 05:56:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 05:56:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 05:56:34] [INFO ] Load time of PNML (sax parser for PT used): 947 ms
[2022-05-18 05:56:34] [INFO ] Transformed 15180 places.
[2022-05-18 05:56:34] [INFO ] Transformed 22267 transitions.
[2022-05-18 05:56:34] [INFO ] Parsed PT model containing 15180 places and 22267 transitions in 1186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 15180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15180/15180 places, 22267/22267 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 15136 transition count 22267
Applied a total of 44 rules in 666 ms. Remains 15136 /15180 variables (removed 44) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 05:56:35] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 05:56:37] [INFO ] Computed 1093 place invariants in 1813 ms
[2022-05-18 05:56:39] [INFO ] Implicit Places using invariants in 3316 ms returned []
Implicit Place search using SMT only with invariants took 3344 ms to find 0 implicit places.
[2022-05-18 05:56:39] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 05:56:40] [INFO ] Computed 1093 place invariants in 1535 ms
[2022-05-18 05:56:41] [INFO ] Dead Transitions using invariants and state equation in 2819 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15136/15180 places, 22267/22267 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15180 places, 22267/22267 transitions.
Support contains 60 out of 15136 places after structural reductions.
[2022-05-18 05:56:43] [INFO ] Flatten gal took : 941 ms
[2022-05-18 05:56:44] [INFO ] Flatten gal took : 773 ms
[2022-05-18 05:56:45] [INFO ] Input system was already deterministic with 22267 transitions.
Support contains 54 out of 15136 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 861 ms. (steps per millisecond=11 ) properties (out of 31) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2022-05-18 05:56:46] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 05:56:48] [INFO ] Computed 1093 place invariants in 1551 ms
[2022-05-18 05:56:54] [INFO ] [Real]Absence check using 47 positive place invariants in 184 ms returned sat
[2022-05-18 05:56:54] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 571 ms returned sat
[2022-05-18 05:57:13] [INFO ] After 15429ms SMT Verify possible using state equation in real domain returned unsat :1 sat :16
[2022-05-18 05:57:13] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2022-05-18 05:57:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 05:57:13] [INFO ] After 25132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4724 transitions
Trivial Post-agglo rules discarded 4724 transitions
Performed 4724 trivial Post agglomeration. Transition count delta: 4724
Iterating post reduction 0 with 4724 rules applied. Total rules applied 4724 place count 15136 transition count 17543
Reduce places removed 4724 places and 0 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 1 with 4796 rules applied. Total rules applied 9520 place count 10412 transition count 17471
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 9592 place count 10340 transition count 17471
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 9592 place count 10340 transition count 17077
Deduced a syphon composed of 394 places in 14 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 10380 place count 9946 transition count 17077
Discarding 4390 places :
Symmetric choice reduction at 3 with 4390 rule applications. Total rules 14770 place count 5556 transition count 12687
Iterating global reduction 3 with 4390 rules applied. Total rules applied 19160 place count 5556 transition count 12687
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 19160 place count 5556 transition count 12678
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 19178 place count 5547 transition count 12678
Discarding 537 places :
Symmetric choice reduction at 3 with 537 rule applications. Total rules 19715 place count 5010 transition count 8382
Iterating global reduction 3 with 537 rules applied. Total rules applied 20252 place count 5010 transition count 8382
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20302 place count 4985 transition count 8357
Free-agglomeration rule (complex) applied 344 times.
Iterating global reduction 3 with 344 rules applied. Total rules applied 20646 place count 4985 transition count 11772
Reduce places removed 344 places and 0 transitions.
Iterating post reduction 3 with 344 rules applied. Total rules applied 20990 place count 4641 transition count 11772
Partial Free-agglomeration rule applied 169 times.
Drop transitions removed 169 transitions
Iterating global reduction 4 with 169 rules applied. Total rules applied 21159 place count 4641 transition count 11772
Applied a total of 21159 rules in 5093 ms. Remains 4641 /15136 variables (removed 10495) and now considering 11772/22267 (removed 10495) transitions.
Finished structural reductions, in 1 iterations. Remains : 4641/15136 places, 11772/22267 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 753 ms. (steps per millisecond=13 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2022-05-18 05:57:19] [INFO ] Flow matrix only has 10888 transitions (discarded 884 similar events)
// Phase 1: matrix 10888 rows 4641 cols
[2022-05-18 05:57:19] [INFO ] Computed 1093 place invariants in 296 ms
[2022-05-18 05:57:21] [INFO ] [Real]Absence check using 47 positive place invariants in 51 ms returned sat
[2022-05-18 05:57:21] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 306 ms returned sat
[2022-05-18 05:57:31] [INFO ] After 11896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-18 05:57:33] [INFO ] [Nat]Absence check using 47 positive place invariants in 46 ms returned sat
[2022-05-18 05:57:33] [INFO ] [Nat]Absence check using 47 positive and 1046 generalized place invariants in 291 ms returned sat
[2022-05-18 05:57:44] [INFO ] After 9977ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-18 05:57:44] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2022-05-18 05:57:56] [INFO ] After 12141ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-05-18 05:57:56] [INFO ] After 12143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-18 05:57:56] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 168 ms.
Support contains 25 out of 4641 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4641/4641 places, 11772/11772 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 1 place count 4641 transition count 11771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4640 transition count 11771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 4640 transition count 11770
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4639 transition count 11770
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 4638 transition count 11769
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 4638 transition count 11769
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 4638 transition count 11769
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 4637 transition count 11768
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 4637 transition count 11768
Applied a total of 10 rules in 1878 ms. Remains 4637 /4641 variables (removed 4) and now considering 11768/11772 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 4637/4641 places, 11768/11772 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 1368 ms. (steps per millisecond=7 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-05-18 05:58:02] [INFO ] Flow matrix only has 10884 transitions (discarded 884 similar events)
// Phase 1: matrix 10884 rows 4637 cols
[2022-05-18 05:58:02] [INFO ] Computed 1093 place invariants in 271 ms
[2022-05-18 05:58:03] [INFO ] [Real]Absence check using 49 positive place invariants in 105 ms returned sat
[2022-05-18 05:58:03] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 273 ms returned sat
[2022-05-18 05:58:14] [INFO ] After 9872ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2022-05-18 05:58:14] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2022-05-18 05:58:15] [INFO ] After 1326ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :1 sat :0 real:8
[2022-05-18 05:58:15] [INFO ] After 13367ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2022-05-18 05:58:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 110 ms returned sat
[2022-05-18 05:58:16] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 270 ms returned sat
[2022-05-18 05:58:26] [INFO ] After 8824ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2022-05-18 05:58:40] [INFO ] After 14412ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2022-05-18 05:58:40] [INFO ] After 14417ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 05:58:40] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 14 out of 4637 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4637/4637 places, 11768/11768 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 1 place count 4637 transition count 11767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4636 transition count 11767
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 4636 transition count 11765
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 4634 transition count 11765
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 4632 transition count 11763
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 4632 transition count 11763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 4632 transition count 11762
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 4631 transition count 11762
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 4631 transition count 11759
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 4628 transition count 11759
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 4627 transition count 11758
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 4627 transition count 11758
Applied a total of 20 rules in 1854 ms. Remains 4627 /4637 variables (removed 10) and now considering 11758/11768 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 4627/4637 places, 11758/11768 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 12512 stabilizing places and 17066 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)&&X(F((F(p1)&&p2)))))))'
Support contains 6 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4788 transitions
Trivial Post-agglo rules discarded 4788 transitions
Performed 4788 trivial Post agglomeration. Transition count delta: 4788
Iterating post reduction 0 with 4788 rules applied. Total rules applied 4788 place count 15136 transition count 17479
Reduce places removed 4788 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9588 place count 10348 transition count 17467
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17068
Deduced a syphon composed of 399 places in 12 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10398 place count 9937 transition count 17068
Discarding 4399 places :
Symmetric choice reduction at 3 with 4399 rule applications. Total rules 14797 place count 5538 transition count 12669
Iterating global reduction 3 with 4399 rules applied. Total rules applied 19196 place count 5538 transition count 12669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 19196 place count 5538 transition count 12654
Deduced a syphon composed of 15 places in 8 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 19226 place count 5523 transition count 12654
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 19773 place count 4976 transition count 8278
Iterating global reduction 3 with 547 rules applied. Total rules applied 20320 place count 4976 transition count 8278
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20370 place count 4951 transition count 8253
Applied a total of 20370 rules in 3073 ms. Remains 4951 /15136 variables (removed 10185) and now considering 8253/22267 (removed 14014) transitions.
[2022-05-18 05:58:46] [INFO ] Flow matrix only has 7653 transitions (discarded 600 similar events)
// Phase 1: matrix 7653 rows 4951 cols
[2022-05-18 05:58:46] [INFO ] Computed 1093 place invariants in 207 ms
[2022-05-18 05:58:51] [INFO ] Implicit Places using invariants in 5587 ms returned []
[2022-05-18 05:58:51] [INFO ] Flow matrix only has 7653 transitions (discarded 600 similar events)
// Phase 1: matrix 7653 rows 4951 cols
[2022-05-18 05:58:52] [INFO ] Computed 1093 place invariants in 201 ms
[2022-05-18 05:58:57] [INFO ] Implicit Places using invariants and state equation in 5636 ms returned []
Implicit Place search using SMT with State Equation took 11252 ms to find 0 implicit places.
[2022-05-18 05:58:58] [INFO ] Redundant transitions in 1005 ms returned []
[2022-05-18 05:58:58] [INFO ] Flow matrix only has 7653 transitions (discarded 600 similar events)
// Phase 1: matrix 7653 rows 4951 cols
[2022-05-18 05:58:58] [INFO ] Computed 1093 place invariants in 202 ms
[2022-05-18 05:59:03] [INFO ] Dead Transitions using invariants and state equation in 5417 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4951/15136 places, 8253/22267 transitions.
Finished structural reductions, in 1 iterations. Remains : 4951/15136 places, 8253/22267 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p0), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1709 1) (GEQ s1806 1)), p0:(AND (GEQ s1956 1) (GEQ s4679 1)), p2:(OR (LT s595 1) (LT s4814 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 7 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-01 finished in 21269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 369 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 05:59:04] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 05:59:06] [INFO ] Computed 1093 place invariants in 1481 ms
[2022-05-18 05:59:07] [INFO ] Implicit Places using invariants in 2859 ms returned []
Implicit Place search using SMT only with invariants took 2870 ms to find 0 implicit places.
[2022-05-18 05:59:07] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 05:59:09] [INFO ] Computed 1093 place invariants in 1526 ms
[2022-05-18 05:59:10] [INFO ] Dead Transitions using invariants and state equation in 2715 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s7127 1) (GEQ s7564 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-02 finished in 6122 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X(p1))||p0))))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 369 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 05:59:10] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 05:59:12] [INFO ] Computed 1093 place invariants in 1494 ms
[2022-05-18 05:59:13] [INFO ] Implicit Places using invariants in 2756 ms returned []
Implicit Place search using SMT only with invariants took 2757 ms to find 0 implicit places.
[2022-05-18 05:59:13] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 05:59:15] [INFO ] Computed 1093 place invariants in 1496 ms
[2022-05-18 05:59:16] [INFO ] Dead Transitions using invariants and state equation in 2731 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(OR (LT s7594 1) (LT s8808 1)), p1:(OR (LT s11813 1) (LT s11874 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 7039 ms.
Product exploration explored 100000 steps with 33333 reset in 6836 ms.
Computed a total of 12512 stabilizing places and 17066 stable transitions
Computed a total of 12512 stabilizing places and 17066 stable transitions
Detected a total of 12512/15136 stabilizing places and 17066/22267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-03 finished in 20106 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(G(p0)))||G(F(p1))||!p1)))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4799 transitions
Trivial Post-agglo rules discarded 4799 transitions
Performed 4799 trivial Post agglomeration. Transition count delta: 4799
Iterating post reduction 0 with 4799 rules applied. Total rules applied 4799 place count 15136 transition count 17468
Reduce places removed 4799 places and 0 transitions.
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17069
Deduced a syphon composed of 399 places in 12 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 10396 place count 9938 transition count 17069
Discarding 4399 places :
Symmetric choice reduction at 2 with 4399 rule applications. Total rules 14795 place count 5539 transition count 12670
Iterating global reduction 2 with 4399 rules applied. Total rules applied 19194 place count 5539 transition count 12670
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 19194 place count 5539 transition count 12655
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 19224 place count 5524 transition count 12655
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19773 place count 4975 transition count 8263
Iterating global reduction 2 with 549 rules applied. Total rules applied 20322 place count 4975 transition count 8263
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20372 place count 4950 transition count 8238
Applied a total of 20372 rules in 2473 ms. Remains 4950 /15136 variables (removed 10186) and now considering 8238/22267 (removed 14029) transitions.
[2022-05-18 05:59:33] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 05:59:33] [INFO ] Computed 1093 place invariants in 218 ms
[2022-05-18 05:59:37] [INFO ] Implicit Places using invariants in 4022 ms returned []
[2022-05-18 05:59:37] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 05:59:37] [INFO ] Computed 1093 place invariants in 208 ms
[2022-05-18 05:59:40] [INFO ] Implicit Places using invariants and state equation in 3712 ms returned []
Implicit Place search using SMT with State Equation took 7739 ms to find 0 implicit places.
[2022-05-18 05:59:41] [INFO ] Redundant transitions in 936 ms returned []
[2022-05-18 05:59:41] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 05:59:41] [INFO ] Computed 1093 place invariants in 206 ms
[2022-05-18 05:59:46] [INFO ] Dead Transitions using invariants and state equation in 5196 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4950/15136 places, 8238/22267 transitions.
Finished structural reductions, in 1 iterations. Remains : 4950/15136 places, 8238/22267 transitions.
Stuttering acceptance computed with spot in 188 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s4522 1), p0:(LT s3121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1726 reset in 1163 ms.
Product exploration explored 100000 steps with 1725 reset in 1187 ms.
Computed a total of 2351 stabilizing places and 3062 stable transitions
Computed a total of 2351 stabilizing places and 3062 stable transitions
Detected a total of 2351/4950 stabilizing places and 3062/8238 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 351 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 :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 172 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 05:59:50] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 05:59:50] [INFO ] Computed 1093 place invariants in 223 ms
[2022-05-18 05:59:51] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2022-05-18 05:59:51] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 307 ms returned sat
[2022-05-18 05:59:51] [INFO ] After 1004ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 05:59:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2022-05-18 05:59:52] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 317 ms returned sat
[2022-05-18 05:59:56] [INFO ] After 4375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 05:59:56] [INFO ] State equation strengthened by 2959 read => feed constraints.
[2022-05-18 05:59:57] [INFO ] After 875ms SMT Verify possible using 2959 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:00:03] [INFO ] Deduced a trap composed of 487 places in 5220 ms of which 7 ms to minimize.
[2022-05-18 06:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6174 ms
[2022-05-18 06:00:04] [INFO ] After 7217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 304 ms.
[2022-05-18 06:00:04] [INFO ] After 12916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4950 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4950/4950 places, 8238/8238 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4950 transition count 11744
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4613 transition count 11744
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 4613 transition count 11744
Applied a total of 699 rules in 1896 ms. Remains 4613 /4950 variables (removed 337) and now considering 11744/8238 (removed -3506) transitions.
Finished structural reductions, in 1 iterations. Remains : 4613/4950 places, 11744/8238 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16287 steps, run visited all 1 properties in 2358 ms. (steps per millisecond=6 )
Probabilistic random walk after 16287 steps, saw 7615 distinct states, run finished after 2358 ms. (steps per millisecond=6 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 430 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 106 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 4950 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4950/4950 places, 8238/8238 transitions.
Applied a total of 0 rules in 458 ms. Remains 4950 /4950 variables (removed 0) and now considering 8238/8238 (removed 0) transitions.
[2022-05-18 06:00:10] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 06:00:10] [INFO ] Computed 1093 place invariants in 227 ms
[2022-05-18 06:00:14] [INFO ] Implicit Places using invariants in 4072 ms returned []
[2022-05-18 06:00:14] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 06:00:14] [INFO ] Computed 1093 place invariants in 212 ms
[2022-05-18 06:00:18] [INFO ] Implicit Places using invariants and state equation in 4267 ms returned []
Implicit Place search using SMT with State Equation took 8343 ms to find 0 implicit places.
[2022-05-18 06:00:19] [INFO ] Redundant transitions in 678 ms returned []
[2022-05-18 06:00:19] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 06:00:19] [INFO ] Computed 1093 place invariants in 216 ms
[2022-05-18 06:00:24] [INFO ] Dead Transitions using invariants and state equation in 5065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4950/4950 places, 8238/8238 transitions.
Computed a total of 2351 stabilizing places and 3062 stable transitions
Computed a total of 2351 stabilizing places and 3062 stable transitions
Detected a total of 2351/4950 stabilizing places and 3062/8238 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 370 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 115 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 172 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:00:25] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 06:00:25] [INFO ] Computed 1093 place invariants in 223 ms
[2022-05-18 06:00:25] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2022-05-18 06:00:26] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 319 ms returned sat
[2022-05-18 06:00:26] [INFO ] After 986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:00:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2022-05-18 06:00:27] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 331 ms returned sat
[2022-05-18 06:00:31] [INFO ] After 4441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:00:31] [INFO ] State equation strengthened by 2959 read => feed constraints.
[2022-05-18 06:00:32] [INFO ] After 870ms SMT Verify possible using 2959 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:00:38] [INFO ] Deduced a trap composed of 487 places in 5161 ms of which 5 ms to minimize.
[2022-05-18 06:00:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6052 ms
[2022-05-18 06:00:38] [INFO ] After 7085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 245 ms.
[2022-05-18 06:00:39] [INFO ] After 12816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 4950 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4950/4950 places, 8238/8238 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 4950 transition count 11744
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 4613 transition count 11744
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 4613 transition count 11744
Applied a total of 699 rules in 1865 ms. Remains 4613 /4950 variables (removed 337) and now considering 11744/8238 (removed -3506) transitions.
Finished structural reductions, in 1 iterations. Remains : 4613/4950 places, 11744/8238 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16287 steps, run visited all 1 properties in 2282 ms. (steps per millisecond=7 )
Probabilistic random walk after 16287 steps, saw 7615 distinct states, run finished after 2282 ms. (steps per millisecond=7 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 9 factoid took 386 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 95 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1727 reset in 1158 ms.
Product exploration explored 100000 steps with 1728 reset in 1190 ms.
Built C files in :
/tmp/ltsmin770489694754472853
[2022-05-18 06:00:46] [INFO ] Too many transitions (8238) to apply POR reductions. Disabling POR matrices.
[2022-05-18 06:00:47] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin770489694754472853
Running compilation step : cd /tmp/ltsmin770489694754472853;'/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/ltsmin770489694754472853;'/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/ltsmin770489694754472853;'/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 4950 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4950/4950 places, 8238/8238 transitions.
Applied a total of 0 rules in 490 ms. Remains 4950 /4950 variables (removed 0) and now considering 8238/8238 (removed 0) transitions.
[2022-05-18 06:00:50] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 06:00:50] [INFO ] Computed 1093 place invariants in 268 ms
[2022-05-18 06:00:58] [INFO ] Implicit Places using invariants in 7803 ms returned []
[2022-05-18 06:00:58] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 06:00:58] [INFO ] Computed 1093 place invariants in 254 ms
[2022-05-18 06:01:04] [INFO ] Implicit Places using invariants and state equation in 6532 ms returned []
Implicit Place search using SMT with State Equation took 14370 ms to find 0 implicit places.
[2022-05-18 06:01:05] [INFO ] Redundant transitions in 702 ms returned []
[2022-05-18 06:01:05] [INFO ] Flow matrix only has 7638 transitions (discarded 600 similar events)
// Phase 1: matrix 7638 rows 4950 cols
[2022-05-18 06:01:05] [INFO ] Computed 1093 place invariants in 267 ms
[2022-05-18 06:01:14] [INFO ] Dead Transitions using invariants and state equation in 8663 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4950/4950 places, 8238/8238 transitions.
Built C files in :
/tmp/ltsmin4282546803799456618
[2022-05-18 06:01:14] [INFO ] Too many transitions (8238) to apply POR reductions. Disabling POR matrices.
[2022-05-18 06:01:14] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4282546803799456618
Running compilation step : cd /tmp/ltsmin4282546803799456618;'/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/ltsmin4282546803799456618;'/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/ltsmin4282546803799456618;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 06:01:19] [INFO ] Flatten gal took : 401 ms
[2022-05-18 06:01:20] [INFO ] Flatten gal took : 494 ms
[2022-05-18 06:01:20] [INFO ] Time to serialize gal into /tmp/LTL10360401952617021454.gal : 127 ms
[2022-05-18 06:01:20] [INFO ] Time to serialize properties into /tmp/LTL1978741108968996477.ltl : 17 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/LTL10360401952617021454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1978741108968996477.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/LTL1036040...267
Read 1 LTL properties
Checking formula 0 : !((G(((X(F(G("(Node19HasTheLeafSetOfRx5ToReplaceNode17<1)"))))||(G(F("(Lx0HasReceivedTheRequestOfNode4>=1)"))))||("(Lx0HasReceivedTheR...176
Formula 0 simplified : !G("(Lx0HasReceivedTheRequestOfNode4<1)" | XFG"(Node19HasTheLeafSetOfRx5ToReplaceNode17<1)" | GF"(Lx0HasReceivedTheRequestOfNode4>=1...158
Detected timeout of ITS tools.
[2022-05-18 06:01:35] [INFO ] Flatten gal took : 313 ms
[2022-05-18 06:01:35] [INFO ] Applying decomposition
[2022-05-18 06:01:36] [INFO ] Flatten gal took : 248 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/graph293776445619587340.txt' '-o' '/tmp/graph293776445619587340.bin' '-w' '/tmp/graph293776445619587340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph293776445619587340.bin' '-l' '-1' '-v' '-w' '/tmp/graph293776445619587340.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:01:37] [INFO ] Decomposing Gal with order
[2022-05-18 06:01:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:01:39] [INFO ] Removed a total of 6979 redundant transitions.
[2022-05-18 06:01:40] [INFO ] Flatten gal took : 2034 ms
[2022-05-18 06:01:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4789 labels/synchronizations in 506 ms.
[2022-05-18 06:01:41] [INFO ] Time to serialize gal into /tmp/LTL18177091719749729927.gal : 87 ms
[2022-05-18 06:01:41] [INFO ] Time to serialize properties into /tmp/LTL11005760088780361597.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/LTL18177091719749729927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11005760088780361597.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/LTL1817709...247
Read 1 LTL properties
Checking formula 0 : !((G(((X(F(G("(i26.u383.Node19HasTheLeafSetOfRx5ToReplaceNode17<1)"))))||(G(F("(i25.u359.Lx0HasReceivedTheRequestOfNode4>=1)"))))||("(...203
Formula 0 simplified : !G("(i25.u359.Lx0HasReceivedTheRequestOfNode4<1)" | XFG"(i26.u383.Node19HasTheLeafSetOfRx5ToReplaceNode17<1)" | GF"(i25.u359.Lx0HasR...185
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3316383060577153508
[2022-05-18 06:01:56] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3316383060577153508
Running compilation step : cd /tmp/ltsmin3316383060577153508;'/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/ltsmin3316383060577153508;'/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/ltsmin3316383060577153508;'/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 MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-04 finished in 148807 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 371 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:01:59] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:02:01] [INFO ] Computed 1093 place invariants in 1582 ms
[2022-05-18 06:02:02] [INFO ] Implicit Places using invariants in 2897 ms returned []
Implicit Place search using SMT only with invariants took 2898 ms to find 0 implicit places.
[2022-05-18 06:02:02] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:02:04] [INFO ] Computed 1093 place invariants in 1591 ms
[2022-05-18 06:02:05] [INFO ] Dead Transitions using invariants and state equation in 2831 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s4103 1) (GEQ s14795 1) (OR (LT s10155 1) (LT s12358 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-05 finished in 6300 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (!G(X(p0))&&p1))))'
Support contains 2 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 427 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:02:06] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:02:07] [INFO ] Computed 1093 place invariants in 1519 ms
[2022-05-18 06:02:08] [INFO ] Implicit Places using invariants in 2754 ms returned []
Implicit Place search using SMT only with invariants took 2756 ms to find 0 implicit places.
[2022-05-18 06:02:08] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:02:10] [INFO ] Computed 1093 place invariants in 1576 ms
[2022-05-18 06:02:11] [INFO ] Dead Transitions using invariants and state equation in 2809 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) p0), p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3728 1) (GEQ s3955 1)), p0:(AND (GEQ s3728 1) (GEQ s3955 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 80 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-06 finished in 6285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((F(X(p0))&&X(G(F(p1))))))))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 390 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:02:12] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:02:13] [INFO ] Computed 1093 place invariants in 1543 ms
[2022-05-18 06:02:15] [INFO ] Implicit Places using invariants in 2918 ms returned []
Implicit Place search using SMT only with invariants took 2919 ms to find 0 implicit places.
[2022-05-18 06:02:15] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:02:16] [INFO ] Computed 1093 place invariants in 1543 ms
[2022-05-18 06:02:18] [INFO ] Dead Transitions using invariants and state equation in 2967 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s8073 1) (GEQ s15012 1)), p0:(OR (LT s3234 1) (LT s3984 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-07 finished in 6654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !(X(p1)||p2)))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 377 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:02:18] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:02:20] [INFO ] Computed 1093 place invariants in 1529 ms
[2022-05-18 06:02:21] [INFO ] Implicit Places using invariants in 2916 ms returned []
Implicit Place search using SMT only with invariants took 2917 ms to find 0 implicit places.
[2022-05-18 06:02:21] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:02:23] [INFO ] Computed 1093 place invariants in 1494 ms
[2022-05-18 06:02:24] [INFO ] Dead Transitions using invariants and state equation in 2875 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR p1 p2), true, p1, (NOT p0), p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s10864 1), p0:(AND (GEQ s8172 1) (GEQ s14741 1)), p1:(AND (GEQ s4138 1) (GEQ s4525 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9803 ms.
Product exploration explored 100000 steps with 50000 reset in 9633 ms.
Computed a total of 12512 stabilizing places and 17066 stable transitions
Computed a total of 12512 stabilizing places and 17066 stable transitions
Detected a total of 12512/15136 stabilizing places and 17066/22267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 25 factoid took 369 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-09 finished in 26306 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))||p1)))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4776 transitions
Trivial Post-agglo rules discarded 4776 transitions
Performed 4776 trivial Post agglomeration. Transition count delta: 4776
Iterating post reduction 0 with 4776 rules applied. Total rules applied 4776 place count 15136 transition count 17491
Reduce places removed 4776 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9576 place count 10360 transition count 17467
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17069
Deduced a syphon composed of 398 places in 13 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 10396 place count 9938 transition count 17069
Discarding 4398 places :
Symmetric choice reduction at 3 with 4398 rule applications. Total rules 14794 place count 5540 transition count 12671
Iterating global reduction 3 with 4398 rules applied. Total rules applied 19192 place count 5540 transition count 12671
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 19192 place count 5540 transition count 12657
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 19220 place count 5526 transition count 12657
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 19768 place count 4978 transition count 8273
Iterating global reduction 3 with 548 rules applied. Total rules applied 20316 place count 4978 transition count 8273
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20366 place count 4953 transition count 8248
Applied a total of 20366 rules in 2494 ms. Remains 4953 /15136 variables (removed 10183) and now considering 8248/22267 (removed 14019) transitions.
[2022-05-18 06:02:47] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:02:47] [INFO ] Computed 1093 place invariants in 207 ms
[2022-05-18 06:02:52] [INFO ] Implicit Places using invariants in 5373 ms returned []
[2022-05-18 06:02:52] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:02:52] [INFO ] Computed 1093 place invariants in 212 ms
[2022-05-18 06:02:57] [INFO ] Implicit Places using invariants and state equation in 5171 ms returned []
Implicit Place search using SMT with State Equation took 10548 ms to find 0 implicit places.
[2022-05-18 06:02:58] [INFO ] Redundant transitions in 676 ms returned []
[2022-05-18 06:02:58] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:02:58] [INFO ] Computed 1093 place invariants in 205 ms
[2022-05-18 06:03:04] [INFO ] Dead Transitions using invariants and state equation in 5441 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4953/15136 places, 8248/22267 transitions.
Finished structural reductions, in 1 iterations. Remains : 4953/15136 places, 8248/22267 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2104 1) (LT s2113 1)), p1:(AND (GEQ s2330 1) (GEQ s2385 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1682 reset in 1283 ms.
Product exploration explored 100000 steps with 1679 reset in 1303 ms.
Computed a total of 2354 stabilizing places and 3072 stable transitions
Computed a total of 2354 stabilizing places and 3072 stable transitions
Detected a total of 2354/4953 stabilizing places and 3072/8248 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 4473 steps, including 75 resets, run visited all 2 properties in 100 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 4953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4953/4953 places, 8248/8248 transitions.
Applied a total of 0 rules in 508 ms. Remains 4953 /4953 variables (removed 0) and now considering 8248/8248 (removed 0) transitions.
[2022-05-18 06:03:08] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:03:08] [INFO ] Computed 1093 place invariants in 211 ms
[2022-05-18 06:03:13] [INFO ] Implicit Places using invariants in 5320 ms returned []
[2022-05-18 06:03:13] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:03:13] [INFO ] Computed 1093 place invariants in 226 ms
[2022-05-18 06:03:18] [INFO ] Implicit Places using invariants and state equation in 5413 ms returned []
Implicit Place search using SMT with State Equation took 10736 ms to find 0 implicit places.
[2022-05-18 06:03:19] [INFO ] Redundant transitions in 678 ms returned []
[2022-05-18 06:03:19] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:03:19] [INFO ] Computed 1093 place invariants in 212 ms
[2022-05-18 06:03:25] [INFO ] Dead Transitions using invariants and state equation in 5533 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4953/4953 places, 8248/8248 transitions.
Computed a total of 2354 stabilizing places and 3072 stable transitions
Computed a total of 2354 stabilizing places and 3072 stable transitions
Detected a total of 2354/4953 stabilizing places and 3072/8248 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 167 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 22474 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22474 steps, saw 10596 distinct states, run finished after 3003 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 06:03:28] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:03:28] [INFO ] Computed 1093 place invariants in 206 ms
[2022-05-18 06:03:29] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2022-05-18 06:03:29] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 320 ms returned sat
[2022-05-18 06:03:34] [INFO ] After 4596ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-18 06:03:34] [INFO ] State equation strengthened by 2966 read => feed constraints.
[2022-05-18 06:03:35] [INFO ] After 512ms SMT Verify possible using 2966 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 06:03:35] [INFO ] After 6288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 06:03:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2022-05-18 06:03:36] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 297 ms returned sat
[2022-05-18 06:03:40] [INFO ] After 4657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 06:03:41] [INFO ] After 837ms SMT Verify possible using 2966 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 06:03:47] [INFO ] Deduced a trap composed of 263 places in 5315 ms of which 5 ms to minimize.
[2022-05-18 06:03:53] [INFO ] Deduced a trap composed of 307 places in 5174 ms of which 5 ms to minimize.
[2022-05-18 06:03:58] [INFO ] Deduced a trap composed of 407 places in 5115 ms of which 5 ms to minimize.
[2022-05-18 06:04:04] [INFO ] Deduced a trap composed of 488 places in 5148 ms of which 4 ms to minimize.
[2022-05-18 06:04:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 06:04:04] [INFO ] After 29219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 4953 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4953/4953 places, 8248/8248 transitions.
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 0 with 338 rules applied. Total rules applied 338 place count 4953 transition count 11746
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 676 place count 4615 transition count 11746
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 724 place count 4615 transition count 11746
Applied a total of 724 rules in 1831 ms. Remains 4615 /4953 variables (removed 338) and now considering 11746/8248 (removed -3498) transitions.
Finished structural reductions, in 1 iterations. Remains : 4615/4953 places, 11746/8248 transitions.
Finished random walk after 808 steps, including 16 resets, run visited all 2 properties in 45 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 504 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1683 reset in 1223 ms.
Product exploration explored 100000 steps with 1680 reset in 1242 ms.
Built C files in :
/tmp/ltsmin9093182046199143247
[2022-05-18 06:04:09] [INFO ] Too many transitions (8248) to apply POR reductions. Disabling POR matrices.
[2022-05-18 06:04:09] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9093182046199143247
Running compilation step : cd /tmp/ltsmin9093182046199143247;'/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/ltsmin9093182046199143247;'/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/ltsmin9093182046199143247;'/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 4953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4953/4953 places, 8248/8248 transitions.
Applied a total of 0 rules in 475 ms. Remains 4953 /4953 variables (removed 0) and now considering 8248/8248 (removed 0) transitions.
[2022-05-18 06:04:13] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:04:13] [INFO ] Computed 1093 place invariants in 205 ms
[2022-05-18 06:04:18] [INFO ] Implicit Places using invariants in 5209 ms returned []
[2022-05-18 06:04:18] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:04:18] [INFO ] Computed 1093 place invariants in 202 ms
[2022-05-18 06:04:23] [INFO ] Implicit Places using invariants and state equation in 5110 ms returned []
Implicit Place search using SMT with State Equation took 10322 ms to find 0 implicit places.
[2022-05-18 06:04:24] [INFO ] Redundant transitions in 686 ms returned []
[2022-05-18 06:04:24] [INFO ] Flow matrix only has 7648 transitions (discarded 600 similar events)
// Phase 1: matrix 7648 rows 4953 cols
[2022-05-18 06:04:24] [INFO ] Computed 1093 place invariants in 207 ms
[2022-05-18 06:04:29] [INFO ] Dead Transitions using invariants and state equation in 5349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4953/4953 places, 8248/8248 transitions.
Built C files in :
/tmp/ltsmin6096956818660558048
[2022-05-18 06:04:29] [INFO ] Too many transitions (8248) to apply POR reductions. Disabling POR matrices.
[2022-05-18 06:04:29] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6096956818660558048
Running compilation step : cd /tmp/ltsmin6096956818660558048;'/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/ltsmin6096956818660558048;'/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/ltsmin6096956818660558048;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 06:04:33] [INFO ] Flatten gal took : 252 ms
[2022-05-18 06:04:33] [INFO ] Flatten gal took : 336 ms
[2022-05-18 06:04:33] [INFO ] Time to serialize gal into /tmp/LTL16606553631316166900.gal : 53 ms
[2022-05-18 06:04:33] [INFO ] Time to serialize properties into /tmp/LTL9386309684056814040.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/LTL16606553631316166900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9386309684056814040.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/LTL1660655...267
Read 1 LTL properties
Checking formula 0 : !((F((F(G("((Node10HasAskedItsLeafSetToRx1ToReplaceNode22<1)||(LeafSetOfRx1IsSentToNode10<1))")))||("((Node13HasAskedItsLeafSetToLx3To...210
Formula 0 simplified : !F("((Node13HasAskedItsLeafSetToLx3ToReplaceNode4>=1)&&(LeafSetOfLx3IsSentToNode13>=1))" | FG"((Node10HasAskedItsLeafSetToRx1ToRepla...201
Detected timeout of ITS tools.
[2022-05-18 06:04:48] [INFO ] Flatten gal took : 251 ms
[2022-05-18 06:04:48] [INFO ] Applying decomposition
[2022-05-18 06:04:49] [INFO ] Flatten gal took : 268 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/graph17385948380261687384.txt' '-o' '/tmp/graph17385948380261687384.bin' '-w' '/tmp/graph17385948380261687384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17385948380261687384.bin' '-l' '-1' '-v' '-w' '/tmp/graph17385948380261687384.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:04:49] [INFO ] Decomposing Gal with order
[2022-05-18 06:04:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:04:51] [INFO ] Removed a total of 6764 redundant transitions.
[2022-05-18 06:04:52] [INFO ] Flatten gal took : 1452 ms
[2022-05-18 06:04:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 5110 labels/synchronizations in 410 ms.
[2022-05-18 06:04:52] [INFO ] Time to serialize gal into /tmp/LTL8717541743938086899.gal : 78 ms
[2022-05-18 06:04:52] [INFO ] Time to serialize properties into /tmp/LTL9802089703580551006.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/LTL8717541743938086899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9802089703580551006.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/LTL8717541...245
Read 1 LTL properties
Checking formula 0 : !((F((F(G("((i22.u388.Node10HasAskedItsLeafSetToRx1ToReplaceNode22<1)||(i22.u377.LeafSetOfRx1IsSentToNode10<1))")))||("((i9.u181.Node1...244
Formula 0 simplified : !F("((i9.u181.Node13HasAskedItsLeafSetToLx3ToReplaceNode4>=1)&&(i9.u362.LeafSetOfLx3IsSentToNode13>=1))" | FG"((i22.u388.Node10HasAs...235
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9265683669378406433
[2022-05-18 06:05:07] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9265683669378406433
Running compilation step : cd /tmp/ltsmin9265683669378406433;'/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/ltsmin9265683669378406433;'/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/ltsmin9265683669378406433;'/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 MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-10 finished in 146081 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X((X(p1)&&p0)))||G(G(p2)))))'
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 449 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:05:11] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:05:12] [INFO ] Computed 1093 place invariants in 1495 ms
[2022-05-18 06:05:14] [INFO ] Implicit Places using invariants in 2869 ms returned []
Implicit Place search using SMT only with invariants took 2877 ms to find 0 implicit places.
[2022-05-18 06:05:14] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:05:15] [INFO ] Computed 1093 place invariants in 1639 ms
[2022-05-18 06:05:17] [INFO ] Dead Transitions using invariants and state equation in 2892 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=5 dest: 5}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=1, aps=[p2:(LT s3057 1), p0:(AND (GEQ s6185 1) (GEQ s14714 1)), p1:(AND (GEQ s9135 1) (GEQ s9604 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1216 reset in 1733 ms.
Product exploration explored 100000 steps with 1217 reset in 1754 ms.
Computed a total of 12512 stabilizing places and 17066 stable transitions
Computed a total of 12512 stabilizing places and 17066 stable transitions
Detected a total of 12512/15136 stabilizing places and 17066/22267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 781 ms. Reduced automaton from 7 states, 17 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 649 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 11255 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 11255 steps, saw 5604 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:05:25] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:05:27] [INFO ] Computed 1093 place invariants in 1509 ms
[2022-05-18 06:05:29] [INFO ] [Real]Absence check using 47 positive place invariants in 147 ms returned sat
[2022-05-18 06:05:29] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 580 ms returned sat
[2022-05-18 06:05:52] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4799 transitions
Trivial Post-agglo rules discarded 4799 transitions
Performed 4799 trivial Post agglomeration. Transition count delta: 4799
Iterating post reduction 0 with 4799 rules applied. Total rules applied 4799 place count 15136 transition count 17468
Reduce places removed 4799 places and 0 transitions.
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17068
Deduced a syphon composed of 400 places in 12 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10398 place count 9937 transition count 17068
Discarding 4399 places :
Symmetric choice reduction at 2 with 4399 rule applications. Total rules 14797 place count 5538 transition count 12669
Iterating global reduction 2 with 4399 rules applied. Total rules applied 19196 place count 5538 transition count 12669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 19196 place count 5538 transition count 12654
Deduced a syphon composed of 15 places in 9 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 19226 place count 5523 transition count 12654
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19775 place count 4974 transition count 8262
Iterating global reduction 2 with 549 rules applied. Total rules applied 20324 place count 4974 transition count 8262
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20374 place count 4949 transition count 8237
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 20711 place count 4949 transition count 11743
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 21048 place count 4612 transition count 11743
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 21073 place count 4612 transition count 11743
Applied a total of 21073 rules in 3755 ms. Remains 4612 /15136 variables (removed 10524) and now considering 11743/22267 (removed 10524) transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/15136 places, 11743/22267 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21192 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21192 steps, saw 9812 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:05:59] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:06:00] [INFO ] Computed 1093 place invariants in 294 ms
[2022-05-18 06:06:00] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-18 06:06:00] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 296 ms returned sat
[2022-05-18 06:06:06] [INFO ] After 5565ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 06:06:06] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2022-05-18 06:06:07] [INFO ] After 1161ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:06:07] [INFO ] After 7723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:06:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 63 ms returned sat
[2022-05-18 06:06:08] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 261 ms returned sat
[2022-05-18 06:06:14] [INFO ] After 5408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:06:16] [INFO ] After 2344ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:06:22] [INFO ] Deduced a trap composed of 546 places in 5898 ms of which 5 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Deduced a trap composed of 371 places in 5818 ms of which 5 ms to minimize.
[2022-05-18 06:06:32] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 16330 ms
[2022-05-18 06:06:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 06:06:32] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 4612 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 638 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4612 places, 11743/11743 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 622 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
[2022-05-18 06:06:34] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:06:34] [INFO ] Computed 1093 place invariants in 267 ms
[2022-05-18 06:06:38] [INFO ] Implicit Places using invariants in 4517 ms returned []
Implicit Place search using SMT only with invariants took 4517 ms to find 0 implicit places.
[2022-05-18 06:06:38] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:06:38] [INFO ] Computed 1093 place invariants in 285 ms
[2022-05-18 06:06:45] [INFO ] Dead Transitions using invariants and state equation in 6997 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4612 places, 11743/11743 transitions.
Graph (trivial) has 3429 edges and 4612 vertex of which 25 / 4612 are part of one of the 1 SCC in 6 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 39926 edges and 4588 vertex of which 4566 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t9361.t11089 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4180 transition count 10014
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3938 transition count 9533
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3697 transition count 9093
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3457 transition count 8695
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3257 transition count 8335
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3059 transition count 8013
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2897 transition count 7725
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2737 transition count 7471
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2609 transition count 7247
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2483 transition count 7053
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2385 transition count 6885
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2289 transition count 6743
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2217 transition count 6623
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2147 transition count 6525
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2097 transition count 6445
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2049 transition count 6383
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2017 transition count 6335
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1987 transition count 6301
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1969 transition count 6277
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1953 transition count 6263
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1945 transition count 6255
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1938 transition count 6253
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1936 transition count 6253
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 400 Pre rules applied. Total rules applied 6250 place count 1936 transition count 5853
Deduced a syphon composed of 400 places in 1 ms
Ensure Unique test removed 399 places
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 23 with 1199 rules applied. Total rules applied 7449 place count 1137 transition count 5853
Discarding 407 places :
Symmetric choice reduction at 23 with 407 rule applications. Total rules 7856 place count 730 transition count 5446
Iterating global reduction 23 with 407 rules applied. Total rules applied 8263 place count 730 transition count 5446
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8263 place count 730 transition count 5445
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8265 place count 729 transition count 5445
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 8805 place count 189 transition count 1125
Iterating global reduction 23 with 540 rules applied. Total rules applied 9345 place count 189 transition count 1125
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 9885 place count 189 transition count 585
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9936 place count 163 transition count 560
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 24 with 16 rules applied. Total rules applied 9952 place count 163 transition count 544
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 24 with 16 rules applied. Total rules applied 9968 place count 147 transition count 544
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9990 place count 125 transition count 368
Ensure Unique test removed 12 places
Iterating global reduction 25 with 34 rules applied. Total rules applied 10024 place count 113 transition count 368
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10046 place count 113 transition count 346
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10057 place count 102 transition count 258
Iterating global reduction 26 with 11 rules applied. Total rules applied 10068 place count 102 transition count 258
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10079 place count 91 transition count 247
Iterating global reduction 26 with 11 rules applied. Total rules applied 10090 place count 91 transition count 247
Applied a total of 10090 rules in 7429 ms. Remains 91 /4612 variables (removed 4521) and now considering 247/11743 (removed 11496) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 247 rows 91 cols
[2022-05-18 06:06:53] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-18 06:06:53] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 06:06:53] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-18 06:06:53] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:06:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 06:06:53] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-18 06:06:53] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:06:53] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 06:06:53] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:06:53] [INFO ] Flatten gal took : 15 ms
[2022-05-18 06:06:53] [INFO ] Flatten gal took : 13 ms
[2022-05-18 06:06:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4933585422776834260.gal : 2 ms
[2022-05-18 06:06:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9612463419085984299.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17881930278197076451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4933585422776834260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9612463419085984299.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9612463419085984299.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 111
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :111 after 138
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :138 after 401
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :401 after 975
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :975 after 3318
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3318 after 27231
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :27231 after 44158
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,415106,4.64831,110208,2,57058,16,168960,7,0,583,370143,0
Total reachable state count : 415106
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,11968,4.65667,110208,2,2544,16,168960,7,0,585,370143,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 533 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 15136 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 344 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:06:59] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:07:00] [INFO ] Computed 1093 place invariants in 1597 ms
[2022-05-18 06:07:02] [INFO ] Implicit Places using invariants in 2949 ms returned []
Implicit Place search using SMT only with invariants took 2950 ms to find 0 implicit places.
[2022-05-18 06:07:02] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:07:03] [INFO ] Computed 1093 place invariants in 1537 ms
[2022-05-18 06:07:04] [INFO ] Dead Transitions using invariants and state equation in 2906 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Computed a total of 12512 stabilizing places and 17066 stable transitions
Computed a total of 12512 stabilizing places and 17066 stable transitions
Detected a total of 12512/15136 stabilizing places and 17066/22267 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p2, (X p2), true, (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 121 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 11216 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 11216 steps, saw 5586 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:07:08] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:07:10] [INFO ] Computed 1093 place invariants in 1580 ms
[2022-05-18 06:07:12] [INFO ] [Real]Absence check using 47 positive place invariants in 157 ms returned sat
[2022-05-18 06:07:12] [INFO ] [Real]Absence check using 47 positive and 1046 generalized place invariants in 608 ms returned sat
[2022-05-18 06:07:35] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4799 transitions
Trivial Post-agglo rules discarded 4799 transitions
Performed 4799 trivial Post agglomeration. Transition count delta: 4799
Iterating post reduction 0 with 4799 rules applied. Total rules applied 4799 place count 15136 transition count 17468
Reduce places removed 4799 places and 0 transitions.
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17068
Deduced a syphon composed of 400 places in 13 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 10398 place count 9937 transition count 17068
Discarding 4399 places :
Symmetric choice reduction at 2 with 4399 rule applications. Total rules 14797 place count 5538 transition count 12669
Iterating global reduction 2 with 4399 rules applied. Total rules applied 19196 place count 5538 transition count 12669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 19196 place count 5538 transition count 12654
Deduced a syphon composed of 15 places in 9 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 19226 place count 5523 transition count 12654
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 19775 place count 4974 transition count 8262
Iterating global reduction 2 with 549 rules applied. Total rules applied 20324 place count 4974 transition count 8262
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 20374 place count 4949 transition count 8237
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 2 with 337 rules applied. Total rules applied 20711 place count 4949 transition count 11743
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 2 with 337 rules applied. Total rules applied 21048 place count 4612 transition count 11743
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 21073 place count 4612 transition count 11743
Applied a total of 21073 rules in 3965 ms. Remains 4612 /15136 variables (removed 10524) and now considering 11743/22267 (removed 10524) transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/15136 places, 11743/22267 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21432 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21432 steps, saw 9914 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:07:42] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:07:43] [INFO ] Computed 1093 place invariants in 318 ms
[2022-05-18 06:07:43] [INFO ] [Real]Absence check using 49 positive place invariants in 66 ms returned sat
[2022-05-18 06:07:43] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 291 ms returned sat
[2022-05-18 06:07:49] [INFO ] After 5664ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 06:07:49] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2022-05-18 06:07:50] [INFO ] After 1160ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:07:50] [INFO ] After 7789ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:07:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2022-05-18 06:07:51] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 296 ms returned sat
[2022-05-18 06:07:57] [INFO ] After 5837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:08:00] [INFO ] After 2393ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:08:06] [INFO ] Deduced a trap composed of 546 places in 6009 ms of which 4 ms to minimize.
[2022-05-18 06:08:16] [INFO ] Deduced a trap composed of 371 places in 6013 ms of which 5 ms to minimize.
[2022-05-18 06:08:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 06:08:16] [INFO ] After 25158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 4612 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 685 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4612 places, 11743/11743 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 683 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
[2022-05-18 06:08:17] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:08:17] [INFO ] Computed 1093 place invariants in 284 ms
[2022-05-18 06:08:22] [INFO ] Implicit Places using invariants in 4601 ms returned []
Implicit Place search using SMT only with invariants took 4606 ms to find 0 implicit places.
[2022-05-18 06:08:22] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:08:22] [INFO ] Computed 1093 place invariants in 269 ms
[2022-05-18 06:08:28] [INFO ] Dead Transitions using invariants and state equation in 6718 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4612 places, 11743/11743 transitions.
Graph (trivial) has 3429 edges and 4612 vertex of which 25 / 4612 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 39926 edges and 4588 vertex of which 4566 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t9361.t11089 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4180 transition count 10014
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3938 transition count 9533
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3697 transition count 9093
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3457 transition count 8695
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3257 transition count 8335
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3059 transition count 8013
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2897 transition count 7725
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2737 transition count 7471
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2609 transition count 7247
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2483 transition count 7053
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2385 transition count 6885
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2289 transition count 6743
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2217 transition count 6623
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2147 transition count 6525
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2097 transition count 6445
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2049 transition count 6383
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2017 transition count 6335
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1987 transition count 6301
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1969 transition count 6277
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1953 transition count 6263
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1945 transition count 6255
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1938 transition count 6253
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1936 transition count 6253
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 400 Pre rules applied. Total rules applied 6250 place count 1936 transition count 5853
Deduced a syphon composed of 400 places in 2 ms
Ensure Unique test removed 399 places
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 23 with 1199 rules applied. Total rules applied 7449 place count 1137 transition count 5853
Discarding 407 places :
Symmetric choice reduction at 23 with 407 rule applications. Total rules 7856 place count 730 transition count 5446
Iterating global reduction 23 with 407 rules applied. Total rules applied 8263 place count 730 transition count 5446
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8263 place count 730 transition count 5445
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8265 place count 729 transition count 5445
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 8805 place count 189 transition count 1125
Iterating global reduction 23 with 540 rules applied. Total rules applied 9345 place count 189 transition count 1125
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 9885 place count 189 transition count 585
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9936 place count 163 transition count 560
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 24 with 16 rules applied. Total rules applied 9952 place count 163 transition count 544
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 24 with 16 rules applied. Total rules applied 9968 place count 147 transition count 544
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9990 place count 125 transition count 368
Ensure Unique test removed 12 places
Iterating global reduction 25 with 34 rules applied. Total rules applied 10024 place count 113 transition count 368
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10046 place count 113 transition count 346
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10057 place count 102 transition count 258
Iterating global reduction 26 with 11 rules applied. Total rules applied 10068 place count 102 transition count 258
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10079 place count 91 transition count 247
Iterating global reduction 26 with 11 rules applied. Total rules applied 10090 place count 91 transition count 247
Applied a total of 10090 rules in 7267 ms. Remains 91 /4612 variables (removed 4521) and now considering 247/11743 (removed 11496) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 247 rows 91 cols
[2022-05-18 06:08:36] [INFO ] Computed 31 place invariants in 5 ms
[2022-05-18 06:08:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 06:08:36] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-18 06:08:36] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:08:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 06:08:36] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2022-05-18 06:08:36] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:08:36] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-18 06:08:36] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:08:36] [INFO ] Flatten gal took : 16 ms
[2022-05-18 06:08:36] [INFO ] Flatten gal took : 13 ms
[2022-05-18 06:08:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8880381006192484881.gal : 2 ms
[2022-05-18 06:08:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11720619747808833216.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10679584865054712432;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8880381006192484881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11720619747808833216.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11720619747808833216.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 111
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :111 after 138
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :138 after 401
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :401 after 975
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :975 after 3318
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3318 after 27231
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :27231 after 44158
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,415106,4.64167,109984,2,57058,16,168960,7,0,583,370143,0
Total reachable state count : 415106
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,11968,4.64726,109984,2,2544,16,168960,7,0,585,370143,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p2, (X p2), true, (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1215 reset in 1725 ms.
Product exploration explored 100000 steps with 1217 reset in 1766 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Performed 4799 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4799 rules applied. Total rules applied 4799 place count 15136 transition count 22267
Performed 425 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5224 places in 12 ms
Iterating global reduction 1 with 425 rules applied. Total rules applied 5224 place count 15136 transition count 22267
Deduced a syphon composed of 5224 places in 13 ms
Applied a total of 5224 rules in 3438 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:08:48] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:08:50] [INFO ] Computed 1093 place invariants in 1631 ms
[2022-05-18 06:08:51] [INFO ] Dead Transitions using invariants and state equation in 2997 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15136/15136 places, 22267/22267 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Product exploration explored 100000 steps with 1519 reset in 3853 ms.
Product exploration explored 100000 steps with 1520 reset in 3853 ms.
Built C files in :
/tmp/ltsmin4972202730634723278
[2022-05-18 06:08:59] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4972202730634723278
Running compilation step : cd /tmp/ltsmin4972202730634723278;'/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/ltsmin4972202730634723278;'/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/ltsmin4972202730634723278;'/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 1 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 427 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:09:02] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:09:04] [INFO ] Computed 1093 place invariants in 1537 ms
[2022-05-18 06:09:05] [INFO ] Implicit Places using invariants in 2800 ms returned []
Implicit Place search using SMT only with invariants took 2804 ms to find 0 implicit places.
[2022-05-18 06:09:05] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:09:07] [INFO ] Computed 1093 place invariants in 1565 ms
[2022-05-18 06:09:08] [INFO ] Dead Transitions using invariants and state equation in 2982 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Built C files in :
/tmp/ltsmin9914492143574959296
[2022-05-18 06:09:08] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9914492143574959296
Running compilation step : cd /tmp/ltsmin9914492143574959296;'/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/ltsmin9914492143574959296;'/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/ltsmin9914492143574959296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 06:09:13] [INFO ] Flatten gal took : 641 ms
[2022-05-18 06:09:13] [INFO ] Flatten gal took : 681 ms
[2022-05-18 06:09:13] [INFO ] Time to serialize gal into /tmp/LTL14499190860121330002.gal : 116 ms
[2022-05-18 06:09:13] [INFO ] Time to serialize properties into /tmp/LTL9614433816042397530.ltl : 10 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/LTL14499190860121330002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9614433816042397530.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/LTL1449919...267
Read 1 LTL properties
Checking formula 0 : !((G((G(X(((X("((Node16HasAskedItsLeafSetToLx5ToReplaceNode1>=1)&&(LeafSetOfLx5IsSentToNode16>=1))"))&&("(Node10ManageTheCrashOfNode4>...267
Formula 0 simplified : !G(GX("(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1)" & "(Node10ManageTheCrashOfNode4>=1)" & X"((Node16HasAskedItsLeafSetToLx5ToReplaceNo...247
Detected timeout of ITS tools.
[2022-05-18 06:09:29] [INFO ] Flatten gal took : 619 ms
[2022-05-18 06:09:29] [INFO ] Applying decomposition
[2022-05-18 06:09:30] [INFO ] Flatten gal took : 694 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/graph920379560313318189.txt' '-o' '/tmp/graph920379560313318189.bin' '-w' '/tmp/graph920379560313318189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph920379560313318189.bin' '-l' '-1' '-v' '-w' '/tmp/graph920379560313318189.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:09:31] [INFO ] Decomposing Gal with order
[2022-05-18 06:09:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:09:36] [INFO ] Removed a total of 14388 redundant transitions.
[2022-05-18 06:09:37] [INFO ] Flatten gal took : 2796 ms
[2022-05-18 06:09:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2221 labels/synchronizations in 485 ms.
[2022-05-18 06:09:37] [INFO ] Time to serialize gal into /tmp/LTL10404448531574609534.gal : 88 ms
[2022-05-18 06:09:37] [INFO ] Time to serialize properties into /tmp/LTL133302690370354401.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/LTL10404448531574609534.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL133302690370354401.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/LTL1040444...245
Read 1 LTL properties
Checking formula 0 : !((G((G(X(((X("((i12.u401.Node16HasAskedItsLeafSetToLx5ToReplaceNode1>=1)&&(i12.u401.LeafSetOfLx5IsSentToNode16>=1))"))&&("(i5.u6.Node...307
Formula 0 simplified : !G(GX("(i4.u381.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1)" & "(i5.u6.Node10ManageTheCrashOfNode4>=1)" & X"((i12.u401.Node16HasAskedIts...287
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12862190223551571621
[2022-05-18 06:09:53] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12862190223551571621
Running compilation step : cd /tmp/ltsmin12862190223551571621;'/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/ltsmin12862190223551571621;'/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/ltsmin12862190223551571621;'/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 MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 finished in 285133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 427 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:09:56] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:09:58] [INFO ] Computed 1093 place invariants in 1638 ms
[2022-05-18 06:09:59] [INFO ] Implicit Places using invariants in 2764 ms returned []
Implicit Place search using SMT only with invariants took 2764 ms to find 0 implicit places.
[2022-05-18 06:09:59] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:10:00] [INFO ] Computed 1093 place invariants in 1635 ms
[2022-05-18 06:10:02] [INFO ] Dead Transitions using invariants and state equation in 2734 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12 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=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s760 1) (GEQ s2154 1)), p1:(OR (LT s9978 1) (LT s10138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-12 finished in 6089 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 15136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4788 transitions
Trivial Post-agglo rules discarded 4788 transitions
Performed 4788 trivial Post agglomeration. Transition count delta: 4788
Iterating post reduction 0 with 4788 rules applied. Total rules applied 4788 place count 15136 transition count 17479
Reduce places removed 4788 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 4800 rules applied. Total rules applied 9588 place count 10348 transition count 17467
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 9600 place count 10336 transition count 17467
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 9600 place count 10336 transition count 17068
Deduced a syphon composed of 399 places in 13 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10398 place count 9937 transition count 17068
Discarding 4399 places :
Symmetric choice reduction at 3 with 4399 rule applications. Total rules 14797 place count 5538 transition count 12669
Iterating global reduction 3 with 4399 rules applied. Total rules applied 19196 place count 5538 transition count 12669
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 19196 place count 5538 transition count 12654
Deduced a syphon composed of 15 places in 8 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 19226 place count 5523 transition count 12654
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 19775 place count 4974 transition count 8262
Iterating global reduction 3 with 549 rules applied. Total rules applied 20324 place count 4974 transition count 8262
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20374 place count 4949 transition count 8237
Applied a total of 20374 rules in 2927 ms. Remains 4949 /15136 variables (removed 10187) and now considering 8237/22267 (removed 14030) transitions.
[2022-05-18 06:10:05] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2022-05-18 06:10:05] [INFO ] Computed 1093 place invariants in 270 ms
[2022-05-18 06:10:08] [INFO ] Implicit Places using invariants in 3466 ms returned []
[2022-05-18 06:10:08] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2022-05-18 06:10:08] [INFO ] Computed 1093 place invariants in 201 ms
[2022-05-18 06:10:11] [INFO ] Implicit Places using invariants and state equation in 3363 ms returned []
Implicit Place search using SMT with State Equation took 6830 ms to find 0 implicit places.
[2022-05-18 06:10:12] [INFO ] Redundant transitions in 682 ms returned []
[2022-05-18 06:10:12] [INFO ] Flow matrix only has 7637 transitions (discarded 600 similar events)
// Phase 1: matrix 7637 rows 4949 cols
[2022-05-18 06:10:12] [INFO ] Computed 1093 place invariants in 203 ms
[2022-05-18 06:10:16] [INFO ] Dead Transitions using invariants and state equation in 4323 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4949/15136 places, 8237/22267 transitions.
Finished structural reductions, in 1 iterations. Remains : 4949/15136 places, 8237/22267 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2810 1) (GEQ s2825 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-14 finished in 14829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U G(X(G(p1))))&&F(p2)))'
Support contains 4 out of 15136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Applied a total of 0 rules in 462 ms. Remains 15136 /15136 variables (removed 0) and now considering 22267/22267 (removed 0) transitions.
[2022-05-18 06:10:17] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:10:19] [INFO ] Computed 1093 place invariants in 1542 ms
[2022-05-18 06:10:20] [INFO ] Implicit Places using invariants in 2646 ms returned []
Implicit Place search using SMT only with invariants took 2647 ms to find 0 implicit places.
[2022-05-18 06:10:20] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15136 cols
[2022-05-18 06:10:21] [INFO ] Computed 1093 place invariants in 1527 ms
[2022-05-18 06:10:22] [INFO ] Dead Transitions using invariants and state equation in 2621 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15136/15136 places, 22267/22267 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (AND p0 p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s12705 1) (GEQ s15024 1)), p2:(GEQ s15024 1), p1:(AND (GEQ s3860 1) (GEQ s3959 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-15 finished in 6021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(G(p0)))||G(F(p1))||!p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))||p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X((X(p1)&&p0)))||G(G(p2)))))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11
Stuttering acceptance computed with spot in 190 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 5 out of 15136 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 15136/15136 places, 22267/22267 transitions.
Drop transitions removed 4787 transitions
Trivial Post-agglo rules discarded 4787 transitions
Performed 4787 trivial Post agglomeration. Transition count delta: 4787
Iterating post reduction 0 with 4787 rules applied. Total rules applied 4787 place count 15136 transition count 17480
Reduce places removed 4787 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 4799 rules applied. Total rules applied 9586 place count 10349 transition count 17468
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 9598 place count 10337 transition count 17468
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 9598 place count 10337 transition count 17069
Deduced a syphon composed of 399 places in 16 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10396 place count 9938 transition count 17069
Discarding 4398 places :
Symmetric choice reduction at 3 with 4398 rule applications. Total rules 14794 place count 5540 transition count 12671
Iterating global reduction 3 with 4398 rules applied. Total rules applied 19192 place count 5540 transition count 12671
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 19192 place count 5540 transition count 12657
Deduced a syphon composed of 14 places in 10 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 19220 place count 5526 transition count 12657
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 19767 place count 4979 transition count 8281
Iterating global reduction 3 with 547 rules applied. Total rules applied 20314 place count 4979 transition count 8281
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20364 place count 4954 transition count 8256
Applied a total of 20364 rules in 2714 ms. Remains 4954 /15136 variables (removed 10182) and now considering 8256/22267 (removed 14011) transitions.
[2022-05-18 06:10:26] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2022-05-18 06:10:26] [INFO ] Computed 1093 place invariants in 213 ms
[2022-05-18 06:10:29] [INFO ] Implicit Places using invariants in 3526 ms returned []
[2022-05-18 06:10:29] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2022-05-18 06:10:29] [INFO ] Computed 1093 place invariants in 213 ms
[2022-05-18 06:10:33] [INFO ] Implicit Places using invariants and state equation in 3528 ms returned []
Implicit Place search using SMT with State Equation took 7061 ms to find 0 implicit places.
[2022-05-18 06:10:33] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2022-05-18 06:10:33] [INFO ] Computed 1093 place invariants in 210 ms
[2022-05-18 06:10:37] [INFO ] Dead Transitions using invariants and state equation in 4390 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 4954/15136 places, 8256/22267 transitions.
Finished structural reductions, in 1 iterations. Remains : 4954/15136 places, 8256/22267 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=5 dest: 5}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=1, aps=[p2:(LT s1253 1), p0:(AND (GEQ s2058 1) (GEQ s4546 1)), p1:(AND (GEQ s2608 1) (GEQ s2697 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1727 reset in 1411 ms.
Product exploration explored 100000 steps with 1727 reset in 1372 ms.
Computed a total of 2355 stabilizing places and 3080 stable transitions
Computed a total of 2355 stabilizing places and 3080 stable transitions
Detected a total of 2355/4954 stabilizing places and 3080/8256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 900 ms. Reduced automaton from 7 states, 17 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 173 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 23843 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 23843 steps, saw 11216 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:10:44] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2022-05-18 06:10:44] [INFO ] Computed 1093 place invariants in 215 ms
[2022-05-18 06:10:45] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 06:10:45] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 270 ms returned sat
[2022-05-18 06:10:45] [INFO ] After 855ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:10:46] [INFO ] [Nat]Absence check using 49 positive place invariants in 63 ms returned sat
[2022-05-18 06:10:46] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 277 ms returned sat
[2022-05-18 06:10:50] [INFO ] After 4322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:10:50] [INFO ] State equation strengthened by 2973 read => feed constraints.
[2022-05-18 06:10:51] [INFO ] After 727ms SMT Verify possible using 2973 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:10:56] [INFO ] Deduced a trap composed of 633 places in 4812 ms of which 4 ms to minimize.
[2022-05-18 06:11:01] [INFO ] Deduced a trap composed of 533 places in 4576 ms of which 5 ms to minimize.
[2022-05-18 06:11:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10708 ms
[2022-05-18 06:11:02] [INFO ] After 11601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 254 ms.
[2022-05-18 06:11:02] [INFO ] After 17064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4954 transition count 8255
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4953 transition count 8255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 4951 transition count 8246
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4951 transition count 8246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 4951 transition count 8245
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4950 transition count 8245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4949 transition count 8237
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4949 transition count 8237
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 347 place count 4949 transition count 11743
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 684 place count 4612 transition count 11743
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 709 place count 4612 transition count 11743
Applied a total of 709 rules in 2869 ms. Remains 4612 /4954 variables (removed 342) and now considering 11743/8256 (removed -3487) transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4954 places, 11743/8256 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20981 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20981 steps, saw 9712 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:11:09] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:11:09] [INFO ] Computed 1093 place invariants in 264 ms
[2022-05-18 06:11:09] [INFO ] [Real]Absence check using 49 positive place invariants in 55 ms returned sat
[2022-05-18 06:11:10] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 242 ms returned sat
[2022-05-18 06:11:15] [INFO ] After 4968ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 06:11:15] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2022-05-18 06:11:16] [INFO ] After 1077ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:11:16] [INFO ] After 6897ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:11:16] [INFO ] [Nat]Absence check using 49 positive place invariants in 59 ms returned sat
[2022-05-18 06:11:17] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 247 ms returned sat
[2022-05-18 06:11:22] [INFO ] After 5210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:11:24] [INFO ] After 1829ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:11:29] [INFO ] Deduced a trap composed of 546 places in 5183 ms of which 4 ms to minimize.
[2022-05-18 06:11:35] [INFO ] Deduced a trap composed of 371 places in 5144 ms of which 5 ms to minimize.
[2022-05-18 06:11:41] [INFO ] Deduced a trap composed of 344 places in 5149 ms of which 5 ms to minimize.
[2022-05-18 06:11:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 06:11:41] [INFO ] After 25244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 4612 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 679 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4612 places, 11743/11743 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 642 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
[2022-05-18 06:11:42] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:11:43] [INFO ] Computed 1093 place invariants in 278 ms
[2022-05-18 06:11:47] [INFO ] Implicit Places using invariants in 4030 ms returned []
Implicit Place search using SMT only with invariants took 4032 ms to find 0 implicit places.
[2022-05-18 06:11:47] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:11:47] [INFO ] Computed 1093 place invariants in 265 ms
[2022-05-18 06:11:52] [INFO ] Dead Transitions using invariants and state equation in 5796 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4612 places, 11743/11743 transitions.
Graph (trivial) has 3429 edges and 4612 vertex of which 25 / 4612 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 39926 edges and 4588 vertex of which 4566 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t9361.t11089 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 4180 transition count 10014
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 1 with 723 rules applied. Total rules applied 968 place count 3938 transition count 9533
Ensure Unique test removed 1 places
Reduce places removed 241 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 2 with 681 rules applied. Total rules applied 1649 place count 3697 transition count 9093
Ensure Unique test removed 40 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 3 with 638 rules applied. Total rules applied 2287 place count 3457 transition count 8695
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 198 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 4 with 560 rules applied. Total rules applied 2847 place count 3257 transition count 8335
Ensure Unique test removed 36 places
Reduce places removed 198 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 5 with 520 rules applied. Total rules applied 3367 place count 3059 transition count 8013
Ensure Unique test removed 2 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 6 with 450 rules applied. Total rules applied 3817 place count 2897 transition count 7725
Ensure Unique test removed 32 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 7 with 414 rules applied. Total rules applied 4231 place count 2737 transition count 7471
Ensure Unique test removed 2 places
Reduce places removed 128 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 8 with 352 rules applied. Total rules applied 4583 place count 2609 transition count 7247
Ensure Unique test removed 28 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 9 with 320 rules applied. Total rules applied 4903 place count 2483 transition count 7053
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 10 with 266 rules applied. Total rules applied 5169 place count 2385 transition count 6885
Ensure Unique test removed 24 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 11 with 238 rules applied. Total rules applied 5407 place count 2289 transition count 6743
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 12 with 192 rules applied. Total rules applied 5599 place count 2217 transition count 6623
Ensure Unique test removed 20 places
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 13 with 168 rules applied. Total rules applied 5767 place count 2147 transition count 6525
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 130 rules applied. Total rules applied 5897 place count 2097 transition count 6445
Ensure Unique test removed 16 places
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 110 rules applied. Total rules applied 6007 place count 2049 transition count 6383
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6087 place count 2017 transition count 6335
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6151 place count 1987 transition count 6301
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6193 place count 1969 transition count 6277
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6223 place count 1953 transition count 6263
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 20 with 16 rules applied. Total rules applied 6239 place count 1945 transition count 6255
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 9 rules applied. Total rules applied 6248 place count 1938 transition count 6253
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 1936 transition count 6253
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 400 Pre rules applied. Total rules applied 6250 place count 1936 transition count 5853
Deduced a syphon composed of 400 places in 2 ms
Ensure Unique test removed 399 places
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 23 with 1199 rules applied. Total rules applied 7449 place count 1137 transition count 5853
Discarding 407 places :
Symmetric choice reduction at 23 with 407 rule applications. Total rules 7856 place count 730 transition count 5446
Iterating global reduction 23 with 407 rules applied. Total rules applied 8263 place count 730 transition count 5446
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 8263 place count 730 transition count 5445
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 8265 place count 729 transition count 5445
Discarding 540 places :
Symmetric choice reduction at 23 with 540 rule applications. Total rules 8805 place count 189 transition count 1125
Iterating global reduction 23 with 540 rules applied. Total rules applied 9345 place count 189 transition count 1125
Ensure Unique test removed 540 transitions
Reduce isomorphic transitions removed 540 transitions.
Iterating post reduction 23 with 540 rules applied. Total rules applied 9885 place count 189 transition count 585
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 24 with 51 rules applied. Total rules applied 9936 place count 163 transition count 560
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 24 with 16 rules applied. Total rules applied 9952 place count 163 transition count 544
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 24 with 16 rules applied. Total rules applied 9968 place count 147 transition count 544
Discarding 22 places :
Symmetric choice reduction at 25 with 22 rule applications. Total rules 9990 place count 125 transition count 368
Ensure Unique test removed 12 places
Iterating global reduction 25 with 34 rules applied. Total rules applied 10024 place count 113 transition count 368
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 25 with 22 rules applied. Total rules applied 10046 place count 113 transition count 346
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10057 place count 102 transition count 258
Iterating global reduction 26 with 11 rules applied. Total rules applied 10068 place count 102 transition count 258
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 10079 place count 91 transition count 247
Iterating global reduction 26 with 11 rules applied. Total rules applied 10090 place count 91 transition count 247
Applied a total of 10090 rules in 7449 ms. Remains 91 /4612 variables (removed 4521) and now considering 247/11743 (removed 11496) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 247 rows 91 cols
[2022-05-18 06:12:00] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-18 06:12:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 06:12:00] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2022-05-18 06:12:00] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:12:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 06:12:00] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-18 06:12:00] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:12:00] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 06:12:00] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:12:00] [INFO ] Flatten gal took : 16 ms
[2022-05-18 06:12:00] [INFO ] Flatten gal took : 13 ms
[2022-05-18 06:12:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6880103016156796663.gal : 2 ms
[2022-05-18 06:12:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8423904512256695591.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15152018020240820212;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6880103016156796663.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8423904512256695591.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8423904512256695591.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 111
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :111 after 138
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :138 after 401
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :401 after 975
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :975 after 3318
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3318 after 27231
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :27231 after 44158
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,415106,4.03778,110292,2,57058,16,168960,7,0,583,370143,0
Total reachable state count : 415106
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,11968,4.04213,110292,2,2544,16,168960,7,0,585,370143,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 475 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 4954 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Applied a total of 0 rules in 344 ms. Remains 4954 /4954 variables (removed 0) and now considering 8256/8256 (removed 0) transitions.
[2022-05-18 06:12:05] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2022-05-18 06:12:05] [INFO ] Computed 1093 place invariants in 222 ms
[2022-05-18 06:12:09] [INFO ] Implicit Places using invariants in 3584 ms returned []
[2022-05-18 06:12:09] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2022-05-18 06:12:09] [INFO ] Computed 1093 place invariants in 198 ms
[2022-05-18 06:12:12] [INFO ] Implicit Places using invariants and state equation in 3381 ms returned []
Implicit Place search using SMT with State Equation took 6967 ms to find 0 implicit places.
[2022-05-18 06:12:12] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2022-05-18 06:12:12] [INFO ] Computed 1093 place invariants in 202 ms
[2022-05-18 06:12:16] [INFO ] Dead Transitions using invariants and state equation in 4247 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4954/4954 places, 8256/8256 transitions.
Computed a total of 2355 stabilizing places and 3080 stable transitions
Computed a total of 2355 stabilizing places and 3080 stable transitions
Detected a total of 2355/4954 stabilizing places and 3080/8256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p2, (X p2), true, (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 172 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24209 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24209 steps, saw 11383 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:12:20] [INFO ] Flow matrix only has 7656 transitions (discarded 600 similar events)
// Phase 1: matrix 7656 rows 4954 cols
[2022-05-18 06:12:20] [INFO ] Computed 1093 place invariants in 197 ms
[2022-05-18 06:12:20] [INFO ] [Real]Absence check using 49 positive place invariants in 56 ms returned sat
[2022-05-18 06:12:21] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 252 ms returned sat
[2022-05-18 06:12:21] [INFO ] After 804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:12:21] [INFO ] [Nat]Absence check using 49 positive place invariants in 58 ms returned sat
[2022-05-18 06:12:21] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 256 ms returned sat
[2022-05-18 06:12:25] [INFO ] After 3524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:12:25] [INFO ] State equation strengthened by 2973 read => feed constraints.
[2022-05-18 06:12:26] [INFO ] After 660ms SMT Verify possible using 2973 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:12:31] [INFO ] Deduced a trap composed of 633 places in 4655 ms of which 4 ms to minimize.
[2022-05-18 06:12:36] [INFO ] Deduced a trap composed of 533 places in 4581 ms of which 5 ms to minimize.
[2022-05-18 06:12:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10454 ms
[2022-05-18 06:12:36] [INFO ] After 11269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 234 ms.
[2022-05-18 06:12:37] [INFO ] After 15862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4954 transition count 8255
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4953 transition count 8255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 4951 transition count 8246
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 4951 transition count 8246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 4951 transition count 8245
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4950 transition count 8245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4949 transition count 8237
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4949 transition count 8237
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 347 place count 4949 transition count 11743
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 684 place count 4612 transition count 11743
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 709 place count 4612 transition count 11743
Applied a total of 709 rules in 2690 ms. Remains 4612 /4954 variables (removed 342) and now considering 11743/8256 (removed -3487) transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4954 places, 11743/8256 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 21102 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21102 steps, saw 9768 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:12:43] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:12:43] [INFO ] Computed 1093 place invariants in 265 ms
[2022-05-18 06:12:43] [INFO ] [Real]Absence check using 49 positive place invariants in 57 ms returned sat
[2022-05-18 06:12:44] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 246 ms returned sat
[2022-05-18 06:12:48] [INFO ] After 4647ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 06:12:49] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2022-05-18 06:12:50] [INFO ] After 1063ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:12:50] [INFO ] After 6547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:12:50] [INFO ] [Nat]Absence check using 49 positive place invariants in 57 ms returned sat
[2022-05-18 06:12:50] [INFO ] [Nat]Absence check using 49 positive and 1044 generalized place invariants in 243 ms returned sat
[2022-05-18 06:12:55] [INFO ] After 4439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:12:57] [INFO ] After 1825ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:13:02] [INFO ] Deduced a trap composed of 546 places in 5122 ms of which 4 ms to minimize.
[2022-05-18 06:13:08] [INFO ] Deduced a trap composed of 371 places in 5076 ms of which 5 ms to minimize.
[2022-05-18 06:13:14] [INFO ] Deduced a trap composed of 344 places in 5120 ms of which 4 ms to minimize.
[2022-05-18 06:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 17919 ms
[2022-05-18 06:13:15] [INFO ] After 19840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-18 06:13:15] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 4612 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 663 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4612/4612 places, 11743/11743 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4612/4612 places, 11743/11743 transitions.
Applied a total of 0 rules in 627 ms. Remains 4612 /4612 variables (removed 0) and now considering 11743/11743 (removed 0) transitions.
[2022-05-18 06:13:16] [INFO ] Flow matrix only has 10857 transitions (discarded 886 similar events)
// Phase 1: matrix 10857 rows 4612 cols
[2022-05-18 06:13:16] [INFO ] Computed 1093 place invariants in 265 ms
[2022-05-18 06:13:30] [INFO ] Implicit Places using invariants in 14029 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 87, 105, 125, 147, 170, 192, 193, 194, 195, 196, 197, 198, 199, 200, 220, 238, 254, 268, 280, 290, 298, 304, 308, 310, 329, 335, 337, 338, 339, 340, 341, 342, 343, 344, 345, 347, 351, 357, 365, 375, 387, 401, 417, 435, 455, 476, 496, 497, 498, 499, 500, 501, 502, 503, 504, 522, 538, 552, 564, 574, 582, 588, 592, 594, 596, 615, 621, 623, 624, 625, 626, 627, 628, 629, 630, 631, 633, 635, 639, 645, 653, 663, 675, 689, 705, 723, 742, 760, 761, 762, 763, 764, 765, 766, 767, 768, 784, 798, 810, 820, 828, 834, 838, 840, 842, 844, 863, 869, 871, 872, 873, 874, 875, 876, 877, 878, 879, 881, 883, 885, 889, 895, 903, 913, 925, 939, 955, 972, 988, 989, 990, 991, 992, 993, 994, 995, 996, 1010, 1022, 1032, 1040, 1046, 1050, 1052, 1054, 1056, 1058, 1077, 1083, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1093, 1095, 1097, 1099, 1101, 1105, 1111, 1119, 1129, 1141, 1157, 1172, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1206, 1216, 1224, 1230, 1234, 1236, 1238, 1240, 1242, 1244, 1263, 1269, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1281, 1283, 1285, 1287, 1289, 1293, 1299, 1307, 1317, 1329, 1342, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1372, 1380, 1386, 1390, 1392, 1394, 1396, 1398, 1400, 1402, 1421, 1427, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1439, 1441, 1443, 1445, 1447, 1449, 1453, 1459, 1467, 1477, 1488, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1514, 1520, 1524, 1526, 1528, 1530, 1532, 1534, 1536, 1538, 1557, 1563, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1575, 1577, 1579, 1581, 1583, 1585, 1587, 1591, 1597, 1605, 1614, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1629, 1630, 1636, 1640, 1642, 1644, 1646, 1648, 1650, 1652, 1654, 1656, 1675, 1681, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1711, 1717, 1724, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1742, 1744, 1746, 1748, 1750, 1752, 1754, 1756, 1758, 1760, 1779, 1785, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, 1795, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1811, 1813, 1817, 1822, 1826, 1827, 1828, 1829, 1830, 1831, 1832, 1833, 1834, 1836, 1838, 1840, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1873, 1879, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1912, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1922, 1924, 1926, 1928, 1930, 1932, 1934, 1936, 1938, 1940, 1942, 1961, 1967, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1979, 1981, 1983, 1985, 1987, 1989, 1991, 1993, 1995, 1997, 1999, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2011, 2013, 2015, 2017, 2019, 2021, 2023, 2025, 2027, 2029, 2048, 2050, 2053, 2055, 2056, 2057, 2058, 2059, 2060, 2061, 2062, 2063, 2065, 2067, 2069, 2071, 2073, 2075, 2077, 2079, 2081, 2083, 2085, 2087, 2088, 2089, 2090, 2091, 2092, 2093, 2094, 2095, 2097, 2099, 2101, 2103, 2105, 2107, 2109, 2111, 2113, 2115, 2134, 2140, 2142, 2143, 2144, 2145, 2146, 2147, 2148, 2149, 2150, 2152, 2154, 2156, 2158, 2160, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2175, 2176, 2177, 2178, 2179, 2180, 2181, 2182, 2184, 2186, 2188, 2190, 2192, 2194, 2196, 2198, 2200, 2202, 2221, 2227, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2239, 2241, 2243, 2245, 2247, 2249, 2251, 2253, 2255, 2257, 2259, 2262, 2263, 2264, 2265, 2266, 2267, 2268, 2269, 2270, 2272, 2274, 2276, 2278, 2280, 2282, 2284, 2286, 2288, 2290, 2309, 2315, 2317, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2327, 2329, 2331, 2333, 2335, 2337, 2339, 2341, 2343, 2345, 2349, 2354, 2355, 2356, 2357, 2358, 2359, 2360, 2361, 2362, 2366, 2368, 2370, 2372, 2374, 2376, 2378, 2380, 2382, 2384, 2403, 2409, 2411, 2412, 2413, 2414, 2415, 2416, 2417, 2418, 2419, 2421, 2423, 2425, 2427, 2429, 2431, 2433, 2435, 2437, 2441, 2447, 2454, 2455, 2456, 2457, 2458, 2459, 2460, 2461, 2462, 2468, 2472, 2474, 2476, 2478, 2480, 2482, 2484, 2486, 2488, 2507, 2513, 2515, 2516, 2517, 2518, 2519, 2520, 2521, 2522, 2523, 2525, 2527, 2529, 2531, 2533, 2535, 2537, 2539, 2543, 2549, 2557, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2582, 2588, 2592, 2594, 2596, 2598, 2600, 2602, 2604, 2606, 2625, 2631, 2633, 2634, 2635, 2636, 2637, 2638, 2639, 2640, 2641, 2643, 2645, 2647, 2649, 2651, 2653, 2655, 2659, 2665, 2673, 2683, 2694, 2695, 2696, 2697, 2698, 2699, 2700, 2701, 2702, 2712, 2720, 2726, 2730, 2732, 2734, 2736, 2738, 2740, 2742, 2761, 2767, 2769, 2770, 2771, 2772, 2773, 2774, 2775, 2776, 2777, 2779, 2781, 2783, 2785, 2787, 2789, 2793, 2799, 2807, 2817, 2829, 2842, 2843, 2844, 2845, 2846, 2847, 2848, 2849, 2850, 2862, 2872, 2880, 2886, 2890, 2892, 2894, 2896, 2898, 2900, 2919, 2925, 2927, 2928, 2929, 2930, 2931, 2932, 2933, 2934, 2935, 2937, 2939, 2941, 2943, 2945, 2949, 2955, 2963, 2973, 2985, 2999, 3014, 3015, 3016, 3017, 3018, 3019, 3020, 3021, 3022, 3036, 3048, 3058, 3066, 3072, 3076, 3078, 3080, 3082, 3084, 3103, 3109, 3111, 3112, 3113, 3114, 3115, 3116, 3117, 3118, 3119, 3121, 3123, 3125, 3127, 3131, 3137, 3145, 3155, 3167, 3181, 3197, 3214, 3215, 3216, 3217, 3218, 3219, 3220, 3221, 3222, 3238, 3252, 3264, 3274, 3282, 3288, 3292, 3294, 3296, 3298, 3317, 3323, 3325, 3326, 3327, 3328, 3329, 3330, 3331, 3332, 3333, 3335, 3337, 3339, 3343, 3349, 3357, 3367, 3379, 3393, 3409, 3427, 3446, 3447, 3448, 3449, 3450, 3451, 3452, 3453, 3454, 3472, 3488, 3502, 3514, 3524, 3532, 3538, 3542, 3544, 3546, 3565, 3571, 3573, 3574, 3575, 3576, 3577, 3578, 3579, 3580, 3581, 3583, 3585, 3589, 3595, 3603, 3613, 3625, 3639, 3655, 3673, 3693, 3714, 3715, 3716, 3717, 3718, 3719, 3720, 3721, 3722, 3742, 3760, 3776, 3790, 3802, 3812, 3820, 3826, 3830, 3832, 3851, 3853, 3856, 3858, 3859, 3860, 3861, 3862, 3863, 3864, 3865, 3866, 3868, 3872, 3878, 3886, 3896, 3908, 3922, 3938, 3956, 3976, 3998, 4021, 4022, 4023, 4024, 4025, 4026, 4027, 4028, 4029, 4051, 4071, 4089, 4105, 4119, 4131, 4141, 4149, 4155, 4159, 4178]
Discarding 1027 places :
Implicit Place search using SMT only with invariants took 14058 ms to find 1027 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 3585/4612 places, 11743/11743 transitions.
Discarding 383 places :
Symmetric choice reduction at 0 with 383 rule applications. Total rules 383 place count 3202 transition count 11360
Iterating global reduction 0 with 383 rules applied. Total rules applied 766 place count 3202 transition count 11360
Discarding 383 places :
Symmetric choice reduction at 0 with 383 rule applications. Total rules 1149 place count 2819 transition count 10977
Iterating global reduction 0 with 383 rules applied. Total rules applied 1532 place count 2819 transition count 10977
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1535 place count 2819 transition count 10974
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1538 place count 2816 transition count 10974
Applied a total of 1538 rules in 1690 ms. Remains 2816 /3585 variables (removed 769) and now considering 10974/11743 (removed 769) transitions.
[2022-05-18 06:13:32] [INFO ] Flow matrix only has 10088 transitions (discarded 886 similar events)
// Phase 1: matrix 10088 rows 2816 cols
[2022-05-18 06:13:32] [INFO ] Computed 66 place invariants in 167 ms
[2022-05-18 06:13:36] [INFO ] Implicit Places using invariants in 4322 ms returned []
Implicit Place search using SMT only with invariants took 4323 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2816/4612 places, 10974/11743 transitions.
Finished structural reductions, in 2 iterations. Remains : 2816/4612 places, 10974/11743 transitions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24222 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24222 steps, saw 10436 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:13:40] [INFO ] Flow matrix only has 10088 transitions (discarded 886 similar events)
// Phase 1: matrix 10088 rows 2816 cols
[2022-05-18 06:13:40] [INFO ] Computed 66 place invariants in 151 ms
[2022-05-18 06:13:40] [INFO ] [Real]Absence check using 47 positive place invariants in 36 ms returned sat
[2022-05-18 06:13:40] [INFO ] [Real]Absence check using 47 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-18 06:13:44] [INFO ] After 3714ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 06:13:44] [INFO ] State equation strengthened by 6802 read => feed constraints.
[2022-05-18 06:13:45] [INFO ] After 869ms SMT Verify possible using 6802 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:13:45] [INFO ] After 5003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:13:45] [INFO ] [Nat]Absence check using 47 positive place invariants in 43 ms returned sat
[2022-05-18 06:13:45] [INFO ] [Nat]Absence check using 47 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-18 06:13:49] [INFO ] After 3852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:13:51] [INFO ] After 2267ms SMT Verify possible using 6802 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:13:53] [INFO ] Deduced a trap composed of 286 places in 1784 ms of which 3 ms to minimize.
[2022-05-18 06:13:56] [INFO ] Deduced a trap composed of 305 places in 1794 ms of which 2 ms to minimize.
[2022-05-18 06:13:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5174 ms
[2022-05-18 06:13:57] [INFO ] After 7628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 299 ms.
[2022-05-18 06:13:57] [INFO ] After 12168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 2816 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2816/2816 places, 10974/10974 transitions.
Applied a total of 0 rules in 629 ms. Remains 2816 /2816 variables (removed 0) and now considering 10974/10974 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2816/2816 places, 10974/10974 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2816/2816 places, 10974/10974 transitions.
Applied a total of 0 rules in 616 ms. Remains 2816 /2816 variables (removed 0) and now considering 10974/10974 (removed 0) transitions.
[2022-05-18 06:13:58] [INFO ] Flow matrix only has 10088 transitions (discarded 886 similar events)
// Phase 1: matrix 10088 rows 2816 cols
[2022-05-18 06:13:58] [INFO ] Computed 66 place invariants in 148 ms
[2022-05-18 06:14:02] [INFO ] Implicit Places using invariants in 4249 ms returned []
Implicit Place search using SMT only with invariants took 4249 ms to find 0 implicit places.
[2022-05-18 06:14:02] [INFO ] Flow matrix only has 10088 transitions (discarded 886 similar events)
// Phase 1: matrix 10088 rows 2816 cols
[2022-05-18 06:14:03] [INFO ] Computed 66 place invariants in 148 ms
[2022-05-18 06:14:08] [INFO ] Dead Transitions using invariants and state equation in 5081 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2816/2816 places, 10974/10974 transitions.
Knowledge obtained : [p2, (X p2), true, (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1728 reset in 1430 ms.
Product exploration explored 100000 steps with 1727 reset in 1432 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4954 transition count 8257
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4954 transition count 8257
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 4952 transition count 8247
Deduced a syphon composed of 1 places in 5 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 4952 transition count 8247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 4951 transition count 8239
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 4951 transition count 8239
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 7 rules in 2102 ms. Remains 4951 /4954 variables (removed 3) and now considering 8239/8256 (removed 17) transitions.
[2022-05-18 06:14:14] [INFO ] Redundant transitions in 677 ms returned []
[2022-05-18 06:14:14] [INFO ] Flow matrix only has 7639 transitions (discarded 600 similar events)
// Phase 1: matrix 7639 rows 4951 cols
[2022-05-18 06:14:14] [INFO ] Computed 1093 place invariants in 200 ms
[2022-05-18 06:14:19] [INFO ] Dead Transitions using invariants and state equation in 5257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4951/4954 places, 8239/8256 transitions.
Finished structural reductions, in 1 iterations. Remains : 4951/4954 places, 8239/8256 transitions.
Product exploration explored 100000 steps with 1727 reset in 2086 ms.
Product exploration explored 100000 steps with 1724 reset in 2118 ms.
Built C files in :
/tmp/ltsmin7442350941629474197
[2022-05-18 06:14:23] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7442350941629474197
Running compilation step : cd /tmp/ltsmin7442350941629474197;'/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/ltsmin7442350941629474197;'/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/ltsmin7442350941629474197;'/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 1 out of 4954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4954/4954 places, 8256/8256 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4952 transition count 8247
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4952 transition count 8247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 4951 transition count 8239
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 4951 transition count 8239
Applied a total of 6 rules in 1143 ms. Remains 4951 /4954 variables (removed 3) and now considering 8239/8256 (removed 17) transitions.
[2022-05-18 06:14:27] [INFO ] Flow matrix only has 7639 transitions (discarded 600 similar events)
// Phase 1: matrix 7639 rows 4951 cols
[2022-05-18 06:14:28] [INFO ] Computed 1093 place invariants in 205 ms
[2022-05-18 06:14:33] [INFO ] Implicit Places using invariants in 5215 ms returned []
[2022-05-18 06:14:33] [INFO ] Flow matrix only has 7639 transitions (discarded 600 similar events)
// Phase 1: matrix 7639 rows 4951 cols
[2022-05-18 06:14:33] [INFO ] Computed 1093 place invariants in 199 ms
[2022-05-18 06:14:38] [INFO ] Implicit Places using invariants and state equation in 5240 ms returned []
Implicit Place search using SMT with State Equation took 10463 ms to find 0 implicit places.
[2022-05-18 06:14:38] [INFO ] Flow matrix only has 7639 transitions (discarded 600 similar events)
// Phase 1: matrix 7639 rows 4951 cols
[2022-05-18 06:14:38] [INFO ] Computed 1093 place invariants in 199 ms
[2022-05-18 06:14:43] [INFO ] Dead Transitions using invariants and state equation in 5252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4951/4954 places, 8239/8256 transitions.
Finished structural reductions, in 1 iterations. Remains : 4951/4954 places, 8239/8256 transitions.
Built C files in :
/tmp/ltsmin16358681689913885980
[2022-05-18 06:14:43] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16358681689913885980
Running compilation step : cd /tmp/ltsmin16358681689913885980;'/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/ltsmin16358681689913885980;'/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/ltsmin16358681689913885980;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 06:14:47] [INFO ] Flatten gal took : 258 ms
[2022-05-18 06:14:47] [INFO ] Flatten gal took : 283 ms
[2022-05-18 06:14:47] [INFO ] Time to serialize gal into /tmp/LTL17915883703061342492.gal : 77 ms
[2022-05-18 06:14:47] [INFO ] Time to serialize properties into /tmp/LTL17669376504301564151.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/LTL17915883703061342492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17669376504301564151.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/LTL1791588...268
Read 1 LTL properties
Checking formula 0 : !((G((G(X(((X("((Node16HasAskedItsLeafSetToLx5ToReplaceNode1>=1)&&(LeafSetOfLx5IsSentToNode16>=1))"))&&("(Node10ManageTheCrashOfNode4>...267
Formula 0 simplified : !G(GX("(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1)" & "(Node10ManageTheCrashOfNode4>=1)" & X"((Node16HasAskedItsLeafSetToLx5ToReplaceNo...247
Detected timeout of ITS tools.
[2022-05-18 06:15:03] [INFO ] Flatten gal took : 259 ms
[2022-05-18 06:15:03] [INFO ] Applying decomposition
[2022-05-18 06:15:03] [INFO ] Flatten gal took : 274 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/graph12429982909432052299.txt' '-o' '/tmp/graph12429982909432052299.bin' '-w' '/tmp/graph12429982909432052299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12429982909432052299.bin' '-l' '-1' '-v' '-w' '/tmp/graph12429982909432052299.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:15:03] [INFO ] Decomposing Gal with order
[2022-05-18 06:15:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:15:05] [INFO ] Removed a total of 6976 redundant transitions.
[2022-05-18 06:15:05] [INFO ] Flatten gal took : 1487 ms
[2022-05-18 06:15:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 5350 labels/synchronizations in 405 ms.
[2022-05-18 06:15:06] [INFO ] Time to serialize gal into /tmp/LTL1552204081871723210.gal : 49 ms
[2022-05-18 06:15:06] [INFO ] Time to serialize properties into /tmp/LTL7688528611928301196.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/LTL1552204081871723210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7688528611928301196.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/LTL1552204...245
Read 1 LTL properties
Checking formula 0 : !((G((G(X(((X("((i30.u402.Node16HasAskedItsLeafSetToLx5ToReplaceNode1>=1)&&(i30.u383.LeafSetOfLx5IsSentToNode16>=1))"))&&("(i0.i1.u376...316
Formula 0 simplified : !G(GX("(i0.i1.u374.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1)" & "(i0.i1.u376.Node10ManageTheCrashOfNode4>=1)" & X"((i30.u402.Node16Has...296
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17302016325685322976
[2022-05-18 06:15:21] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17302016325685322976
Running compilation step : cd /tmp/ltsmin17302016325685322976;'/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/ltsmin17302016325685322976;'/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/ltsmin17302016325685322976;'/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 MultiCrashLeafsetExtension-PT-S24C08-LTLFireability-11 finished in 301463 ms.
[2022-05-18 06:15:25] [INFO ] Flatten gal took : 696 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6439307867777436910
[2022-05-18 06:15:25] [INFO ] Too many transitions (22267) to apply POR reductions. Disabling POR matrices.
[2022-05-18 06:15:26] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6439307867777436910
Running compilation step : cd /tmp/ltsmin6439307867777436910;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 06:15:26] [INFO ] Applying decomposition
[2022-05-18 06:15:26] [INFO ] Flatten gal took : 722 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/graph8498138285554928513.txt' '-o' '/tmp/graph8498138285554928513.bin' '-w' '/tmp/graph8498138285554928513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8498138285554928513.bin' '-l' '-1' '-v' '-w' '/tmp/graph8498138285554928513.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:15:28] [INFO ] Decomposing Gal with order
[2022-05-18 06:15:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:15:33] [INFO ] Removed a total of 14372 redundant transitions.
[2022-05-18 06:15:33] [INFO ] Flatten gal took : 2721 ms
[2022-05-18 06:15:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2592 labels/synchronizations in 394 ms.
[2022-05-18 06:15:34] [INFO ] Time to serialize gal into /tmp/LTLFireability5866134416707300154.gal : 98 ms
[2022-05-18 06:15:34] [INFO ] Time to serialize properties into /tmp/LTLFireability17266392923780521785.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/LTLFireability5866134416707300154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17266392923780521785.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((G(((X(F(G("(i9.u406.Node19HasTheLeafSetOfRx5ToReplaceNode17<1)"))))||(G(F("(i3.u393.Lx0HasReceivedTheRequestOfNode4>=1)"))))||("(i3...200
Formula 0 simplified : !G("(i3.u393.Lx0HasReceivedTheRequestOfNode4<1)" | XFG"(i9.u406.Node19HasTheLeafSetOfRx5ToReplaceNode17<1)" | GF"(i3.u393.Lx0HasRece...182
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/ltsmin6439307867777436910;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6439307867777436910;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 240 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)
Detected timeout of ITS tools.
[2022-05-18 06:42:16] [INFO ] Flatten gal took : 1782 ms
[2022-05-18 06:42:16] [INFO ] Time to serialize gal into /tmp/LTLFireability12859608022676186405.gal : 91 ms
[2022-05-18 06:42:16] [INFO ] Time to serialize properties into /tmp/LTLFireability1752263439667648835.ltl : 8 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/LTLFireability12859608022676186405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1752263439667648835.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...289
Read 3 LTL properties
Checking formula 0 : !((G(((X(F(G("(Node19HasTheLeafSetOfRx5ToReplaceNode17<1)"))))||(G(F("(Lx0HasReceivedTheRequestOfNode4>=1)"))))||("(Lx0HasReceivedTheR...176
Formula 0 simplified : !G("(Lx0HasReceivedTheRequestOfNode4<1)" | XFG"(Node19HasTheLeafSetOfRx5ToReplaceNode17<1)" | GF"(Lx0HasReceivedTheRequestOfNode4>=1...158
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="MultiCrashLeafsetExtension-PT-S24C08"
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 MultiCrashLeafsetExtension-PT-S24C08, 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 r132-tall-165271821300756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C08.tgz
mv MultiCrashLeafsetExtension-PT-S24C08 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 ;