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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 14K Apr 29 16:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 29 16:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 16:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K 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.7K May 9 08:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 20M 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-S24C12-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652866318860

Running Version 202205111006
[2022-05-18 09:32:00] [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 09:32:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 09:32:00] [INFO ] Load time of PNML (sax parser for PT used): 816 ms
[2022-05-18 09:32:00] [INFO ] Transformed 20612 places.
[2022-05-18 09:32:01] [INFO ] Transformed 29875 transitions.
[2022-05-18 09:32:01] [INFO ] Parsed PT model containing 20612 places and 29875 transitions in 1038 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 20612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20612/20612 places, 29875/29875 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 20560 transition count 29875
Applied a total of 52 rules in 856 ms. Remains 20560 /20612 variables (removed 52) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:32:02] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:32:05] [INFO ] Computed 1301 place invariants in 2901 ms
[2022-05-18 09:32:07] [INFO ] Implicit Places using invariants in 4761 ms returned []
Implicit Place search using SMT only with invariants took 4789 ms to find 0 implicit places.
[2022-05-18 09:32:07] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:32:09] [INFO ] Computed 1301 place invariants in 2764 ms
[2022-05-18 09:32:11] [INFO ] Dead Transitions using invariants and state equation in 4672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20560/20612 places, 29875/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20612 places, 29875/29875 transitions.
Support contains 68 out of 20560 places after structural reductions.
[2022-05-18 09:32:13] [INFO ] Flatten gal took : 1163 ms
[2022-05-18 09:32:14] [INFO ] Flatten gal took : 1000 ms
[2022-05-18 09:32:16] [INFO ] Input system was already deterministic with 29875 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 988 ms. (steps per millisecond=10 ) properties (out of 37) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) 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 31) 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 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 29) 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 29) 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 29) seen :0
Running SMT prover for 29 properties.
[2022-05-18 09:32:17] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:32:20] [INFO ] Computed 1301 place invariants in 2702 ms
[2022-05-18 09:32:30] [INFO ] [Real]Absence check using 47 positive place invariants in 275 ms returned sat
[2022-05-18 09:32:31] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 806 ms returned sat
[2022-05-18 09:32:45] [INFO ] After 6362ms SMT Verify possible using state equation in real domain returned unsat :1 sat :22 real:5
[2022-05-18 09:32:45] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:32:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 09:32:45] [INFO ] After 25162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7134 transitions
Trivial Post-agglo rules discarded 7134 transitions
Performed 7134 trivial Post agglomeration. Transition count delta: 7134
Iterating post reduction 0 with 7134 rules applied. Total rules applied 7134 place count 20560 transition count 22741
Reduce places removed 7134 places and 0 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 1 with 7194 rules applied. Total rules applied 14328 place count 13426 transition count 22681
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 14388 place count 13366 transition count 22681
Performed 593 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 593 Pre rules applied. Total rules applied 14388 place count 13366 transition count 22088
Deduced a syphon composed of 593 places in 26 ms
Reduce places removed 593 places and 0 transitions.
Iterating global reduction 3 with 1186 rules applied. Total rules applied 15574 place count 12773 transition count 22088
Discarding 6589 places :
Symmetric choice reduction at 3 with 6589 rule applications. Total rules 22163 place count 6184 transition count 15499
Iterating global reduction 3 with 6589 rules applied. Total rules applied 28752 place count 6184 transition count 15499
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 28752 place count 6184 transition count 15484
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 28782 place count 6169 transition count 15484
Discarding 530 places :
Symmetric choice reduction at 3 with 530 rule applications. Total rules 29312 place count 5639 transition count 9124
Iterating global reduction 3 with 530 rules applied. Total rules applied 29842 place count 5639 transition count 9124
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 7 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 29886 place count 5617 transition count 9102
Free-agglomeration rule (complex) applied 321 times.
Iterating global reduction 3 with 321 rules applied. Total rules applied 30207 place count 5617 transition count 14391
Reduce places removed 321 places and 0 transitions.
Iterating post reduction 3 with 321 rules applied. Total rules applied 30528 place count 5296 transition count 14391
Partial Free-agglomeration rule applied 220 times.
Drop transitions removed 220 transitions
Iterating global reduction 4 with 220 rules applied. Total rules applied 30748 place count 5296 transition count 14391
Applied a total of 30748 rules in 7121 ms. Remains 5296 /20560 variables (removed 15264) and now considering 14391/29875 (removed 15484) transitions.
Finished structural reductions, in 1 iterations. Remains : 5296/20560 places, 14391/29875 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 892 ms. (steps per millisecond=11 ) properties (out of 28) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Running SMT prover for 23 properties.
[2022-05-18 09:32:54] [INFO ] Flow matrix only has 13529 transitions (discarded 862 similar events)
// Phase 1: matrix 13529 rows 5296 cols
[2022-05-18 09:32:54] [INFO ] Computed 1301 place invariants in 368 ms
[2022-05-18 09:32:56] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2022-05-18 09:32:57] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 343 ms returned sat
[2022-05-18 09:33:18] [INFO ] After 19352ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:22
[2022-05-18 09:33:18] [INFO ] State equation strengthened by 8982 read => feed constraints.
[2022-05-18 09:33:19] [INFO ] After 1099ms SMT Verify possible using 8982 Read/Feed constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-18 09:33:19] [INFO ] After 25036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2022-05-18 09:33:21] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2022-05-18 09:33:22] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 351 ms returned sat
[2022-05-18 09:33:43] [INFO ] After 19193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-18 09:33:44] [INFO ] After 1554ms SMT Verify possible using 8982 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2022-05-18 09:33:44] [INFO ] After 1556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-18 09:33:44] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 120 ms.
Support contains 42 out of 5296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5296/5296 places, 14391/14391 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 5296 transition count 14389
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 5294 transition count 14389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 5293 transition count 14377
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 5293 transition count 14377
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 5293 transition count 14375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 5291 transition count 14375
Applied a total of 10 rules in 1995 ms. Remains 5291 /5296 variables (removed 5) and now considering 14375/14391 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 5291/5296 places, 14375/14391 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 971 ms. (steps per millisecond=10 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 23) 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 23) 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 23) 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 22) seen :0
Interrupted probabilistic random walk after 17959 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 17959 steps, saw 8532 distinct states, run finished after 3002 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 22 properties.
[2022-05-18 09:33:51] [INFO ] Flow matrix only has 13513 transitions (discarded 862 similar events)
// Phase 1: matrix 13513 rows 5291 cols
[2022-05-18 09:33:51] [INFO ] Computed 1301 place invariants in 385 ms
[2022-05-18 09:33:53] [INFO ] [Real]Absence check using 49 positive place invariants in 82 ms returned sat
[2022-05-18 09:33:53] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 339 ms returned sat
[2022-05-18 09:34:16] [INFO ] After 20416ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:21
[2022-05-18 09:34:16] [INFO ] State equation strengthened by 8971 read => feed constraints.
[2022-05-18 09:34:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 09:34:16] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 5291 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5291/5291 places, 14375/14375 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 5291 transition count 14374
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5290 transition count 14374
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 5289 transition count 14373
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 5289 transition count 14373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 5289 transition count 14372
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 5288 transition count 14372
Applied a total of 6 rules in 1226 ms. Remains 5288 /5291 variables (removed 3) and now considering 14372/14375 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 5288/5291 places, 14372/14375 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17936 stabilizing places and 24674 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 20 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29397 place count 5587 transition count 8863
Iterating global reduction 2 with 549 rules applied. Total rules applied 29946 place count 5587 transition count 8863
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 29996 place count 5562 transition count 8838
Applied a total of 29996 rules in 3566 ms. Remains 5562 /20560 variables (removed 14998) and now considering 8838/29875 (removed 21037) transitions.
[2022-05-18 09:34:21] [INFO ] Flow matrix only has 8238 transitions (discarded 600 similar events)
// Phase 1: matrix 8238 rows 5562 cols
[2022-05-18 09:34:21] [INFO ] Computed 1301 place invariants in 235 ms
[2022-05-18 09:34:25] [INFO ] Implicit Places using invariants in 4198 ms returned []
[2022-05-18 09:34:25] [INFO ] Flow matrix only has 8238 transitions (discarded 600 similar events)
// Phase 1: matrix 8238 rows 5562 cols
[2022-05-18 09:34:26] [INFO ] Computed 1301 place invariants in 228 ms
[2022-05-18 09:34:29] [INFO ] Implicit Places using invariants and state equation in 4158 ms returned []
Implicit Place search using SMT with State Equation took 8360 ms to find 0 implicit places.
[2022-05-18 09:34:31] [INFO ] Redundant transitions in 1079 ms returned []
[2022-05-18 09:34:31] [INFO ] Flow matrix only has 8238 transitions (discarded 600 similar events)
// Phase 1: matrix 8238 rows 5562 cols
[2022-05-18 09:34:31] [INFO ] Computed 1301 place invariants in 257 ms
[2022-05-18 09:34:36] [INFO ] Dead Transitions using invariants and state equation in 5725 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5562/20560 places, 8838/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 5562/20560 places, 8838/29875 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-00 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 s4246 1) (GEQ s5102 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 84 steps with 0 reset in 7 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-00 finished in 18964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(X(p0))))||((G(p1) U p2) U X(p3))))'
Support contains 7 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 472 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:34:37] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:34:40] [INFO ] Computed 1301 place invariants in 2719 ms
[2022-05-18 09:34:41] [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.
[2022-05-18 09:34:41] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:34:44] [INFO ] Computed 1301 place invariants in 2583 ms
[2022-05-18 09:34:46] [INFO ] Dead Transitions using invariants and state equation in 4200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 1064 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) p1 p3 (NOT p0)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 10}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=3 dest: 11}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p2) p1 p3), acceptance={} source=8 dest: 13}], [{ cond=(NOT p3), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=11 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=11 dest: 15}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p1) p0), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 6}, { cond=(AND p1 p0), acceptance={} source=12 dest: 12}, { cond=(AND p1 (NOT p0)), acceptance={} source=12 dest: 17}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=13 dest: 13}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=13 dest: 18}], [{ cond=(AND (NOT p3) p0), acceptance={} source=14 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=14 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=15 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=15 dest: 6}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=15 dest: 12}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={} source=15 dest: 13}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=15 dest: 17}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=15 dest: 18}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={} source=16 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={} source=16 dest: 15}, { cond=(OR (AND p2 (NOT p3) p0) (AND p1 (NOT p3) p0)), acceptance={} source=16 dest: 16}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=16 dest: 19}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=16 dest: 20}, { cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0))), acceptance={} source=16 dest: 21}], [{ cond=(NOT p1), acceptance={} source=17 dest: 6}, { cond=p1, acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=18 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=18 dest: 17}, { cond=(AND (NOT p2) p1), acceptance={0} source=18 dest: 18}], [{ cond=(NOT p3), acceptance={} source=19 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=20 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={} source=20 dest: 17}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=20 dest: 18}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=21 dest: 19}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=21 dest: 20}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=21 dest: 21}]], initial=0, aps=[p2:(AND (GEQ s11634 1) (GEQ s18923 1)), p1:(AND (GEQ s7464 1) (GEQ s12425 1)), p3:(AND (GEQ s5559 1) (GEQ s20076 1)), p0:(GEQ s5875 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, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-01 finished in 10174 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||G(p1)))))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 490 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:34:47] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:34:50] [INFO ] Computed 1301 place invariants in 2627 ms
[2022-05-18 09:34:51] [INFO ] Implicit Places using invariants in 4302 ms returned []
Implicit Place search using SMT only with invariants took 4304 ms to find 0 implicit places.
[2022-05-18 09:34:51] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:34:54] [INFO ] Computed 1301 place invariants in 2583 ms
[2022-05-18 09:34:56] [INFO ] Dead Transitions using invariants and state equation in 4208 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s9356 1) (LT s20508 1)), p1:(OR (LT s16859 1) (LT s20535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 812 reset in 1929 ms.
Product exploration explored 100000 steps with 812 reset in 1858 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 349 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 6 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 9104 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9104 steps, saw 4515 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 6 properties.
[2022-05-18 09:35:05] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:35:07] [INFO ] Computed 1301 place invariants in 2683 ms
[2022-05-18 09:35:11] [INFO ] [Real]Absence check using 47 positive place invariants in 237 ms returned sat
[2022-05-18 09:35:12] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 805 ms returned sat
[2022-05-18 09:35:32] [INFO ] After 19834ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2022-05-18 09:35:32] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:35:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 09:35:32] [INFO ] After 25110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 19 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 548 places :
Symmetric choice reduction at 2 with 548 rule applications. Total rules 29396 place count 5588 transition count 8875
Iterating global reduction 2 with 548 rules applied. Total rules applied 29944 place count 5588 transition count 8875
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 2 with 50 rules applied. Total rules applied 29994 place count 5563 transition count 8850
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 2 with 336 rules applied. Total rules applied 30330 place count 5563 transition count 14542
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 2 with 336 rules applied. Total rules applied 30666 place count 5227 transition count 14542
Applied a total of 30666 rules in 4264 ms. Remains 5227 /20560 variables (removed 15333) and now considering 14542/29875 (removed 15333) transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/20560 places, 14542/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 753 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 18807 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18807 steps, saw 8901 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-18 09:35:41] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:35:41] [INFO ] Computed 1301 place invariants in 368 ms
[2022-05-18 09:35:42] [INFO ] [Real]Absence check using 49 positive place invariants in 76 ms returned sat
[2022-05-18 09:35:43] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 343 ms returned sat
[2022-05-18 09:35:53] [INFO ] After 11250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 09:35:54] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2022-05-18 09:35:54] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 373 ms returned sat
[2022-05-18 09:36:06] [INFO ] After 11304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 09:36:06] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:36:16] [INFO ] After 10150ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-18 09:36:27] [INFO ] Deduced a trap composed of 2 places in 9000 ms of which 7 ms to minimize.
[2022-05-18 09:36:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 09:36:27] [INFO ] After 34070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 5227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 876 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 870 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2022-05-18 09:36:29] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:36:29] [INFO ] Computed 1301 place invariants in 367 ms
[2022-05-18 09:36:34] [INFO ] Implicit Places using invariants in 5442 ms returned []
Implicit Place search using SMT only with invariants took 5443 ms to find 0 implicit places.
[2022-05-18 09:36:34] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:36:34] [INFO ] Computed 1301 place invariants in 370 ms
[2022-05-18 09:36:43] [INFO ] Dead Transitions using invariants and state equation in 8538 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5227 places, 14542/14542 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 421 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 485 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:36:44] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:36:47] [INFO ] Computed 1301 place invariants in 2704 ms
[2022-05-18 09:36:48] [INFO ] Implicit Places using invariants in 4315 ms returned []
Implicit Place search using SMT only with invariants took 4315 ms to find 0 implicit places.
[2022-05-18 09:36:48] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:36:51] [INFO ] Computed 1301 place invariants in 2622 ms
[2022-05-18 09:36:52] [INFO ] Dead Transitions using invariants and state equation in 4221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 9030 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9030 steps, saw 4477 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-18 09:36:57] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:37:00] [INFO ] Computed 1301 place invariants in 2686 ms
[2022-05-18 09:37:03] [INFO ] [Real]Absence check using 47 positive place invariants in 242 ms returned sat
[2022-05-18 09:37:04] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 815 ms returned sat
[2022-05-18 09:37:05] [INFO ] After 4987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 09:37:08] [INFO ] [Nat]Absence check using 47 positive place invariants in 192 ms returned sat
[2022-05-18 09:37:09] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 796 ms returned sat
[2022-05-18 09:37:30] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 20 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 12 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 548 places :
Symmetric choice reduction at 2 with 548 rule applications. Total rules 29396 place count 5588 transition count 8875
Iterating global reduction 2 with 548 rules applied. Total rules applied 29944 place count 5588 transition count 8875
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 29994 place count 5563 transition count 8850
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 2 with 336 rules applied. Total rules applied 30330 place count 5563 transition count 14542
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 2 with 336 rules applied. Total rules applied 30666 place count 5227 transition count 14542
Applied a total of 30666 rules in 4212 ms. Remains 5227 /20560 variables (removed 15333) and now considering 14542/29875 (removed 15333) transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/20560 places, 14542/29875 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 777 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 19120 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19120 steps, saw 9044 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-18 09:37:38] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:37:38] [INFO ] Computed 1301 place invariants in 402 ms
[2022-05-18 09:37:39] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2022-05-18 09:37:40] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 373 ms returned sat
[2022-05-18 09:37:50] [INFO ] After 11358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 09:37:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2022-05-18 09:37:51] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 356 ms returned sat
[2022-05-18 09:38:01] [INFO ] After 9440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 09:38:01] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:38:15] [INFO ] After 14121ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-18 09:38:15] [INFO ] After 14126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-18 09:38:15] [INFO ] After 25101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 5227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 877 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 877 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2022-05-18 09:38:17] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:38:17] [INFO ] Computed 1301 place invariants in 372 ms
[2022-05-18 09:38:22] [INFO ] Implicit Places using invariants in 5624 ms returned []
Implicit Place search using SMT only with invariants took 5626 ms to find 0 implicit places.
[2022-05-18 09:38:22] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:38:23] [INFO ] Computed 1301 place invariants in 380 ms
[2022-05-18 09:38:31] [INFO ] Dead Transitions using invariants and state equation in 8716 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5227 places, 14542/14542 transitions.
Graph (trivial) has 3629 edges and 5227 vertex of which 25 / 5227 are part of one of the 1 SCC in 7 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 55665 edges and 5203 vertex of which 5181 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.8 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 t12373.t14833 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 4795 transition count 12813
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 4553 transition count 12332
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 4312 transition count 11892
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 4072 transition count 11494
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 3872 transition count 11134
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 3674 transition count 10812
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 3512 transition count 10524
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 3352 transition count 10270
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 3224 transition count 10046
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 3098 transition count 9852
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 3000 transition count 9684
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 2904 transition count 9542
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 2832 transition count 9422
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 2762 transition count 9324
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 2712 transition count 9244
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 2664 transition count 9182
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 2632 transition count 9134
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 2602 transition count 9100
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 2584 transition count 9076
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 2568 transition count 9062
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 2560 transition count 9054
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 2553 transition count 9052
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2551 transition count 9052
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2551 transition count 8452
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 600 places
Reduce places removed 1200 places and 0 transitions.
Iterating global reduction 23 with 1800 rules applied. Total rules applied 8050 place count 1351 transition count 8452
Discarding 600 places :
Symmetric choice reduction at 23 with 600 rule applications. Total rules 8650 place count 751 transition count 7852
Iterating global reduction 23 with 600 rules applied. Total rules applied 9250 place count 751 transition count 7852
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9250 place count 751 transition count 7851
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9252 place count 750 transition count 7851
Discarding 550 places :
Symmetric choice reduction at 23 with 550 rule applications. Total rules 9802 place count 200 transition count 1251
Iterating global reduction 23 with 550 rules applied. Total rules applied 10352 place count 200 transition count 1251
Ensure Unique test removed 550 transitions
Reduce isomorphic transitions removed 550 transitions.
Iterating post reduction 23 with 550 rules applied. Total rules applied 10902 place count 200 transition count 701
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 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 24 with 52 rules applied. Total rules applied 10954 place count 173 transition count 676
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 10966 place count 173 transition count 664
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 10978 place count 161 transition count 664
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 10989 place count 150 transition count 532
Ensure Unique test removed 11 places
Iterating global reduction 25 with 22 rules applied. Total rules applied 11011 place count 139 transition count 532
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 11022 place count 139 transition count 521
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11033 place count 128 transition count 389
Iterating global reduction 26 with 11 rules applied. Total rules applied 11044 place count 128 transition count 389
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11055 place count 117 transition count 378
Iterating global reduction 26 with 11 rules applied. Total rules applied 11066 place count 117 transition count 378
Partial Free-agglomeration rule applied 288 times.
Drop transitions removed 288 transitions
Iterating global reduction 26 with 288 rules applied. Total rules applied 11354 place count 117 transition count 378
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11365 place count 106 transition count 246
Ensure Unique test removed 9 places
Iterating global reduction 26 with 20 rules applied. Total rules applied 11385 place count 97 transition count 246
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 11396 place count 97 transition count 235
Discarding 9 places :
Symmetric choice reduction at 27 with 9 rule applications. Total rules 11405 place count 88 transition count 127
Iterating global reduction 27 with 9 rules applied. Total rules applied 11414 place count 88 transition count 127
Discarding 9 places :
Symmetric choice reduction at 27 with 9 rule applications. Total rules 11423 place count 79 transition count 118
Iterating global reduction 27 with 9 rules applied. Total rules applied 11432 place count 79 transition count 118
Applied a total of 11432 rules in 11192 ms. Remains 79 /5227 variables (removed 5148) and now considering 118/14542 (removed 14424) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 118 rows 79 cols
[2022-05-18 09:38:42] [INFO ] Computed 29 place invariants in 4 ms
[2022-05-18 09:38:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 09:38:42] [INFO ] [Real]Absence check using 3 positive and 26 generalized place invariants in 4 ms returned sat
[2022-05-18 09:38:42] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 09:38:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 09:38:42] [INFO ] [Nat]Absence check using 3 positive and 26 generalized place invariants in 4 ms returned sat
[2022-05-18 09:38:42] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 09:38:42] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-18 09:38:43] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-18 09:38:43] [INFO ] Flatten gal took : 8 ms
[2022-05-18 09:38:43] [INFO ] Flatten gal took : 7 ms
[2022-05-18 09:38:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5657323694051280488.gal : 6 ms
[2022-05-18 09:38:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11952032486893137105.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8299137493121567755;'/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/ReachabilityCardinality5657323694051280488.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11952032486893137105.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/ReachabilityCardinality11952032486893137105.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :8 after 24
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :24 after 54
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :54 after 98
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :98 after 206
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :206 after 398
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :398 after 3205
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,12208,0.135866,8684,2,4736,12,13778,10,0,414,10617,0
Total reachable state count : 12208

Verifying 4 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,10,0.136568,8948,2,150,12,13778,10,0,417,10617,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,3,0.137117,8948,2,100,12,13778,10,0,419,10617,0
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,10,0.137329,8948,2,150,12,13778,10,0,419,10617,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,3,0.137665,8948,2,100,12,13778,10,0,421,10617,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 812 reset in 1753 ms.
Product exploration explored 100000 steps with 812 reset in 1783 ms.
Applying partial POR strategy [true, false, false, true, false, false]
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Performed 7200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 29875
Performed 625 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7825 places in 23 ms
Iterating global reduction 1 with 625 rules applied. Total rules applied 7825 place count 20560 transition count 29875
Deduced a syphon composed of 7825 places in 19 ms
Applied a total of 7825 rules in 5725 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:38:53] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:38:56] [INFO ] Computed 1301 place invariants in 2905 ms
[2022-05-18 09:38:58] [INFO ] Dead Transitions using invariants and state equation in 4535 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20560/20560 places, 29875/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Product exploration explored 100000 steps with 811 reset in 1867 ms.
Product exploration explored 100000 steps with 812 reset in 1857 ms.
Built C files in :
/tmp/ltsmin17122106655086622867
[2022-05-18 09:39:02] [INFO ] Built C files in 318ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17122106655086622867
Running compilation step : cd /tmp/ltsmin17122106655086622867;'/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/ltsmin17122106655086622867;'/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/ltsmin17122106655086622867;'/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 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 623 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:39:05] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:39:08] [INFO ] Computed 1301 place invariants in 2622 ms
[2022-05-18 09:39:10] [INFO ] Implicit Places using invariants in 4254 ms returned []
Implicit Place search using SMT only with invariants took 4266 ms to find 0 implicit places.
[2022-05-18 09:39:10] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:39:12] [INFO ] Computed 1301 place invariants in 2640 ms
[2022-05-18 09:39:14] [INFO ] Dead Transitions using invariants and state equation in 4241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Built C files in :
/tmp/ltsmin9921653398940657600
[2022-05-18 09:39:14] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9921653398940657600
Running compilation step : cd /tmp/ltsmin9921653398940657600;'/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/ltsmin9921653398940657600;'/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/ltsmin9921653398940657600;'/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 09:39:20] [INFO ] Flatten gal took : 1011 ms
[2022-05-18 09:39:21] [INFO ] Flatten gal took : 1050 ms
[2022-05-18 09:39:21] [INFO ] Time to serialize gal into /tmp/LTL18191212821291234515.gal : 174 ms
[2022-05-18 09:39:21] [INFO ] Time to serialize properties into /tmp/LTL14425523364807697955.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/LTL18191212821291234515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14425523364807697955.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/LTL1819121...268
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((Node11ManageTheCrashOfNode18<1)||(Rx10IsAtTheRightExtremityOfTheLeafSet<1))"))||(G("((Node21ManageTheCrashOfNode17<1)||(R...202
Formula 0 simplified : !XG(X"((Node11ManageTheCrashOfNode18<1)||(Rx10IsAtTheRightExtremityOfTheLeafSet<1))" | G"((Node21ManageTheCrashOfNode17<1)||(Rx11IsA...191
Detected timeout of ITS tools.
[2022-05-18 09:39:37] [INFO ] Flatten gal took : 931 ms
[2022-05-18 09:39:37] [INFO ] Applying decomposition
[2022-05-18 09:39:38] [INFO ] Flatten gal took : 803 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/graph8454679230327328687.txt' '-o' '/tmp/graph8454679230327328687.bin' '-w' '/tmp/graph8454679230327328687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8454679230327328687.bin' '-l' '-1' '-v' '-w' '/tmp/graph8454679230327328687.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:39:40] [INFO ] Decomposing Gal with order
[2022-05-18 09:39:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:39:49] [INFO ] Removed a total of 19022 redundant transitions.
[2022-05-18 09:39:50] [INFO ] Flatten gal took : 4802 ms
[2022-05-18 09:39:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1464 labels/synchronizations in 742 ms.
[2022-05-18 09:39:51] [INFO ] Time to serialize gal into /tmp/LTL5440429988231474574.gal : 217 ms
[2022-05-18 09:39:51] [INFO ] Time to serialize properties into /tmp/LTL15235030289940725171.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/LTL5440429988231474574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15235030289940725171.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/LTL5440429...246
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((i23.u65.Node11ManageTheCrashOfNode18<1)||(i11.u397.Rx10IsAtTheRightExtremityOfTheLeafSet<1))"))||(G("((i2.u289.Node21Mana...236
Formula 0 simplified : !XG(X"((i23.u65.Node11ManageTheCrashOfNode18<1)||(i11.u397.Rx10IsAtTheRightExtremityOfTheLeafSet<1))" | G"((i2.u289.Node21ManageTheC...225
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9164555591424938652
[2022-05-18 09:40:07] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9164555591424938652
Running compilation step : cd /tmp/ltsmin9164555591424938652;'/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/ltsmin9164555591424938652;'/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/ltsmin9164555591424938652;'/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-S24C12-LTLFireability-02 finished in 323047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1)||X(X(G(p2))))))'
Support contains 5 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 1288 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:40:11] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:40:15] [INFO ] Computed 1301 place invariants in 3554 ms
[2022-05-18 09:40:16] [INFO ] Implicit Places using invariants in 5146 ms returned []
Implicit Place search using SMT only with invariants took 5147 ms to find 0 implicit places.
[2022-05-18 09:40:16] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:40:19] [INFO ] Computed 1301 place invariants in 2632 ms
[2022-05-18 09:40:20] [INFO ] Dead Transitions using invariants and state equation in 4096 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(AND (GEQ s6890 1) (GEQ s7433 1)), p1:(GEQ s9498 1), p2:(AND (GEQ s6255 1) (GEQ s6689 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-03 finished in 10859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U (((X(p0)||p0)&&F(p1))||p1)))'
Support contains 5 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 681 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:40:21] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:40:24] [INFO ] Computed 1301 place invariants in 2706 ms
[2022-05-18 09:40:25] [INFO ] Implicit Places using invariants in 4181 ms returned []
Implicit Place search using SMT only with invariants took 4182 ms to find 0 implicit places.
[2022-05-18 09:40:25] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:40:28] [INFO ] Computed 1301 place invariants in 2864 ms
[2022-05-18 09:40:30] [INFO ] Dead Transitions using invariants and state equation in 4357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (AND p1 p0), p1, p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s11004 1) (GEQ s16746 1)), p0:(AND (GEQ s2782 1) (GEQ s17113 1) (GEQ s17116 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, null][false, false, false, false]]
Product exploration timeout after 59810 steps with 29905 reset in 10001 ms.
Product exploration timeout after 59360 steps with 29680 reset in 10001 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 p0)))
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-04 finished in 29610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)||p1))&&G(p2))))'
Support contains 5 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 669 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:40:51] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:40:54] [INFO ] Computed 1301 place invariants in 2783 ms
[2022-05-18 09:40:55] [INFO ] Implicit Places using invariants in 4314 ms returned []
Implicit Place search using SMT only with invariants took 4315 ms to find 0 implicit places.
[2022-05-18 09:40:55] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:40:58] [INFO ] Computed 1301 place invariants in 2843 ms
[2022-05-18 09:41:00] [INFO ] Dead Transitions using invariants and state equation in 4363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(AND (GEQ s8243 1) (GEQ s20103 1)), p1:(AND (GEQ s13000 1) (GEQ s13110 1)), p0:(GEQ s17501 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-05 finished in 9725 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (G(!(p1 U p2))||G(p3)||p3)))'
Support contains 7 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7187 transitions
Trivial Post-agglo rules discarded 7187 transitions
Performed 7187 trivial Post agglomeration. Transition count delta: 7187
Iterating post reduction 0 with 7187 rules applied. Total rules applied 7187 place count 20560 transition count 22688
Reduce places removed 7187 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14386 place count 13373 transition count 22676
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 599 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 599 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22077
Deduced a syphon composed of 599 places in 69 ms
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 3 with 1198 rules applied. Total rules applied 15596 place count 12762 transition count 22077
Discarding 6598 places :
Symmetric choice reduction at 3 with 6598 rule applications. Total rules 22194 place count 6164 transition count 15479
Iterating global reduction 3 with 6598 rules applied. Total rules applied 28792 place count 6164 transition count 15479
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 28792 place count 6164 transition count 15457
Deduced a syphon composed of 22 places in 11 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 28836 place count 6142 transition count 15457
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 29383 place count 5595 transition count 8893
Iterating global reduction 3 with 547 rules applied. Total rules applied 29930 place count 5595 transition count 8893
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 29980 place count 5570 transition count 8868
Applied a total of 29980 rules in 4099 ms. Remains 5570 /20560 variables (removed 14990) and now considering 8868/29875 (removed 21007) transitions.
[2022-05-18 09:41:04] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
// Phase 1: matrix 8268 rows 5570 cols
[2022-05-18 09:41:04] [INFO ] Computed 1301 place invariants in 247 ms
[2022-05-18 09:41:09] [INFO ] Implicit Places using invariants in 5021 ms returned []
[2022-05-18 09:41:09] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
// Phase 1: matrix 8268 rows 5570 cols
[2022-05-18 09:41:09] [INFO ] Computed 1301 place invariants in 237 ms
[2022-05-18 09:41:14] [INFO ] Implicit Places using invariants and state equation in 5085 ms returned []
Implicit Place search using SMT with State Equation took 10110 ms to find 0 implicit places.
[2022-05-18 09:41:15] [INFO ] Redundant transitions in 1052 ms returned []
[2022-05-18 09:41:15] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
// Phase 1: matrix 8268 rows 5570 cols
[2022-05-18 09:41:15] [INFO ] Computed 1301 place invariants in 241 ms
[2022-05-18 09:41:20] [INFO ] Dead Transitions using invariants and state equation in 5146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5570/20560 places, 8868/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 5570/20560 places, 8868/29875 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p2) p3), true, (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1387 1) (GEQ s3286 1)) (AND (GEQ s1162 1) (GEQ s5270 1))), p3:(AND (GEQ s4514 1) (GEQ s4541 1)), p2:(GEQ s3092 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 8 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-06 finished in 20566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((X((F(p1)&&p0))&&p1))) U p1)))'
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 698 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:41:21] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:41:24] [INFO ] Computed 1301 place invariants in 2770 ms
[2022-05-18 09:41:25] [INFO ] Implicit Places using invariants in 4231 ms returned []
Implicit Place search using SMT only with invariants took 4233 ms to find 0 implicit places.
[2022-05-18 09:41:25] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:41:28] [INFO ] Computed 1301 place invariants in 2779 ms
[2022-05-18 09:41:30] [INFO ] Dead Transitions using invariants and state equation in 4320 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s13778 1), p0:(AND (GEQ s5077 1) (GEQ s5187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-07 finished in 9503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p1)||p0))&&X(X(G(X(!p1))))))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 657 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:41:31] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:41:34] [INFO ] Computed 1301 place invariants in 2856 ms
[2022-05-18 09:41:35] [INFO ] Implicit Places using invariants in 4314 ms returned []
Implicit Place search using SMT only with invariants took 4315 ms to find 0 implicit places.
[2022-05-18 09:41:35] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:41:38] [INFO ] Computed 1301 place invariants in 2889 ms
[2022-05-18 09:41:39] [INFO ] Dead Transitions using invariants and state equation in 4357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, p1, p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(OR p0 p1), acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (GEQ s18685 1) (GEQ s20481 1)), p0:(OR (LT s17614 1) (LT s20238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 811 reset in 2310 ms.
Product exploration explored 100000 steps with 812 reset in 2088 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), 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 7 factoid took 250 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 123 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8670 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8670 steps, saw 4307 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 09:41:48] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:41:51] [INFO ] Computed 1301 place invariants in 2719 ms
[2022-05-18 09:41:53] [INFO ] [Real]Absence check using 47 positive place invariants in 208 ms returned sat
[2022-05-18 09:41:54] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 1040 ms returned sat
[2022-05-18 09:42:16] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 34 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 18 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29397 place count 5587 transition count 8863
Iterating global reduction 2 with 549 rules applied. Total rules applied 29946 place count 5587 transition count 8863
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 2 with 50 rules applied. Total rules applied 29996 place count 5562 transition count 8838
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 2 with 336 rules applied. Total rules applied 30332 place count 5562 transition count 14541
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 2 with 336 rules applied. Total rules applied 30668 place count 5226 transition count 14541
Applied a total of 30668 rules in 5177 ms. Remains 5226 /20560 variables (removed 15334) and now considering 14541/29875 (removed 15334) transitions.
Finished structural reductions, in 1 iterations. Remains : 5226/20560 places, 14541/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19408 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19408 steps, saw 9180 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 09:42:25] [INFO ] Flow matrix only has 13655 transitions (discarded 886 similar events)
// Phase 1: matrix 13655 rows 5226 cols
[2022-05-18 09:42:25] [INFO ] Computed 1301 place invariants in 468 ms
[2022-05-18 09:42:26] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-18 09:42:26] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 324 ms returned sat
[2022-05-18 09:42:37] [INFO ] After 12333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:42:38] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2022-05-18 09:42:38] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 338 ms returned sat
[2022-05-18 09:42:48] [INFO ] After 9490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 09:42:48] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:42:51] [INFO ] After 3370ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 09:43:00] [INFO ] Deduced a trap composed of 313 places in 8000 ms of which 6 ms to minimize.
[2022-05-18 09:43:12] [INFO ] Deduced a trap composed of 2 places in 9526 ms of which 6 ms to minimize.
[2022-05-18 09:43:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 09:43:12] [INFO ] After 34573ms 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 2 out of 5226 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5226/5226 places, 14541/14541 transitions.
Applied a total of 0 rules in 976 ms. Remains 5226 /5226 variables (removed 0) and now considering 14541/14541 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5226/5226 places, 14541/14541 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5226/5226 places, 14541/14541 transitions.
Applied a total of 0 rules in 949 ms. Remains 5226 /5226 variables (removed 0) and now considering 14541/14541 (removed 0) transitions.
[2022-05-18 09:43:14] [INFO ] Flow matrix only has 13655 transitions (discarded 886 similar events)
// Phase 1: matrix 13655 rows 5226 cols
[2022-05-18 09:43:14] [INFO ] Computed 1301 place invariants in 529 ms
[2022-05-18 09:43:19] [INFO ] Implicit Places using invariants in 5235 ms returned []
Implicit Place search using SMT only with invariants took 5236 ms to find 0 implicit places.
[2022-05-18 09:43:19] [INFO ] Flow matrix only has 13655 transitions (discarded 886 similar events)
// Phase 1: matrix 13655 rows 5226 cols
[2022-05-18 09:43:20] [INFO ] Computed 1301 place invariants in 393 ms
[2022-05-18 09:43:27] [INFO ] Dead Transitions using invariants and state equation in 7545 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5226/5226 places, 14541/14541 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), 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 7 factoid took 293 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 119 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 117 ms :[true, p1, p1, p1, p1]
Support contains 2 out of 20560 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 673 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:43:28] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:43:31] [INFO ] Computed 1301 place invariants in 2723 ms
[2022-05-18 09:43:32] [INFO ] Implicit Places using invariants in 4200 ms returned []
Implicit Place search using SMT only with invariants took 4201 ms to find 0 implicit places.
[2022-05-18 09:43:32] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:43:35] [INFO ] Computed 1301 place invariants in 2729 ms
[2022-05-18 09:43:36] [INFO ] Dead Transitions using invariants and state equation in 4204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 167 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 8521 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8521 steps, saw 4243 distinct states, run finished after 3001 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 09:43:40] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:43:43] [INFO ] Computed 1301 place invariants in 2716 ms
[2022-05-18 09:43:45] [INFO ] [Real]Absence check using 47 positive place invariants in 279 ms returned sat
[2022-05-18 09:43:46] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 920 ms returned sat
[2022-05-18 09:44:08] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 31 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 15 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29397 place count 5587 transition count 8863
Iterating global reduction 2 with 549 rules applied. Total rules applied 29946 place count 5587 transition count 8863
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 2 with 50 rules applied. Total rules applied 29996 place count 5562 transition count 8838
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 2 with 336 rules applied. Total rules applied 30332 place count 5562 transition count 14541
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 2 with 336 rules applied. Total rules applied 30668 place count 5226 transition count 14541
Applied a total of 30668 rules in 5229 ms. Remains 5226 /20560 variables (removed 15334) and now considering 14541/29875 (removed 15334) transitions.
Finished structural reductions, in 1 iterations. Remains : 5226/20560 places, 14541/29875 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 19005 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19005 steps, saw 8992 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 09:44:17] [INFO ] Flow matrix only has 13655 transitions (discarded 886 similar events)
// Phase 1: matrix 13655 rows 5226 cols
[2022-05-18 09:44:17] [INFO ] Computed 1301 place invariants in 385 ms
[2022-05-18 09:44:18] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2022-05-18 09:44:18] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 366 ms returned sat
[2022-05-18 09:44:31] [INFO ] After 13972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:44:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2022-05-18 09:44:32] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 339 ms returned sat
[2022-05-18 09:44:42] [INFO ] After 10005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 09:44:42] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:44:46] [INFO ] After 3547ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 09:44:54] [INFO ] Deduced a trap composed of 313 places in 7756 ms of which 6 ms to minimize.
[2022-05-18 09:44:56] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 10278 ms
[2022-05-18 09:44:56] [INFO ] After 13993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-18 09:44:56] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 5226 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5226/5226 places, 14541/14541 transitions.
Applied a total of 0 rules in 985 ms. Remains 5226 /5226 variables (removed 0) and now considering 14541/14541 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5226/5226 places, 14541/14541 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5226/5226 places, 14541/14541 transitions.
Applied a total of 0 rules in 961 ms. Remains 5226 /5226 variables (removed 0) and now considering 14541/14541 (removed 0) transitions.
[2022-05-18 09:44:58] [INFO ] Flow matrix only has 13655 transitions (discarded 886 similar events)
// Phase 1: matrix 13655 rows 5226 cols
[2022-05-18 09:44:59] [INFO ] Computed 1301 place invariants in 386 ms
[2022-05-18 09:45:03] [INFO ] Implicit Places using invariants in 5095 ms returned []
Implicit Place search using SMT only with invariants took 5097 ms to find 0 implicit places.
[2022-05-18 09:45:03] [INFO ] Flow matrix only has 13655 transitions (discarded 886 similar events)
// Phase 1: matrix 13655 rows 5226 cols
[2022-05-18 09:45:04] [INFO ] Computed 1301 place invariants in 409 ms
[2022-05-18 09:45:11] [INFO ] Dead Transitions using invariants and state equation in 7592 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5226/5226 places, 14541/14541 transitions.
Graph (trivial) has 3629 edges and 5226 vertex of which 25 / 5226 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 55709 edges and 5202 vertex of which 5180 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 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 t12373.t14833 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 4794 transition count 12812
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 4552 transition count 12331
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 4311 transition count 11891
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 4071 transition count 11493
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 3871 transition count 11133
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 3673 transition count 10811
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 3511 transition count 10523
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 3351 transition count 10269
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 3223 transition count 10045
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 3097 transition count 9851
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 2999 transition count 9683
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 2903 transition count 9541
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 2831 transition count 9421
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 2761 transition count 9323
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 2711 transition count 9243
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 2663 transition count 9181
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 2631 transition count 9133
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 2601 transition count 9099
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 2583 transition count 9075
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 2567 transition count 9061
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 2559 transition count 9053
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 2552 transition count 9051
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2550 transition count 9051
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2550 transition count 8451
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 600 places
Reduce places removed 1200 places and 0 transitions.
Iterating global reduction 23 with 1800 rules applied. Total rules applied 8050 place count 1350 transition count 8451
Discarding 600 places :
Symmetric choice reduction at 23 with 600 rule applications. Total rules 8650 place count 750 transition count 7851
Iterating global reduction 23 with 600 rules applied. Total rules applied 9250 place count 750 transition count 7851
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9250 place count 750 transition count 7850
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9252 place count 749 transition count 7850
Discarding 551 places :
Symmetric choice reduction at 23 with 551 rule applications. Total rules 9803 place count 198 transition count 1238
Iterating global reduction 23 with 551 rules applied. Total rules applied 10354 place count 198 transition count 1238
Ensure Unique test removed 551 transitions
Reduce isomorphic transitions removed 551 transitions.
Iterating post reduction 23 with 551 rules applied. Total rules applied 10905 place count 198 transition count 687
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 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 24 with 52 rules applied. Total rules applied 10957 place count 171 transition count 662
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 10969 place count 171 transition count 650
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 10981 place count 159 transition count 650
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 10992 place count 148 transition count 518
Ensure Unique test removed 11 places
Iterating global reduction 25 with 22 rules applied. Total rules applied 11014 place count 137 transition count 518
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 11025 place count 137 transition count 507
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11036 place count 126 transition count 375
Iterating global reduction 26 with 11 rules applied. Total rules applied 11047 place count 126 transition count 375
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11058 place count 115 transition count 364
Iterating global reduction 26 with 11 rules applied. Total rules applied 11069 place count 115 transition count 364
Partial Free-agglomeration rule applied 288 times.
Drop transitions removed 288 transitions
Iterating global reduction 26 with 288 rules applied. Total rules applied 11357 place count 115 transition count 364
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11368 place count 104 transition count 232
Ensure Unique test removed 10 places
Iterating global reduction 26 with 21 rules applied. Total rules applied 11389 place count 94 transition count 232
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 11400 place count 94 transition count 221
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11410 place count 84 transition count 101
Iterating global reduction 27 with 10 rules applied. Total rules applied 11420 place count 84 transition count 101
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11430 place count 74 transition count 91
Iterating global reduction 27 with 10 rules applied. Total rules applied 11440 place count 74 transition count 91
Applied a total of 11440 rules in 12246 ms. Remains 74 /5226 variables (removed 5152) and now considering 91/14541 (removed 14450) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 74 cols
[2022-05-18 09:45:23] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-18 09:45:23] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 09:45:23] [INFO ] [Real]Absence check using 3 positive and 25 generalized place invariants in 4 ms returned sat
[2022-05-18 09:45:23] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:45:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 09:45:23] [INFO ] [Nat]Absence check using 3 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-18 09:45:23] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 09:45:23] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-18 09:45:23] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 09:45:23] [INFO ] Flatten gal took : 5 ms
[2022-05-18 09:45:23] [INFO ] Flatten gal took : 4 ms
[2022-05-18 09:45:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10686493892670311232.gal : 1 ms
[2022-05-18 09:45:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18285954853842519614.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3248463269488905132;'/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/ReachabilityCardinality10686493892670311232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18285954853842519614.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality18285954853842519614.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 205
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :205 after 1168
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1168 after 1928
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,4665,0.141963,8556,2,4929,12,11437,7,0,362,8872,0
Total reachable state count : 4665

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,8,0.142791,8556,2,173,12,11437,7,0,365,8872,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(NOT p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 122 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 161 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 116 ms :[true, p1, p1, p1, p1]
Product exploration explored 100000 steps with 812 reset in 1895 ms.
Product exploration explored 100000 steps with 812 reset in 1958 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 114 ms :[true, p1, p1, p1, p1]
Support contains 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Performed 7200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 29875
Performed 625 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7825 places in 39 ms
Iterating global reduction 1 with 625 rules applied. Total rules applied 7825 place count 20560 transition count 29875
Deduced a syphon composed of 7825 places in 22 ms
Applied a total of 7825 rules in 5582 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:45:34] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:45:37] [INFO ] Computed 1301 place invariants in 2872 ms
[2022-05-18 09:45:38] [INFO ] Dead Transitions using invariants and state equation in 4342 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20560/20560 places, 29875/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Product exploration explored 100000 steps with 1013 reset in 4970 ms.
Product exploration explored 100000 steps with 1014 reset in 4349 ms.
Built C files in :
/tmp/ltsmin4781059523551993649
[2022-05-18 09:45:48] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4781059523551993649
Running compilation step : cd /tmp/ltsmin4781059523551993649;'/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/ltsmin4781059523551993649;'/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/ltsmin4781059523551993649;'/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 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 852 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:45:52] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:45:55] [INFO ] Computed 1301 place invariants in 3629 ms
[2022-05-18 09:45:58] [INFO ] Implicit Places using invariants in 5961 ms returned []
Implicit Place search using SMT only with invariants took 5961 ms to find 0 implicit places.
[2022-05-18 09:45:58] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:46:01] [INFO ] Computed 1301 place invariants in 3769 ms
[2022-05-18 09:46:04] [INFO ] Dead Transitions using invariants and state equation in 6148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Built C files in :
/tmp/ltsmin11893631125570434967
[2022-05-18 09:46:04] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11893631125570434967
Running compilation step : cd /tmp/ltsmin11893631125570434967;'/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/ltsmin11893631125570434967;'/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/ltsmin11893631125570434967;'/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 09:46:09] [INFO ] Flatten gal took : 1279 ms
[2022-05-18 09:46:11] [INFO ] Flatten gal took : 1419 ms
[2022-05-18 09:46:11] [INFO ] Time to serialize gal into /tmp/LTL11203025193925104470.gal : 190 ms
[2022-05-18 09:46:11] [INFO ] Time to serialize properties into /tmp/LTL3015408765902112424.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/LTL11203025193925104470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3015408765902112424.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/LTL1120302...267
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-18 09:46:27] [INFO ] Flatten gal took : 1156 ms
[2022-05-18 09:46:27] [INFO ] Applying decomposition
[2022-05-18 09:46:29] [INFO ] Flatten gal took : 1485 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/graph1830271190521237762.txt' '-o' '/tmp/graph1830271190521237762.bin' '-w' '/tmp/graph1830271190521237762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1830271190521237762.bin' '-l' '-1' '-v' '-w' '/tmp/graph1830271190521237762.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:46:32] [INFO ] Decomposing Gal with order
[2022-05-18 09:46:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:46:44] [INFO ] Removed a total of 18845 redundant transitions.
[2022-05-18 09:46:44] [INFO ] Flatten gal took : 5925 ms
[2022-05-18 09:46:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1919 labels/synchronizations in 579 ms.
[2022-05-18 09:46:46] [INFO ] Time to serialize gal into /tmp/LTL9313225590642608072.gal : 246 ms
[2022-05-18 09:46:46] [INFO ] Time to serialize properties into /tmp/LTL8830351964896535209.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/LTL9313225590642608072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8830351964896535209.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/LTL9313225...245
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12539144375721927995
[2022-05-18 09:47:01] [INFO ] Built C files in 337ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12539144375721927995
Running compilation step : cd /tmp/ltsmin12539144375721927995;'/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/ltsmin12539144375721927995;'/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/ltsmin12539144375721927995;'/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-S24C12-LTLFireability-08 finished in 334517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1) U G((F(p2)||X(p3)))))'
Support contains 5 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 1181 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:47:06] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:47:11] [INFO ] Computed 1301 place invariants in 4871 ms
[2022-05-18 09:47:23] [INFO ] Implicit Places using invariants in 17132 ms returned []
Implicit Place search using SMT only with invariants took 17136 ms to find 0 implicit places.
[2022-05-18 09:47:23] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:47:30] [INFO ] Computed 1301 place invariants in 6774 ms
[2022-05-18 09:47:36] [INFO ] Dead Transitions using invariants and state equation in 12966 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 780 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), false, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=7 dest: 2}, { cond=(OR (AND (NOT p2) p1 p3) (AND (NOT p2) (NOT p0) p3)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=7 dest: 4}, { cond=(OR (AND (NOT p2) p1 p3) (AND (NOT p2) (NOT p0) p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 4}, { cond=(NOT p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s11342 1), p0:(AND (GEQ s5756 1) (GEQ s20400 1)), p2:(AND (GEQ s17010 1) (GEQ s20400 1)), p3:(GEQ s20451 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-09 finished in 32250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(p0)))))'
Support contains 1 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 61 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 28 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29391 place count 5590 transition count 8866
Iterating global reduction 2 with 549 rules applied. Total rules applied 29940 place count 5590 transition count 8866
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 29990 place count 5565 transition count 8841
Applied a total of 29990 rules in 10106 ms. Remains 5565 /20560 variables (removed 14995) and now considering 8841/29875 (removed 21034) transitions.
[2022-05-18 09:47:47] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:47:47] [INFO ] Computed 1301 place invariants in 330 ms
[2022-05-18 09:47:48] [INFO ] Implicit Places using invariants in 919 ms returned []
[2022-05-18 09:47:48] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:47:48] [INFO ] Computed 1301 place invariants in 473 ms
[2022-05-18 09:47:49] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2022-05-18 09:47:51] [INFO ] Redundant transitions in 1942 ms returned []
[2022-05-18 09:47:51] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:47:51] [INFO ] Computed 1301 place invariants in 598 ms
[2022-05-18 09:47:52] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5565/20560 places, 8841/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 5565/20560 places, 8841/29875 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2871 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1158 reset in 2009 ms.
Product exploration explored 100000 steps with 1155 reset in 2139 ms.
Computed a total of 2966 stabilizing places and 3665 stable transitions
Computed a total of 2966 stabilizing places and 3665 stable transitions
Detected a total of 2966/5565 stabilizing places and 3665/8841 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 20970 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20970 steps, saw 10070 distinct states, run finished after 3017 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 09:48:00] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:48:01] [INFO ] Computed 1301 place invariants in 528 ms
[2022-05-18 09:48:01] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2022-05-18 09:48:02] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 412 ms returned sat
[2022-05-18 09:48:12] [INFO ] After 10343ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 09:48:12] [INFO ] State equation strengthened by 3163 read => feed constraints.
[2022-05-18 09:48:14] [INFO ] After 1460ms SMT Verify possible using 3163 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:48:14] [INFO ] After 13064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:48:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2022-05-18 09:48:15] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 469 ms returned sat
[2022-05-18 09:48:30] [INFO ] After 15160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 09:48:42] [INFO ] After 11641ms SMT Verify possible using 3163 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-05-18 09:48:42] [INFO ] After 28121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 5565 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5565/5565 places, 8841/8841 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5565 transition count 14543
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5228 transition count 14543
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 5228 transition count 14543
Applied a total of 699 rules in 4274 ms. Remains 5228 /5565 variables (removed 337) and now considering 14543/8841 (removed -5702) transitions.
Finished structural reductions, in 1 iterations. Remains : 5228/5565 places, 14543/8841 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1535 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10556 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 10556 steps, saw 5215 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 09:48:51] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2022-05-18 09:48:52] [INFO ] Computed 1301 place invariants in 830 ms
[2022-05-18 09:48:53] [INFO ] [Real]Absence check using 49 positive place invariants in 177 ms returned sat
[2022-05-18 09:48:54] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 608 ms returned sat
[2022-05-18 09:49:10] [INFO ] After 16716ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 09:49:11] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:49:14] [INFO ] After 3276ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:49:14] [INFO ] After 22020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:49:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 118 ms returned sat
[2022-05-18 09:49:15] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 435 ms returned sat
[2022-05-18 09:49:32] [INFO ] After 17020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 09:49:39] [INFO ] After 6811ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 09:49:39] [INFO ] After 6812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-18 09:49:39] [INFO ] After 25103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 5228 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 1742 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5228/5228 places, 14543/14543 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 1544 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
[2022-05-18 09:49:42] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2022-05-18 09:49:43] [INFO ] Computed 1301 place invariants in 675 ms
[2022-05-18 09:49:44] [INFO ] Implicit Places using invariants in 1273 ms returned []
Implicit Place search using SMT only with invariants took 1273 ms to find 0 implicit places.
[2022-05-18 09:49:44] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2022-05-18 09:49:44] [INFO ] Computed 1301 place invariants in 640 ms
[2022-05-18 09:49:45] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5228/5228 places, 14543/14543 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 332 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0)]
Support contains 1 out of 5565 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5565/5565 places, 8841/8841 transitions.
Applied a total of 0 rules in 705 ms. Remains 5565 /5565 variables (removed 0) and now considering 8841/8841 (removed 0) transitions.
[2022-05-18 09:49:46] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:49:47] [INFO ] Computed 1301 place invariants in 373 ms
[2022-05-18 09:49:48] [INFO ] Implicit Places using invariants in 1220 ms returned []
[2022-05-18 09:49:48] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:49:48] [INFO ] Computed 1301 place invariants in 382 ms
[2022-05-18 09:49:49] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 2452 ms to find 0 implicit places.
[2022-05-18 09:49:50] [INFO ] Redundant transitions in 1559 ms returned []
[2022-05-18 09:49:50] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:49:51] [INFO ] Computed 1301 place invariants in 249 ms
[2022-05-18 09:49:51] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5565/5565 places, 8841/8841 transitions.
Computed a total of 2966 stabilizing places and 3665 stable transitions
Computed a total of 2966 stabilizing places and 3665 stable transitions
Detected a total of 2966/5565 stabilizing places and 3665/8841 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 17763 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 17763 steps, saw 8606 distinct states, run finished after 3001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 09:49:55] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:49:56] [INFO ] Computed 1301 place invariants in 252 ms
[2022-05-18 09:49:57] [INFO ] [Real]Absence check using 49 positive place invariants in 152 ms returned sat
[2022-05-18 09:49:58] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 783 ms returned sat
[2022-05-18 09:50:08] [INFO ] After 10565ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 09:50:08] [INFO ] State equation strengthened by 3163 read => feed constraints.
[2022-05-18 09:50:10] [INFO ] After 1015ms SMT Verify possible using 3163 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:50:10] [INFO ] After 13775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:50:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 158 ms returned sat
[2022-05-18 09:50:11] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 839 ms returned sat
[2022-05-18 09:50:22] [INFO ] After 10899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 09:50:26] [INFO ] After 3940ms SMT Verify possible using 3163 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 09:50:38] [INFO ] Deduced a trap composed of 630 places in 10981 ms of which 9 ms to minimize.
[2022-05-18 09:50:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 09:50:38] [INFO ] After 28368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 5565 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5565/5565 places, 8841/8841 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5565 transition count 14543
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5228 transition count 14543
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 5228 transition count 14543
Applied a total of 699 rules in 4116 ms. Remains 5228 /5565 variables (removed 337) and now considering 14543/8841 (removed -5702) transitions.
Finished structural reductions, in 1 iterations. Remains : 5228/5565 places, 14543/8841 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 1037 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12519 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12519 steps, saw 6087 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 09:50:46] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2022-05-18 09:50:47] [INFO ] Computed 1301 place invariants in 569 ms
[2022-05-18 09:50:48] [INFO ] [Real]Absence check using 49 positive place invariants in 186 ms returned sat
[2022-05-18 09:50:49] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 768 ms returned sat
[2022-05-18 09:51:04] [INFO ] After 15692ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 09:51:05] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:51:08] [INFO ] After 3537ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:51:08] [INFO ] After 21306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 09:51:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 175 ms returned sat
[2022-05-18 09:51:10] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 760 ms returned sat
[2022-05-18 09:51:25] [INFO ] After 15062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 09:51:32] [INFO ] After 6667ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 09:51:33] [INFO ] After 7807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 189 ms.
[2022-05-18 09:51:33] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 5228 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 1775 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5228/5228 places, 14543/14543 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5228/5228 places, 14543/14543 transitions.
Applied a total of 0 rules in 1489 ms. Remains 5228 /5228 variables (removed 0) and now considering 14543/14543 (removed 0) transitions.
[2022-05-18 09:51:36] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2022-05-18 09:51:37] [INFO ] Computed 1301 place invariants in 721 ms
[2022-05-18 09:51:38] [INFO ] Implicit Places using invariants in 1492 ms returned []
Implicit Place search using SMT only with invariants took 1502 ms to find 0 implicit places.
[2022-05-18 09:51:38] [INFO ] Flow matrix only has 13657 transitions (discarded 886 similar events)
// Phase 1: matrix 13657 rows 5228 cols
[2022-05-18 09:51:39] [INFO ] Computed 1301 place invariants in 642 ms
[2022-05-18 09:51:39] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5228/5228 places, 14543/14543 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 297 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1156 reset in 1898 ms.
Product exploration explored 100000 steps with 1157 reset in 1765 ms.
Built C files in :
/tmp/ltsmin5465100131695520708
[2022-05-18 09:51:43] [INFO ] Too many transitions (8841) to apply POR reductions. Disabling POR matrices.
[2022-05-18 09:51:44] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5465100131695520708
Running compilation step : cd /tmp/ltsmin5465100131695520708;'/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/ltsmin5465100131695520708;'/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/ltsmin5465100131695520708;'/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 5565 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5565/5565 places, 8841/8841 transitions.
Applied a total of 0 rules in 1061 ms. Remains 5565 /5565 variables (removed 0) and now considering 8841/8841 (removed 0) transitions.
[2022-05-18 09:51:48] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:51:48] [INFO ] Computed 1301 place invariants in 539 ms
[2022-05-18 09:51:49] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2022-05-18 09:51:49] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:51:49] [INFO ] Computed 1301 place invariants in 380 ms
[2022-05-18 09:51:50] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 2339 ms to find 0 implicit places.
[2022-05-18 09:51:53] [INFO ] Redundant transitions in 2554 ms returned []
[2022-05-18 09:51:53] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2022-05-18 09:51:53] [INFO ] Computed 1301 place invariants in 502 ms
[2022-05-18 09:51:54] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5565/5565 places, 8841/8841 transitions.
Built C files in :
/tmp/ltsmin18259421517787255405
[2022-05-18 09:51:54] [INFO ] Too many transitions (8841) to apply POR reductions. Disabling POR matrices.
[2022-05-18 09:51:54] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18259421517787255405
Running compilation step : cd /tmp/ltsmin18259421517787255405;'/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/ltsmin18259421517787255405;'/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/ltsmin18259421517787255405;'/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 09:51:59] [INFO ] Flatten gal took : 435 ms
[2022-05-18 09:51:59] [INFO ] Flatten gal took : 533 ms
[2022-05-18 09:51:59] [INFO ] Time to serialize gal into /tmp/LTL4457971963796753670.gal : 119 ms
[2022-05-18 09:51:59] [INFO ] Time to serialize properties into /tmp/LTL12277245388610867800.ltl : 4 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/LTL4457971963796753670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12277245388610867800.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/LTL4457971...267
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G("(Node16HasTheLeafSetOfLx10ToReplaceNode4<1)"))))))
Formula 0 simplified : !FGXG"(Node16HasTheLeafSetOfLx10ToReplaceNode4<1)"
Detected timeout of ITS tools.
[2022-05-18 09:52:15] [INFO ] Flatten gal took : 633 ms
[2022-05-18 09:52:15] [INFO ] Applying decomposition
[2022-05-18 09:52:16] [INFO ] Flatten gal took : 568 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/graph7755433446239307006.txt' '-o' '/tmp/graph7755433446239307006.bin' '-w' '/tmp/graph7755433446239307006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7755433446239307006.bin' '-l' '-1' '-v' '-w' '/tmp/graph7755433446239307006.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:52:18] [INFO ] Decomposing Gal with order
[2022-05-18 09:52:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:52:23] [INFO ] Removed a total of 7446 redundant transitions.
[2022-05-18 09:52:23] [INFO ] Flatten gal took : 3429 ms
[2022-05-18 09:52:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 5469 labels/synchronizations in 973 ms.
[2022-05-18 09:52:25] [INFO ] Time to serialize gal into /tmp/LTL6807780716718233152.gal : 108 ms
[2022-05-18 09:52:25] [INFO ] Time to serialize properties into /tmp/LTL11379084154032268726.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/LTL6807780716718233152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11379084154032268726.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/LTL6807780...246
Read 1 LTL properties
Checking formula 0 : !((F(G(X(G("(i18.u386.Node16HasTheLeafSetOfLx10ToReplaceNode4<1)"))))))
Formula 0 simplified : !FGXG"(i18.u386.Node16HasTheLeafSetOfLx10ToReplaceNode4<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8297479316435039001
[2022-05-18 09:52:40] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8297479316435039001
Running compilation step : cd /tmp/ltsmin8297479316435039001;'/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/ltsmin8297479316435039001;'/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/ltsmin8297479316435039001;'/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-S24C12-LTLFireability-11 finished in 306433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U p2)))'
Support contains 7 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 1809 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2022-05-18 09:52:45] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:52:53] [INFO ] Computed 1301 place invariants in 7819 ms
[2022-05-18 09:53:19] [INFO ] Implicit Places using invariants in 33650 ms returned []
Implicit Place search using SMT only with invariants took 33652 ms to find 0 implicit places.
[2022-05-18 09:53:19] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2022-05-18 09:53:37] [INFO ] Computed 1301 place invariants in 17907 ms
[2022-05-18 09:53:58] [INFO ] Dead Transitions using invariants and state equation in 39437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 696 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (AND (GEQ s10295 1) (GEQ s11001 1)) (AND (GEQ s5695 1) (GEQ s5991 1))), p2:(AND (GEQ s1522 1) (GEQ s3627 1)), p1:(GEQ s20411 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-12 finished in 75943 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 44 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 24 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 29398 place count 5586 transition count 8851
Iterating global reduction 2 with 550 rules applied. Total rules applied 29948 place count 5586 transition count 8851
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 2 with 50 rules applied. Total rules applied 29998 place count 5561 transition count 8826
Applied a total of 29998 rules in 6609 ms. Remains 5561 /20560 variables (removed 14999) and now considering 8826/29875 (removed 21049) transitions.
[2022-05-18 09:54:06] [INFO ] Flow matrix only has 8226 transitions (discarded 600 similar events)
// Phase 1: matrix 8226 rows 5561 cols
[2022-05-18 09:54:06] [INFO ] Computed 1301 place invariants in 484 ms
[2022-05-18 09:54:07] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2022-05-18 09:54:07] [INFO ] Flow matrix only has 8226 transitions (discarded 600 similar events)
// Phase 1: matrix 8226 rows 5561 cols
[2022-05-18 09:54:07] [INFO ] Computed 1301 place invariants in 255 ms
[2022-05-18 09:54:08] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
[2022-05-18 09:54:10] [INFO ] Redundant transitions in 1956 ms returned []
[2022-05-18 09:54:10] [INFO ] Flow matrix only has 8226 transitions (discarded 600 similar events)
// Phase 1: matrix 8226 rows 5561 cols
[2022-05-18 09:54:11] [INFO ] Computed 1301 place invariants in 482 ms
[2022-05-18 09:54:12] [INFO ] Dead Transitions using invariants and state equation in 1479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5561/20560 places, 8826/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 5561/20560 places, 8826/29875 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s3116 1) (GEQ s3556 1)) (AND (GEQ s2617 1) (GEQ s2897 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-13 finished in 12593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(!(F(p0) U G((!G(p1)||!F(!p2)))))))'
Support contains 6 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7176 transitions
Trivial Post-agglo rules discarded 7176 transitions
Performed 7176 trivial Post agglomeration. Transition count delta: 7176
Iterating post reduction 0 with 7176 rules applied. Total rules applied 7176 place count 20560 transition count 22699
Reduce places removed 7176 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14376 place count 13384 transition count 22675
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 598 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 598 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22077
Deduced a syphon composed of 598 places in 67 ms
Reduce places removed 598 places and 0 transitions.
Iterating global reduction 3 with 1196 rules applied. Total rules applied 15596 place count 12762 transition count 22077
Discarding 6598 places :
Symmetric choice reduction at 3 with 6598 rule applications. Total rules 22194 place count 6164 transition count 15479
Iterating global reduction 3 with 6598 rules applied. Total rules applied 28792 place count 6164 transition count 15479
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 28792 place count 6164 transition count 15457
Deduced a syphon composed of 22 places in 24 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 28836 place count 6142 transition count 15457
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 29383 place count 5595 transition count 8893
Iterating global reduction 3 with 547 rules applied. Total rules applied 29930 place count 5595 transition count 8893
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 16 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29980 place count 5570 transition count 8868
Applied a total of 29980 rules in 7040 ms. Remains 5570 /20560 variables (removed 14990) and now considering 8868/29875 (removed 21007) transitions.
[2022-05-18 09:54:19] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
// Phase 1: matrix 8268 rows 5570 cols
[2022-05-18 09:54:19] [INFO ] Computed 1301 place invariants in 490 ms
[2022-05-18 09:54:26] [INFO ] Implicit Places using invariants in 6716 ms returned []
[2022-05-18 09:54:26] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
// Phase 1: matrix 8268 rows 5570 cols
[2022-05-18 09:54:26] [INFO ] Computed 1301 place invariants in 405 ms
[2022-05-18 09:54:34] [INFO ] Implicit Places using invariants and state equation in 8142 ms returned []
Implicit Place search using SMT with State Equation took 14861 ms to find 0 implicit places.
[2022-05-18 09:54:36] [INFO ] Redundant transitions in 2096 ms returned []
[2022-05-18 09:54:36] [INFO ] Flow matrix only has 8268 transitions (discarded 600 similar events)
// Phase 1: matrix 8268 rows 5570 cols
[2022-05-18 09:54:36] [INFO ] Computed 1301 place invariants in 459 ms
[2022-05-18 09:54:37] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5570/20560 places, 8868/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 5570/20560 places, 8868/29875 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), (NOT p1), p2]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s2374 1) (GEQ s5513 1)), p1:(AND (GEQ s4115 1) (GEQ s4220 1)), p2:(AND (GEQ s659 1) (GEQ s688 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-14 finished in 25598 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||G(p1)))))'
Found a SL insensitive property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-02
Stuttering acceptance computed with spot in 362 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7200 transitions
Trivial Post-agglo rules discarded 7200 transitions
Performed 7200 trivial Post agglomeration. Transition count delta: 7200
Iterating post reduction 0 with 7200 rules applied. Total rules applied 7200 place count 20560 transition count 22675
Reduce places removed 7200 places and 0 transitions.
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 32 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6600 places :
Symmetric choice reduction at 2 with 6600 rule applications. Total rules 22200 place count 6160 transition count 15475
Iterating global reduction 2 with 6600 rules applied. Total rules applied 28800 place count 6160 transition count 15475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 28800 place count 6160 transition count 15451
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 28848 place count 6136 transition count 15451
Discarding 548 places :
Symmetric choice reduction at 2 with 548 rule applications. Total rules 29396 place count 5588 transition count 8875
Iterating global reduction 2 with 548 rules applied. Total rules applied 29944 place count 5588 transition count 8875
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 29994 place count 5563 transition count 8850
Applied a total of 29994 rules in 5650 ms. Remains 5563 /20560 variables (removed 14997) and now considering 8850/29875 (removed 21025) transitions.
[2022-05-18 09:54:44] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:54:44] [INFO ] Computed 1301 place invariants in 489 ms
[2022-05-18 09:54:45] [INFO ] Implicit Places using invariants in 1042 ms returned []
[2022-05-18 09:54:45] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:54:45] [INFO ] Computed 1301 place invariants in 353 ms
[2022-05-18 09:54:46] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
[2022-05-18 09:54:46] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:54:46] [INFO ] Computed 1301 place invariants in 346 ms
[2022-05-18 09:54:47] [INFO ] Dead Transitions using invariants and state equation in 1098 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 5563/20560 places, 8850/29875 transitions.
Finished structural reductions, in 1 iterations. Remains : 5563/20560 places, 8850/29875 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s2367 1) (LT s5535 1)), p1:(OR (LT s3881 1) (LT s5562 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1157 reset in 1695 ms.
Product exploration explored 100000 steps with 1156 reset in 1899 ms.
Computed a total of 2964 stabilizing places and 3674 stable transitions
Computed a total of 2964 stabilizing places and 3674 stable transitions
Detected a total of 2964/5563 stabilizing places and 3674/8850 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 806 ms. Reduced automaton from 6 states, 13 edges and 2 AP to 6 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 17342 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 17342 steps, saw 8411 distinct states, run finished after 3001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 6 properties.
[2022-05-18 09:54:56] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:54:56] [INFO ] Computed 1301 place invariants in 407 ms
[2022-05-18 09:54:58] [INFO ] [Real]Absence check using 49 positive place invariants in 102 ms returned sat
[2022-05-18 09:54:58] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 534 ms returned sat
[2022-05-18 09:55:07] [INFO ] After 11115ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-05-18 09:55:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 92 ms returned sat
[2022-05-18 09:55:09] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 388 ms returned sat
[2022-05-18 09:55:21] [INFO ] After 11734ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-05-18 09:55:21] [INFO ] State equation strengthened by 3174 read => feed constraints.
[2022-05-18 09:55:26] [INFO ] After 4825ms SMT Verify possible using 3174 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2022-05-18 09:55:34] [INFO ] Deduced a trap composed of 811 places in 6440 ms of which 6 ms to minimize.
[2022-05-18 09:55:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 09:55:34] [INFO ] After 26618ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:5
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 5563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5563/5563 places, 8850/8850 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 5563 transition count 14542
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 5227 transition count 14542
Applied a total of 672 rules in 1833 ms. Remains 5227 /5563 variables (removed 336) and now considering 14542/8850 (removed -5692) transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5563 places, 14542/8850 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 915 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 17878 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 17878 steps, saw 8492 distinct states, run finished after 3001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 5 properties.
[2022-05-18 09:55:41] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:55:41] [INFO ] Computed 1301 place invariants in 385 ms
[2022-05-18 09:55:42] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2022-05-18 09:55:42] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 375 ms returned sat
[2022-05-18 09:55:56] [INFO ] After 14997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-18 09:55:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2022-05-18 09:55:57] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 375 ms returned sat
[2022-05-18 09:56:12] [INFO ] After 14850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-18 09:56:12] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:56:21] [INFO ] After 8602ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 09:56:21] [INFO ] After 8606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-18 09:56:21] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 5227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 920 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 954 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2022-05-18 09:56:23] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:56:23] [INFO ] Computed 1301 place invariants in 380 ms
[2022-05-18 09:56:28] [INFO ] Implicit Places using invariants in 5206 ms returned []
Implicit Place search using SMT only with invariants took 5207 ms to find 0 implicit places.
[2022-05-18 09:56:28] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:56:29] [INFO ] Computed 1301 place invariants in 380 ms
[2022-05-18 09:56:36] [INFO ] Dead Transitions using invariants and state equation in 7858 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5227 places, 14542/14542 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 369 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5563/5563 places, 8850/8850 transitions.
Applied a total of 0 rules in 425 ms. Remains 5563 /5563 variables (removed 0) and now considering 8850/8850 (removed 0) transitions.
[2022-05-18 09:56:37] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:56:38] [INFO ] Computed 1301 place invariants in 236 ms
[2022-05-18 09:56:38] [INFO ] Implicit Places using invariants in 781 ms returned []
[2022-05-18 09:56:38] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:56:38] [INFO ] Computed 1301 place invariants in 255 ms
[2022-05-18 09:56:39] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
[2022-05-18 09:56:39] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:56:39] [INFO ] Computed 1301 place invariants in 234 ms
[2022-05-18 09:56:40] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5563/5563 places, 8850/8850 transitions.
Computed a total of 2964 stabilizing places and 3674 stable transitions
Computed a total of 2964 stabilizing places and 3674 stable transitions
Detected a total of 2964/5563 stabilizing places and 3674/8850 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 289 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 649 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22701 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22701 steps, saw 10870 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-18 09:56:44] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:56:45] [INFO ] Computed 1301 place invariants in 232 ms
[2022-05-18 09:56:45] [INFO ] [Real]Absence check using 49 positive place invariants in 86 ms returned sat
[2022-05-18 09:56:46] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 315 ms returned sat
[2022-05-18 09:56:51] [INFO ] After 6706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 09:56:52] [INFO ] [Nat]Absence check using 49 positive place invariants in 86 ms returned sat
[2022-05-18 09:56:52] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 327 ms returned sat
[2022-05-18 09:56:59] [INFO ] After 6479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 09:56:59] [INFO ] State equation strengthened by 3174 read => feed constraints.
[2022-05-18 09:57:03] [INFO ] After 3674ms SMT Verify possible using 3174 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-18 09:57:09] [INFO ] Deduced a trap composed of 811 places in 5924 ms of which 5 ms to minimize.
[2022-05-18 09:57:16] [INFO ] Deduced a trap composed of 752 places in 5822 ms of which 6 ms to minimize.
[2022-05-18 09:57:23] [INFO ] Deduced a trap composed of 2 places in 6424 ms of which 6 ms to minimize.
[2022-05-18 09:57:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 09:57:23] [INFO ] After 31477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 5563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5563/5563 places, 8850/8850 transitions.
Free-agglomeration rule (complex) applied 336 times.
Iterating global reduction 0 with 336 rules applied. Total rules applied 336 place count 5563 transition count 14542
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 672 place count 5227 transition count 14542
Applied a total of 672 rules in 1765 ms. Remains 5227 /5563 variables (removed 336) and now considering 14542/8850 (removed -5692) transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5563 places, 14542/8850 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 857 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 17713 steps, run timeout after 3001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 17713 steps, saw 8413 distinct states, run finished after 3001 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-18 09:57:29] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:57:29] [INFO ] Computed 1301 place invariants in 396 ms
[2022-05-18 09:57:30] [INFO ] [Real]Absence check using 49 positive place invariants in 83 ms returned sat
[2022-05-18 09:57:30] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 317 ms returned sat
[2022-05-18 09:57:40] [INFO ] After 10703ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 09:57:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2022-05-18 09:57:41] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 317 ms returned sat
[2022-05-18 09:57:52] [INFO ] After 10621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 09:57:52] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2022-05-18 09:58:05] [INFO ] After 13012ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-18 09:58:05] [INFO ] After 13014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-18 09:58:05] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 5227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 993 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 990 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2022-05-18 09:58:07] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:58:08] [INFO ] Computed 1301 place invariants in 392 ms
[2022-05-18 09:58:12] [INFO ] Implicit Places using invariants in 5022 ms returned []
Implicit Place search using SMT only with invariants took 5022 ms to find 0 implicit places.
[2022-05-18 09:58:12] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2022-05-18 09:58:13] [INFO ] Computed 1301 place invariants in 414 ms
[2022-05-18 09:58:20] [INFO ] Dead Transitions using invariants and state equation in 7847 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5227/5227 places, 14542/14542 transitions.
Graph (trivial) has 3629 edges and 5227 vertex of which 25 / 5227 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 55665 edges and 5203 vertex of which 5181 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 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 t12373.t14833 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 4795 transition count 12813
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 4553 transition count 12332
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 4312 transition count 11892
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 4072 transition count 11494
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 3872 transition count 11134
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 3674 transition count 10812
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 3512 transition count 10524
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 3352 transition count 10270
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 3224 transition count 10046
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 3098 transition count 9852
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 3000 transition count 9684
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 2904 transition count 9542
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 2832 transition count 9422
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 2762 transition count 9324
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 2712 transition count 9244
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 2664 transition count 9182
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 2632 transition count 9134
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 2602 transition count 9100
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 2584 transition count 9076
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 2568 transition count 9062
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 2560 transition count 9054
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 2553 transition count 9052
Ensure Unique test removed 2 places
Iterating post reduction 22 with 2 rules applied. Total rules applied 6250 place count 2551 transition count 9052
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6250 place count 2551 transition count 8452
Deduced a syphon composed of 600 places in 3 ms
Ensure Unique test removed 600 places
Reduce places removed 1200 places and 0 transitions.
Iterating global reduction 23 with 1800 rules applied. Total rules applied 8050 place count 1351 transition count 8452
Discarding 600 places :
Symmetric choice reduction at 23 with 600 rule applications. Total rules 8650 place count 751 transition count 7852
Iterating global reduction 23 with 600 rules applied. Total rules applied 9250 place count 751 transition count 7852
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9250 place count 751 transition count 7851
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9252 place count 750 transition count 7851
Discarding 550 places :
Symmetric choice reduction at 23 with 550 rule applications. Total rules 9802 place count 200 transition count 1251
Iterating global reduction 23 with 550 rules applied. Total rules applied 10352 place count 200 transition count 1251
Ensure Unique test removed 550 transitions
Reduce isomorphic transitions removed 550 transitions.
Iterating post reduction 23 with 550 rules applied. Total rules applied 10902 place count 200 transition count 701
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 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 24 with 52 rules applied. Total rules applied 10954 place count 173 transition count 676
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 24 with 12 rules applied. Total rules applied 10966 place count 173 transition count 664
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 24 with 12 rules applied. Total rules applied 10978 place count 161 transition count 664
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 10989 place count 150 transition count 532
Ensure Unique test removed 11 places
Iterating global reduction 25 with 22 rules applied. Total rules applied 11011 place count 139 transition count 532
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 11022 place count 139 transition count 521
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11033 place count 128 transition count 389
Iterating global reduction 26 with 11 rules applied. Total rules applied 11044 place count 128 transition count 389
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11055 place count 117 transition count 378
Iterating global reduction 26 with 11 rules applied. Total rules applied 11066 place count 117 transition count 378
Partial Free-agglomeration rule applied 288 times.
Drop transitions removed 288 transitions
Iterating global reduction 26 with 288 rules applied. Total rules applied 11354 place count 117 transition count 378
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 11365 place count 106 transition count 246
Ensure Unique test removed 9 places
Iterating global reduction 26 with 20 rules applied. Total rules applied 11385 place count 97 transition count 246
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 11396 place count 97 transition count 235
Discarding 9 places :
Symmetric choice reduction at 27 with 9 rule applications. Total rules 11405 place count 88 transition count 127
Iterating global reduction 27 with 9 rules applied. Total rules applied 11414 place count 88 transition count 127
Discarding 9 places :
Symmetric choice reduction at 27 with 9 rule applications. Total rules 11423 place count 79 transition count 118
Iterating global reduction 27 with 9 rules applied. Total rules applied 11432 place count 79 transition count 118
Applied a total of 11432 rules in 11346 ms. Remains 79 /5227 variables (removed 5148) and now considering 118/14542 (removed 14424) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 118 rows 79 cols
[2022-05-18 09:58:31] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-18 09:58:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-18 09:58:31] [INFO ] [Real]Absence check using 3 positive and 26 generalized place invariants in 5 ms returned sat
[2022-05-18 09:58:31] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-18 09:58:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-18 09:58:32] [INFO ] [Nat]Absence check using 3 positive and 26 generalized place invariants in 4 ms returned sat
[2022-05-18 09:58:32] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-18 09:58:32] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-18 09:58:32] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-18 09:58:32] [INFO ] Flatten gal took : 7 ms
[2022-05-18 09:58:32] [INFO ] Flatten gal took : 4 ms
[2022-05-18 09:58:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14080873477170586512.gal : 1 ms
[2022-05-18 09:58:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8683310889338341877.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13286437280830758528;'/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/ReachabilityCardinality14080873477170586512.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8683310889338341877.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/ReachabilityCardinality8683310889338341877.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :8 after 24
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :24 after 54
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :54 after 98
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :98 after 206
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :206 after 398
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :398 after 3205
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,12208,0.154094,8680,2,4736,12,13778,10,0,414,10617,0
Total reachable state count : 12208

Verifying 4 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,10,0.155151,8944,2,150,12,13778,10,0,417,10617,0
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,3,0.155859,8944,2,100,12,13778,10,0,419,10617,0
Reachability property apf2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf2,10,0.156183,8944,2,150,12,13778,10,0,419,10617,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,3,0.156624,8944,2,100,12,13778,10,0,421,10617,0
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 493 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1155 reset in 1181 ms.
Product exploration explored 100000 steps with 1156 reset in 1200 ms.
Applying partial POR strategy [true, false, false, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5563/5563 places, 8850/8850 transitions.
Applied a total of 0 rules in 579 ms. Remains 5563 /5563 variables (removed 0) and now considering 8850/8850 (removed 0) transitions.
[2022-05-18 09:58:37] [INFO ] Redundant transitions in 986 ms returned []
[2022-05-18 09:58:37] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:58:37] [INFO ] Computed 1301 place invariants in 258 ms
[2022-05-18 09:58:38] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5563/5563 places, 8850/8850 transitions.
Product exploration explored 100000 steps with 1157 reset in 1175 ms.
Product exploration explored 100000 steps with 1157 reset in 1231 ms.
Built C files in :
/tmp/ltsmin6996405784181874742
[2022-05-18 09:58:40] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6996405784181874742
Running compilation step : cd /tmp/ltsmin6996405784181874742;'/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/ltsmin6996405784181874742;'/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/ltsmin6996405784181874742;'/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 5563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5563/5563 places, 8850/8850 transitions.
Applied a total of 0 rules in 629 ms. Remains 5563 /5563 variables (removed 0) and now considering 8850/8850 (removed 0) transitions.
[2022-05-18 09:58:44] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:58:44] [INFO ] Computed 1301 place invariants in 297 ms
[2022-05-18 09:58:45] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2022-05-18 09:58:45] [INFO ] Flow matrix only has 8250 transitions (discarded 600 similar events)
// Phase 1: matrix 8250 rows 5563 cols
[2022-05-18 09:58:45] [INFO ] Computed 1301 place invariants in 280 ms
[2022-05-18 09:58:53] [INFO ] Implicit Places using invariants and state equation in 8146 ms returned [1800]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9212 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 5562/5563 places, 8850/8850 transitions.
Applied a total of 0 rules in 560 ms. Remains 5562 /5562 variables (removed 0) and now considering 8850/8850 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5562/5563 places, 8850/8850 transitions.
Built C files in :
/tmp/ltsmin16839625769468094880
[2022-05-18 09:58:54] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16839625769468094880
Running compilation step : cd /tmp/ltsmin16839625769468094880;'/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/ltsmin16839625769468094880;'/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/ltsmin16839625769468094880;'/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 09:58:58] [INFO ] Flatten gal took : 365 ms
[2022-05-18 09:58:58] [INFO ] Flatten gal took : 312 ms
[2022-05-18 09:58:58] [INFO ] Time to serialize gal into /tmp/LTL11643570386357613604.gal : 31 ms
[2022-05-18 09:58:58] [INFO ] Time to serialize properties into /tmp/LTL9802377700557554014.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/LTL11643570386357613604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9802377700557554014.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/LTL1164357...267
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((Node11ManageTheCrashOfNode18<1)||(Rx10IsAtTheRightExtremityOfTheLeafSet<1))"))||(G("((Node21ManageTheCrashOfNode17<1)||(R...202
Formula 0 simplified : !XG(X"((Node11ManageTheCrashOfNode18<1)||(Rx10IsAtTheRightExtremityOfTheLeafSet<1))" | G"((Node21ManageTheCrashOfNode17<1)||(Rx11IsA...191
Detected timeout of ITS tools.
[2022-05-18 09:59:14] [INFO ] Flatten gal took : 502 ms
[2022-05-18 09:59:14] [INFO ] Applying decomposition
[2022-05-18 09:59:14] [INFO ] Flatten gal took : 538 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/graph2273208260138602470.txt' '-o' '/tmp/graph2273208260138602470.bin' '-w' '/tmp/graph2273208260138602470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2273208260138602470.bin' '-l' '-1' '-v' '-w' '/tmp/graph2273208260138602470.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:59:15] [INFO ] Decomposing Gal with order
[2022-05-18 09:59:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 09:59:18] [INFO ] Removed a total of 7609 redundant transitions.
[2022-05-18 09:59:18] [INFO ] Flatten gal took : 2275 ms
[2022-05-18 09:59:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4932 labels/synchronizations in 908 ms.
[2022-05-18 09:59:19] [INFO ] Time to serialize gal into /tmp/LTL12715920186417950811.gal : 75 ms
[2022-05-18 09:59:19] [INFO ] Time to serialize properties into /tmp/LTL15462315632224183665.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/LTL12715920186417950811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15462315632224183665.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/LTL1271592...247
Read 1 LTL properties
Checking formula 0 : !((X(G((X("((i17.u362.Node11ManageTheCrashOfNode18<1)||(i18.u367.Rx10IsAtTheRightExtremityOfTheLeafSet<1))"))||(G("((i17.u365.Node21Ma...238
Formula 0 simplified : !XG(X"((i17.u362.Node11ManageTheCrashOfNode18<1)||(i18.u367.Rx10IsAtTheRightExtremityOfTheLeafSet<1))" | G"((i17.u365.Node21ManageTh...227
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11895079835034411957
[2022-05-18 09:59:35] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11895079835034411957
Running compilation step : cd /tmp/ltsmin11895079835034411957;'/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/ltsmin11895079835034411957;'/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/ltsmin11895079835034411957;'/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-S24C12-LTLFireability-02 finished in 300331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p1)||p0))&&X(X(G(X(!p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(p0)))))'
[2022-05-18 09:59:40] [INFO ] Flatten gal took : 1437 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2944879058557622689
[2022-05-18 09:59:40] [INFO ] Too many transitions (29875) to apply POR reductions. Disabling POR matrices.
[2022-05-18 09:59:41] [INFO ] Built C files in 327ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2944879058557622689
Running compilation step : cd /tmp/ltsmin2944879058557622689;'/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 09:59:42] [INFO ] Applying decomposition
[2022-05-18 09:59:44] [INFO ] Flatten gal took : 1836 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/graph10052071733277353716.txt' '-o' '/tmp/graph10052071733277353716.bin' '-w' '/tmp/graph10052071733277353716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10052071733277353716.bin' '-l' '-1' '-v' '-w' '/tmp/graph10052071733277353716.weights' '-q' '0' '-e' '0.001'
[2022-05-18 09:59:48] [INFO ] Decomposing Gal with order
[2022-05-18 09:59:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 10:00:04] [INFO ] Removed a total of 18978 redundant transitions.
[2022-05-18 10:00:05] [INFO ] Flatten gal took : 7041 ms
[2022-05-18 10:00:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1746 labels/synchronizations in 660 ms.
[2022-05-18 10:00:07] [INFO ] Time to serialize gal into /tmp/LTLFireability11126027642027692387.gal : 220 ms
[2022-05-18 10:00:07] [INFO ] Time to serialize properties into /tmp/LTLFireability7788110412188376388.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11126027642027692387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7788110412188376388.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 : !((X(G((X("((i8.u115.Node11ManageTheCrashOfNode18<1)||(i10.u394.Rx10IsAtTheRightExtremityOfTheLeafSet<1))"))||(G("((i2.i1.u293.Node21M...239
Formula 0 simplified : !XG(X"((i8.u115.Node11ManageTheCrashOfNode18<1)||(i10.u394.Rx10IsAtTheRightExtremityOfTheLeafSet<1))" | G"((i2.i1.u293.Node21ManageT...228
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/ltsmin2944879058557622689;'/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/ltsmin2944879058557622689;'/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)
ITS-tools command line returned an error code 137
[2022-05-18 10:22:34] [INFO ] Flatten gal took : 3498 ms
[2022-05-18 10:22:34] [INFO ] Time to serialize gal into /tmp/LTLFireability13751626256530622594.gal : 189 ms
[2022-05-18 10:22:34] [INFO ] Time to serialize properties into /tmp/LTLFireability3259062700543883495.ltl : 7 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/LTLFireability13751626256530622594.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3259062700543883495.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 : !((X(G((X("((Node11ManageTheCrashOfNode18<1)||(Rx10IsAtTheRightExtremityOfTheLeafSet<1))"))||(G("((Node21ManageTheCrashOfNode17<1)||(R...202
Formula 0 simplified : !XG(X"((Node11ManageTheCrashOfNode18<1)||(Rx10IsAtTheRightExtremityOfTheLeafSet<1))" | G"((Node21ManageTheCrashOfNode17<1)||(Rx11IsA...191

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-S24C12"
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-S24C12, 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-165271821400788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C12.tgz
mv MultiCrashLeafsetExtension-PT-S24C12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;