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.r078-tall-165260110000220.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 DoubleExponent-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.5M May 10 09:33 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 DoubleExponent-PT-200-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652651733758

Running Version 202205111006
[2022-05-15 21:55:34] [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-15 21:55:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:55:35] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2022-05-15 21:55:35] [INFO ] Transformed 10604 places.
[2022-05-15 21:55:35] [INFO ] Transformed 9998 transitions.
[2022-05-15 21:55:35] [INFO ] Parsed PT model containing 10604 places and 9998 transitions in 485 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-200-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-200-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 10604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10600 transition count 9998
Applied a total of 4 rules in 3959 ms. Remains 10600 /10604 variables (removed 4) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:55:43] [INFO ] Invariants computation overflowed in 381 ms
[2022-05-15 21:55:44] [INFO ] Implicit Places using invariants in 1431 ms returned []
Implicit Place search using SMT only with invariants took 1470 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:55:44] [INFO ] Invariants computation overflowed in 317 ms
[2022-05-15 21:55:45] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10600/10604 places, 9998/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10604 places, 9998/9998 transitions.
Support contains 42 out of 10600 places after structural reductions.
[2022-05-15 21:55:47] [INFO ] Flatten gal took : 511 ms
[2022-05-15 21:55:48] [INFO ] Flatten gal took : 365 ms
[2022-05-15 21:55:48] [INFO ] Input system was already deterministic with 9998 transitions.
Incomplete random walk after 10000 steps, including 324 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 28124 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 28124 steps, saw 14070 distinct states, run finished after 3002 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:55:56] [INFO ] Invariants computation overflowed in 230 ms
[2022-05-15 21:56:22] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2022-05-15 21:56:47] [INFO ] After 17568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2022-05-15 21:56:47] [INFO ] After 17585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-15 21:56:47] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.32 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2356 transitions
Trivial Post-agglo rules discarded 2356 transitions
Performed 2356 trivial Post agglomeration. Transition count delta: 2356
Iterating post reduction 0 with 2359 rules applied. Total rules applied 2360 place count 10597 transition count 7640
Reduce places removed 2356 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 2372 rules applied. Total rules applied 4732 place count 8241 transition count 7624
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 4748 place count 8225 transition count 7624
Performed 406 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 406 Pre rules applied. Total rules applied 4748 place count 8225 transition count 7218
Deduced a syphon composed of 406 places in 784 ms
Reduce places removed 406 places and 0 transitions.
Iterating global reduction 3 with 812 rules applied. Total rules applied 5560 place count 7819 transition count 7218
Performed 1784 Post agglomeration using F-continuation condition.Transition count delta: 1784
Deduced a syphon composed of 1784 places in 310 ms
Reduce places removed 1784 places and 0 transitions.
Iterating global reduction 3 with 3568 rules applied. Total rules applied 9128 place count 6035 transition count 5434
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 217 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9330 place count 5934 transition count 5434
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 261 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9532 place count 5833 transition count 5434
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 237 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9734 place count 5732 transition count 5434
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 202 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 9916 place count 5641 transition count 5434
Free-agglomeration rule (complex) applied 794 times.
Iterating global reduction 3 with 794 rules applied. Total rules applied 10710 place count 5641 transition count 4640
Reduce places removed 794 places and 0 transitions.
Iterating post reduction 3 with 794 rules applied. Total rules applied 11504 place count 4847 transition count 4640
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 804 times.
Drop transitions removed 804 transitions
Iterating global reduction 4 with 804 rules applied. Total rules applied 12308 place count 4847 transition count 4640
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12309 place count 4846 transition count 4639
Applied a total of 12309 rules in 8364 ms. Remains 4846 /10600 variables (removed 5754) and now considering 4639/9998 (removed 5359) transitions.
Finished structural reductions, in 1 iterations. Remains : 4846/10600 places, 4639/9998 transitions.
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 53540 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53540 steps, saw 26794 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 4639 rows 4846 cols
[2022-05-15 21:56:59] [INFO ] Invariants computation overflowed in 105 ms
[2022-05-15 21:57:24] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2022-05-15 21:57:49] [INFO ] After 21521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2022-05-15 21:57:50] [INFO ] State equation strengthened by 785 read => feed constraints.
[2022-05-15 21:57:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 21:57:50] [INFO ] After 25079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:25
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 4846 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4846/4846 places, 4639/4639 transitions.
Applied a total of 0 rules in 687 ms. Remains 4846 /4846 variables (removed 0) and now considering 4639/4639 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4846/4846 places, 4639/4639 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4846/4846 places, 4639/4639 transitions.
Applied a total of 0 rules in 654 ms. Remains 4846 /4846 variables (removed 0) and now considering 4639/4639 (removed 0) transitions.
// Phase 1: matrix 4639 rows 4846 cols
[2022-05-15 21:57:51] [INFO ] Invariants computation overflowed in 160 ms
[2022-05-15 21:58:22] [INFO ] Performed 3082/4846 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 21:58:42] [INFO ] Implicit Places using invariants in 51223 ms returned []
// Phase 1: matrix 4639 rows 4846 cols
[2022-05-15 21:58:42] [INFO ] Invariants computation overflowed in 101 ms
[2022-05-15 21:58:43] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 52153 ms to find 0 implicit places.
[2022-05-15 21:58:43] [INFO ] Redundant transitions in 470 ms returned []
// Phase 1: matrix 4639 rows 4846 cols
[2022-05-15 21:58:44] [INFO ] Invariants computation overflowed in 106 ms
[2022-05-15 21:58:47] [INFO ] Dead Transitions using invariants and state equation in 3777 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4846/4846 places, 4639/4639 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.44 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))&&p1)))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3174 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:58:51] [INFO ] Invariants computation overflowed in 255 ms
[2022-05-15 21:58:52] [INFO ] Implicit Places using invariants in 1025 ms returned []
Implicit Place search using SMT only with invariants took 1026 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:58:52] [INFO ] Invariants computation overflowed in 227 ms
[2022-05-15 21:58:53] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s1438 1) (LT s1544 1)), p0:(OR (LT s4835 1) (LT s5235 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3327 reset in 514 ms.
Product exploration explored 100000 steps with 3311 reset in 443 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), true, (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 334 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 30998 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 30998 steps, saw 15505 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 21:59:03] [INFO ] Invariants computation overflowed in 235 ms
[2022-05-15 21:59:04] [INFO ] After 1268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 21:59:29] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2395 transitions
Trivial Post-agglo rules discarded 2395 transitions
Performed 2395 trivial Post agglomeration. Transition count delta: 2395
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2399 place count 10597 transition count 7601
Reduce places removed 2395 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4796 place count 8202 transition count 7599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4798 place count 8200 transition count 7599
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4798 place count 8200 transition count 7197
Deduced a syphon composed of 402 places in 752 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5602 place count 7798 transition count 7197
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 267 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9206 place count 5996 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 222 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9408 place count 5895 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 207 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9610 place count 5794 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 211 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9812 place count 5693 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 189 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 10002 place count 5598 transition count 5395
Free-agglomeration rule (complex) applied 798 times.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10800 place count 5598 transition count 4597
Reduce places removed 798 places and 0 transitions.
Iterating post reduction 3 with 798 rules applied. Total rules applied 11598 place count 4800 transition count 4597
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 4 with 799 rules applied. Total rules applied 12397 place count 4800 transition count 4597
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12398 place count 4799 transition count 4596
Applied a total of 12398 rules in 8791 ms. Remains 4799 /10600 variables (removed 5801) and now considering 4596/9998 (removed 5402) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/10600 places, 4596/9998 transitions.
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 67269 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67269 steps, saw 33650 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 21:59:42] [INFO ] Invariants computation overflowed in 71 ms
[2022-05-15 22:00:04] [INFO ] After 22234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1127 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1121 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:00:06] [INFO ] Invariants computation overflowed in 66 ms
[2022-05-15 22:00:37] [INFO ] Performed 1100/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:01:07] [INFO ] Performed 2055/4799 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:01:37] [INFO ] Performed 3076/4799 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:02:07] [INFO ] Performed 4451/4799 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:02:07] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:02:07] [INFO ] Implicit Places using invariants in 120923 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:02:07] [INFO ] Invariants computation overflowed in 71 ms
[2022-05-15 22:02:08] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 121788 ms to find 0 implicit places.
[2022-05-15 22:02:09] [INFO ] Redundant transitions in 574 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:02:09] [INFO ] Invariants computation overflowed in 70 ms
[2022-05-15 22:02:13] [INFO ] Dead Transitions using invariants and state equation in 4662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4596/4596 transitions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), true, (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3204 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:02:18] [INFO ] Invariants computation overflowed in 233 ms
[2022-05-15 22:02:19] [INFO ] Implicit Places using invariants in 1017 ms returned []
Implicit Place search using SMT only with invariants took 1018 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:02:19] [INFO ] Invariants computation overflowed in 233 ms
[2022-05-15 22:02:20] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 29802 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 29802 steps, saw 14907 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:02:28] [INFO ] Invariants computation overflowed in 243 ms
[2022-05-15 22:02:29] [INFO ] After 1244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:02:54] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2395 transitions
Trivial Post-agglo rules discarded 2395 transitions
Performed 2395 trivial Post agglomeration. Transition count delta: 2395
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2399 place count 10597 transition count 7601
Reduce places removed 2395 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4796 place count 8202 transition count 7599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4798 place count 8200 transition count 7599
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4798 place count 8200 transition count 7197
Deduced a syphon composed of 402 places in 726 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5602 place count 7798 transition count 7197
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 299 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9206 place count 5996 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 219 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9408 place count 5895 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 206 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9610 place count 5794 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 200 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9812 place count 5693 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 189 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 10002 place count 5598 transition count 5395
Free-agglomeration rule (complex) applied 798 times.
Iterating global reduction 3 with 798 rules applied. Total rules applied 10800 place count 5598 transition count 4597
Reduce places removed 798 places and 0 transitions.
Iterating post reduction 3 with 798 rules applied. Total rules applied 11598 place count 4800 transition count 4597
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 4 with 799 rules applied. Total rules applied 12397 place count 4800 transition count 4597
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12398 place count 4799 transition count 4596
Applied a total of 12398 rules in 8617 ms. Remains 4799 /10600 variables (removed 5801) and now considering 4596/9998 (removed 5402) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/10600 places, 4596/9998 transitions.
Incomplete random walk after 10000 steps, including 1240 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 64476 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64476 steps, saw 32256 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:03:07] [INFO ] Invariants computation overflowed in 72 ms
[2022-05-15 22:03:29] [INFO ] After 22290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4799 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1139 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4799/4799 places, 4596/4596 transitions.
Applied a total of 0 rules in 1112 ms. Remains 4799 /4799 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:03:32] [INFO ] Invariants computation overflowed in 73 ms
[2022-05-15 22:04:02] [INFO ] Performed 1100/4799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:04:32] [INFO ] Performed 2055/4799 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:05:02] [INFO ] Performed 3092/4799 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:05:33] [INFO ] Performed 4430/4799 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:05:33] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:05:33] [INFO ] Implicit Places using invariants in 120972 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:05:33] [INFO ] Invariants computation overflowed in 68 ms
[2022-05-15 22:05:33] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 121856 ms to find 0 implicit places.
[2022-05-15 22:05:34] [INFO ] Redundant transitions in 599 ms returned []
// Phase 1: matrix 4596 rows 4799 cols
[2022-05-15 22:05:34] [INFO ] Invariants computation overflowed in 72 ms
[2022-05-15 22:05:39] [INFO ] Dead Transitions using invariants and state equation in 4480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4799/4799 places, 4596/4596 transitions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3285 reset in 421 ms.
Product exploration explored 100000 steps with 3303 reset in 399 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Performed 2395 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2395 rules applied. Total rules applied 2395 place count 10600 transition count 9998
Performed 403 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 403 Pre rules applied. Total rules applied 2395 place count 10600 transition count 10398
Deduced a syphon composed of 2798 places in 992 ms
Iterating global reduction 1 with 403 rules applied. Total rules applied 2798 place count 10600 transition count 10398
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2800 place count 10598 transition count 10396
Deduced a syphon composed of 2796 places in 838 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 2802 place count 10598 transition count 10396
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: -400
Deduced a syphon composed of 4595 places in 625 ms
Iterating global reduction 1 with 1799 rules applied. Total rules applied 4601 place count 10598 transition count 10796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4602 place count 10597 transition count 10795
Deduced a syphon composed of 4594 places in 551 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4603 place count 10597 transition count 10795
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -653
Deduced a syphon composed of 4695 places in 560 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4704 place count 10597 transition count 11448
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 4805 place count 10496 transition count 11246
Deduced a syphon composed of 4594 places in 533 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 4906 place count 10496 transition count 11246
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -645
Deduced a syphon composed of 4695 places in 529 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5007 place count 10496 transition count 11891
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5108 place count 10395 transition count 11689
Deduced a syphon composed of 4594 places in 516 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5209 place count 10395 transition count 11689
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 4695 places in 519 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5310 place count 10395 transition count 12353
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 5411 place count 10294 transition count 12151
Deduced a syphon composed of 4594 places in 512 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 5512 place count 10294 transition count 12151
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -623
Deduced a syphon composed of 4691 places in 535 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5609 place count 10294 transition count 12774
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 5706 place count 10197 transition count 12580
Deduced a syphon composed of 4594 places in 515 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 5803 place count 10197 transition count 12580
Deduced a syphon composed of 4594 places in 522 ms
Applied a total of 5803 rules in 21684 ms. Remains 10197 /10600 variables (removed 403) and now considering 12580/9998 (removed -2582) transitions.
// Phase 1: matrix 12580 rows 10197 cols
[2022-05-15 22:06:03] [INFO ] Invariants computation overflowed in 294 ms
[2022-05-15 22:06:03] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10197/10600 places, 12580/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 10197/10600 places, 12580/9998 transitions.
Product exploration explored 100000 steps with 9840 reset in 6418 ms.
Product exploration explored 100000 steps with 9805 reset in 6378 ms.
Built C files in :
/tmp/ltsmin3611625335797781669
[2022-05-15 22:06:16] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3611625335797781669
Running compilation step : cd /tmp/ltsmin3611625335797781669;'/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/ltsmin3611625335797781669;'/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/ltsmin3611625335797781669;'/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 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3168 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:06:23] [INFO ] Invariants computation overflowed in 253 ms
[2022-05-15 22:06:24] [INFO ] Implicit Places using invariants in 1122 ms returned []
Implicit Place search using SMT only with invariants took 1135 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:06:24] [INFO ] Invariants computation overflowed in 231 ms
[2022-05-15 22:06:25] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Built C files in :
/tmp/ltsmin5741650820700307713
[2022-05-15 22:06:27] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5741650820700307713
Running compilation step : cd /tmp/ltsmin5741650820700307713;'/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/ltsmin5741650820700307713;'/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/ltsmin5741650820700307713;'/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-15 22:06:34] [INFO ] Flatten gal took : 315 ms
[2022-05-15 22:06:34] [INFO ] Flatten gal took : 355 ms
[2022-05-15 22:06:34] [INFO ] Time to serialize gal into /tmp/LTL9697115870995040767.gal : 75 ms
[2022-05-15 22:06:34] [INFO ] Time to serialize properties into /tmp/LTL17497608291577174092.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/LTL9697115870995040767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17497608291577174092.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/LTL9697115...267
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((p481<1)||(p517<1))")))&&("((p1752<1)||(p1848<1))"))))
Formula 0 simplified : !G("((p1752<1)||(p1848<1))" & XX"((p481<1)||(p517<1))")
Detected timeout of ITS tools.
[2022-05-15 22:06:49] [INFO ] Flatten gal took : 295 ms
[2022-05-15 22:06:50] [INFO ] Applying decomposition
[2022-05-15 22:06:50] [INFO ] Flatten gal took : 309 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/graph7898133602208719044.txt' '-o' '/tmp/graph7898133602208719044.bin' '-w' '/tmp/graph7898133602208719044.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7898133602208719044.bin' '-l' '-1' '-v' '-w' '/tmp/graph7898133602208719044.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:06:51] [INFO ] Decomposing Gal with order
[2022-05-15 22:06:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:06:59] [INFO ] Removed a total of 2850 redundant transitions.
[2022-05-15 22:06:59] [INFO ] Flatten gal took : 828 ms
[2022-05-15 22:06:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 128 ms.
[2022-05-15 22:06:59] [INFO ] Time to serialize gal into /tmp/LTL3536295870522911877.gal : 86 ms
[2022-05-15 22:06:59] [INFO ] Time to serialize properties into /tmp/LTL8486039749555379027.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/LTL3536295870522911877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8486039749555379027.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/LTL3536295...245
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((i25.u2074.p481<1)||(i25.u2236.p517<1))")))&&("((i5.u628.p1752<1)||(i5.u629.p1848<1))"))))
Formula 0 simplified : !G("((i5.u628.p1752<1)||(i5.u629.p1848<1))" & XX"((i25.u2074.p481<1)||(i25.u2236.p517<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2672915176006460598
[2022-05-15 22:07:14] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2672915176006460598
Running compilation step : cd /tmp/ltsmin2672915176006460598;'/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/ltsmin2672915176006460598;'/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/ltsmin2672915176006460598;'/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 DoubleExponent-PT-200-LTLFireability-00 finished in 509781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(p1)&&p0)))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2393 transitions
Trivial Post-agglo rules discarded 2393 transitions
Performed 2393 trivial Post agglomeration. Transition count delta: 2393
Iterating post reduction 0 with 2393 rules applied. Total rules applied 2393 place count 10599 transition count 7604
Reduce places removed 2393 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4789 place count 8206 transition count 7601
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4792 place count 8203 transition count 7601
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4792 place count 8203 transition count 7200
Deduced a syphon composed of 401 places in 806 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 284 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9198 place count 6000 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 224 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9400 place count 5899 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 284 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9602 place count 5798 transition count 5398
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 199 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9804 place count 5697 transition count 5398
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 191 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9994 place count 5602 transition count 5398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9995 place count 5601 transition count 5397
Applied a total of 9995 rules in 6428 ms. Remains 5601 /10600 variables (removed 4999) and now considering 5397/9998 (removed 4601) transitions.
// Phase 1: matrix 5397 rows 5601 cols
[2022-05-15 22:07:24] [INFO ] Invariants computation overflowed in 120 ms
[2022-05-15 22:07:27] [INFO ] Implicit Places using invariants in 3490 ms returned []
// Phase 1: matrix 5397 rows 5601 cols
[2022-05-15 22:07:28] [INFO ] Invariants computation overflowed in 115 ms
[2022-05-15 22:07:28] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 4471 ms to find 0 implicit places.
[2022-05-15 22:07:29] [INFO ] Redundant transitions in 336 ms returned []
// Phase 1: matrix 5397 rows 5601 cols
[2022-05-15 22:07:29] [INFO ] Invariants computation overflowed in 115 ms
[2022-05-15 22:07:32] [INFO ] Dead Transitions using invariants and state equation in 3184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5601/10600 places, 5397/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5601/10600 places, 5397/9998 transitions.
Stuttering acceptance computed with spot in 44 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1229 1) (GEQ s1596 1)), p1:(AND (GEQ s5022 1) (GEQ s5030 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 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-01 finished in 14775 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10599 transition count 7599
Reduce places removed 2398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4797 place count 8201 transition count 7598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4798 place count 8200 transition count 7598
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4798 place count 8200 transition count 7198
Deduced a syphon composed of 400 places in 837 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1803 Post agglomeration using F-continuation condition.Transition count delta: 1803
Deduced a syphon composed of 1803 places in 342 ms
Reduce places removed 1803 places and 0 transitions.
Iterating global reduction 3 with 3606 rules applied. Total rules applied 9204 place count 5997 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 235 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9406 place count 5896 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 224 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9608 place count 5795 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 247 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9810 place count 5694 transition count 5395
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 190 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 10000 place count 5599 transition count 5395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10001 place count 5598 transition count 5394
Applied a total of 10001 rules in 6116 ms. Remains 5598 /10600 variables (removed 5002) and now considering 5394/9998 (removed 4604) transitions.
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:07:39] [INFO ] Invariants computation overflowed in 124 ms
[2022-05-15 22:07:42] [INFO ] Implicit Places using invariants in 3910 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:07:42] [INFO ] Invariants computation overflowed in 119 ms
[2022-05-15 22:07:43] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 4921 ms to find 0 implicit places.
[2022-05-15 22:07:44] [INFO ] Redundant transitions in 342 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:07:44] [INFO ] Invariants computation overflowed in 121 ms
[2022-05-15 22:07:47] [INFO ] Dead Transitions using invariants and state equation in 3537 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5598/10600 places, 5394/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5598/10600 places, 5394/9998 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1174 1) (LT s1188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13851 reset in 390 ms.
Product exploration explored 100000 steps with 13869 reset in 345 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17776 edges and 5598 vertex of which 5596 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1387 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 58989 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58989 steps, saw 29509 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:07:52] [INFO ] Invariants computation overflowed in 124 ms
[2022-05-15 22:08:05] [INFO ] After 12630ms 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 5598 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5598/5598 places, 5394/5394 transitions.
Graph (complete) has 16976 edges and 5598 vertex of which 5596 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5596 transition count 5392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5596 transition count 5391
Deduced a syphon composed of 1 places in 178 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5595 transition count 5391
Free-agglomeration rule (complex) applied 793 times.
Iterating global reduction 1 with 793 rules applied. Total rules applied 798 place count 5595 transition count 4598
Reduce places removed 793 places and 0 transitions.
Iterating post reduction 1 with 793 rules applied. Total rules applied 1591 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 2 with 801 rules applied. Total rules applied 2392 place count 4802 transition count 4598
Applied a total of 2392 rules in 2383 ms. Remains 4802 /5598 variables (removed 796) and now considering 4598/5394 (removed 796) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/5598 places, 4598/5394 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 67640 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67640 steps, saw 33840 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:08:11] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 22:08:23] [INFO ] After 12660ms 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 4802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 841 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 834 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:08:25] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 22:08:56] [INFO ] Performed 2300/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:09:26] [INFO ] Performed 3985/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:09:35] [INFO ] Implicit Places using invariants in 69518 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:09:35] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-15 22:09:35] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 70438 ms to find 0 implicit places.
[2022-05-15 22:09:36] [INFO ] Redundant transitions in 437 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:09:36] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 22:09:40] [INFO ] Dead Transitions using invariants and state equation in 3947 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Support contains 2 out of 5598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5598/5598 places, 5394/5394 transitions.
Applied a total of 0 rules in 482 ms. Remains 5598 /5598 variables (removed 0) and now considering 5394/5394 (removed 0) transitions.
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:09:41] [INFO ] Invariants computation overflowed in 126 ms
[2022-05-15 22:09:45] [INFO ] Implicit Places using invariants in 3876 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:09:45] [INFO ] Invariants computation overflowed in 128 ms
[2022-05-15 22:09:46] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 4923 ms to find 0 implicit places.
[2022-05-15 22:09:46] [INFO ] Redundant transitions in 340 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:09:46] [INFO ] Invariants computation overflowed in 122 ms
[2022-05-15 22:09:50] [INFO ] Dead Transitions using invariants and state equation in 3539 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5598/5598 places, 5394/5394 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17776 edges and 5598 vertex of which 5596 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1377 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 786 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 57040 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57040 steps, saw 28529 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:09:54] [INFO ] Invariants computation overflowed in 126 ms
[2022-05-15 22:10:07] [INFO ] After 12774ms 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 5598 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5598/5598 places, 5394/5394 transitions.
Graph (complete) has 16976 edges and 5598 vertex of which 5596 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5596 transition count 5392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5596 transition count 5391
Deduced a syphon composed of 1 places in 200 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5595 transition count 5391
Free-agglomeration rule (complex) applied 793 times.
Iterating global reduction 1 with 793 rules applied. Total rules applied 798 place count 5595 transition count 4598
Reduce places removed 793 places and 0 transitions.
Iterating post reduction 1 with 793 rules applied. Total rules applied 1591 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 801 times.
Drop transitions removed 801 transitions
Iterating global reduction 2 with 801 rules applied. Total rules applied 2392 place count 4802 transition count 4598
Applied a total of 2392 rules in 2472 ms. Remains 4802 /5598 variables (removed 796) and now considering 4598/5394 (removed 796) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/5598 places, 4598/5394 transitions.
Incomplete random walk after 10000 steps, including 1303 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 65652 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65652 steps, saw 32838 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:10:13] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 22:10:25] [INFO ] After 12794ms 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 4802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 768 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 784 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:10:27] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-15 22:10:58] [INFO ] Performed 2305/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:11:28] [INFO ] Performed 4032/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:11:36] [INFO ] Implicit Places using invariants in 68913 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:11:36] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 22:11:37] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 69841 ms to find 0 implicit places.
[2022-05-15 22:11:37] [INFO ] Redundant transitions in 427 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:11:37] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-15 22:11:41] [INFO ] Dead Transitions using invariants and state equation in 3823 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 13848 reset in 276 ms.
Product exploration explored 100000 steps with 13801 reset in 277 ms.
Built C files in :
/tmp/ltsmin15014666837498170106
[2022-05-15 22:11:42] [INFO ] Too many transitions (5394) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:11:42] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15014666837498170106
Running compilation step : cd /tmp/ltsmin15014666837498170106;'/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/ltsmin15014666837498170106;'/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/ltsmin15014666837498170106;'/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 5598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5598/5598 places, 5394/5394 transitions.
Applied a total of 0 rules in 478 ms. Remains 5598 /5598 variables (removed 0) and now considering 5394/5394 (removed 0) transitions.
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:11:46] [INFO ] Invariants computation overflowed in 123 ms
[2022-05-15 22:11:50] [INFO ] Implicit Places using invariants in 3769 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:11:50] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 22:11:51] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 4815 ms to find 0 implicit places.
[2022-05-15 22:11:51] [INFO ] Redundant transitions in 333 ms returned []
// Phase 1: matrix 5394 rows 5598 cols
[2022-05-15 22:11:51] [INFO ] Invariants computation overflowed in 117 ms
[2022-05-15 22:11:54] [INFO ] Dead Transitions using invariants and state equation in 3349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5598/5598 places, 5394/5394 transitions.
Built C files in :
/tmp/ltsmin3510360708740825002
[2022-05-15 22:11:55] [INFO ] Too many transitions (5394) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:11:55] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3510360708740825002
Running compilation step : cd /tmp/ltsmin3510360708740825002;'/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/ltsmin3510360708740825002;'/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/ltsmin3510360708740825002;'/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-15 22:11:59] [INFO ] Flatten gal took : 445 ms
[2022-05-15 22:11:59] [INFO ] Flatten gal took : 446 ms
[2022-05-15 22:11:59] [INFO ] Time to serialize gal into /tmp/LTL5447607542060959094.gal : 35 ms
[2022-05-15 22:11:59] [INFO ] Time to serialize properties into /tmp/LTL3824365322973849150.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/LTL5447607542060959094.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3824365322973849150.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/LTL5447607...266
Read 1 LTL properties
Checking formula 0 : !((G("((p2456<1)||(p2481<1))")))
Formula 0 simplified : !G"((p2456<1)||(p2481<1))"
Detected timeout of ITS tools.
[2022-05-15 22:12:15] [INFO ] Flatten gal took : 176 ms
[2022-05-15 22:12:15] [INFO ] Applying decomposition
[2022-05-15 22:12:15] [INFO ] Flatten gal took : 177 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/graph1254206449493630225.txt' '-o' '/tmp/graph1254206449493630225.bin' '-w' '/tmp/graph1254206449493630225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1254206449493630225.bin' '-l' '-1' '-v' '-w' '/tmp/graph1254206449493630225.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:12:15] [INFO ] Decomposing Gal with order
[2022-05-15 22:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:12:17] [INFO ] Removed a total of 4223 redundant transitions.
[2022-05-15 22:12:17] [INFO ] Flatten gal took : 324 ms
[2022-05-15 22:12:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 264 labels/synchronizations in 155 ms.
[2022-05-15 22:12:17] [INFO ] Time to serialize gal into /tmp/LTL8251331909333341044.gal : 53 ms
[2022-05-15 22:12:17] [INFO ] Time to serialize properties into /tmp/LTL7828568812972569531.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/LTL8251331909333341044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7828568812972569531.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/LTL8251331...245
Read 1 LTL properties
Checking formula 0 : !((G("((i8.i0.i2.u428.p2456<1)||(i8.i1.i0.u435.p2481<1))")))
Formula 0 simplified : !G"((i8.i0.i2.u428.p2456<1)||(i8.i1.i0.u435.p2481<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18193083600333612592
[2022-05-15 22:12:32] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18193083600333612592
Running compilation step : cd /tmp/ltsmin18193083600333612592;'/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/ltsmin18193083600333612592;'/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/ltsmin18193083600333612592;'/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 DoubleExponent-PT-200-LTLFireability-02 finished in 302785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2400 transitions
Trivial Post-agglo rules discarded 2400 transitions
Performed 2400 trivial Post agglomeration. Transition count delta: 2400
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 10599 transition count 7597
Reduce places removed 2400 places and 0 transitions.
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7198
Deduced a syphon composed of 399 places in 753 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 290 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 2 with 3604 rules applied. Total rules applied 9202 place count 5998 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 229 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9404 place count 5897 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 220 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9606 place count 5796 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 210 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 9808 place count 5695 transition count 5396
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 203 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 9996 place count 5601 transition count 5396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9997 place count 5600 transition count 5395
Applied a total of 9997 rules in 5997 ms. Remains 5600 /10600 variables (removed 5000) and now considering 5395/9998 (removed 4603) transitions.
// Phase 1: matrix 5395 rows 5600 cols
[2022-05-15 22:12:41] [INFO ] Invariants computation overflowed in 106 ms
[2022-05-15 22:12:45] [INFO ] Implicit Places using invariants in 3972 ms returned []
// Phase 1: matrix 5395 rows 5600 cols
[2022-05-15 22:12:45] [INFO ] Invariants computation overflowed in 103 ms
[2022-05-15 22:12:46] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 5060 ms to find 0 implicit places.
[2022-05-15 22:12:46] [INFO ] Redundant transitions in 331 ms returned []
// Phase 1: matrix 5395 rows 5600 cols
[2022-05-15 22:12:47] [INFO ] Invariants computation overflowed in 104 ms
[2022-05-15 22:12:50] [INFO ] Dead Transitions using invariants and state equation in 3391 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5600/10600 places, 5395/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5600/10600 places, 5395/9998 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s896 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 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-03 finished in 15045 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U !G(F(!((p1 U X(p1)) U p2)))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3274 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:12:54] [INFO ] Invariants computation overflowed in 278 ms
[2022-05-15 22:12:54] [INFO ] Implicit Places using invariants in 1055 ms returned []
Implicit Place search using SMT only with invariants took 1055 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:12:55] [INFO ] Invariants computation overflowed in 232 ms
[2022-05-15 22:12:55] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), false]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s3853 1) (GEQ s3880 1)) (AND (GEQ s2182 1) (GEQ s2259 1))), p1:(AND (GEQ s2182 1) (GEQ s2259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 3 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-04 finished in 7137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(G(X(F(p0)))))))'
Support contains 2 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10599 transition count 7599
Reduce places removed 2398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4797 place count 8201 transition count 7598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4798 place count 8200 transition count 7598
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4798 place count 8200 transition count 7198
Deduced a syphon composed of 400 places in 780 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1802 Post agglomeration using F-continuation condition.Transition count delta: 1802
Deduced a syphon composed of 1802 places in 275 ms
Reduce places removed 1802 places and 0 transitions.
Iterating global reduction 3 with 3604 rules applied. Total rules applied 9202 place count 5998 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 284 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9404 place count 5897 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 202 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9606 place count 5796 transition count 5396
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 204 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9808 place count 5695 transition count 5396
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 187 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9998 place count 5600 transition count 5396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9999 place count 5599 transition count 5395
Applied a total of 9999 rules in 5692 ms. Remains 5599 /10600 variables (removed 5001) and now considering 5395/9998 (removed 4603) transitions.
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:03] [INFO ] Invariants computation overflowed in 100 ms
[2022-05-15 22:13:07] [INFO ] Implicit Places using invariants in 3798 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:07] [INFO ] Invariants computation overflowed in 102 ms
[2022-05-15 22:13:08] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 4807 ms to find 0 implicit places.
[2022-05-15 22:13:08] [INFO ] Redundant transitions in 337 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:08] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 22:13:12] [INFO ] Dead Transitions using invariants and state equation in 3488 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5599/10600 places, 5395/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5599/10600 places, 5395/9998 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s239 1) (LT s1492 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12937 reset in 278 ms.
Product exploration explored 100000 steps with 12896 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17774 edges and 5599 vertex of which 5597 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 777 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 146 steps, run visited all 1 properties in 9 ms. (steps per millisecond=16 )
Probabilistic random walk after 146 steps, saw 79 distinct states, run finished after 10 ms. (steps per millisecond=14 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5599 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5599/5599 places, 5395/5395 transitions.
Applied a total of 0 rules in 472 ms. Remains 5599 /5599 variables (removed 0) and now considering 5395/5395 (removed 0) transitions.
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:14] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 22:13:18] [INFO ] Implicit Places using invariants in 3859 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:18] [INFO ] Invariants computation overflowed in 103 ms
[2022-05-15 22:13:19] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 4871 ms to find 0 implicit places.
[2022-05-15 22:13:19] [INFO ] Redundant transitions in 333 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:19] [INFO ] Invariants computation overflowed in 108 ms
[2022-05-15 22:13:23] [INFO ] Dead Transitions using invariants and state equation in 3512 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5599/5599 places, 5395/5395 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17774 edges and 5599 vertex of which 5597 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 786 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 146 steps, run visited all 1 properties in 9 ms. (steps per millisecond=16 )
Probabilistic random walk after 146 steps, saw 79 distinct states, run finished after 9 ms. (steps per millisecond=16 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12935 reset in 264 ms.
Product exploration explored 100000 steps with 12979 reset in 299 ms.
Built C files in :
/tmp/ltsmin12177661185175812072
[2022-05-15 22:13:24] [INFO ] Too many transitions (5395) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:13:24] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12177661185175812072
Running compilation step : cd /tmp/ltsmin12177661185175812072;'/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/ltsmin12177661185175812072;'/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/ltsmin12177661185175812072;'/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 5599 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5599/5599 places, 5395/5395 transitions.
Applied a total of 0 rules in 517 ms. Remains 5599 /5599 variables (removed 0) and now considering 5395/5395 (removed 0) transitions.
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:28] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 22:13:32] [INFO ] Implicit Places using invariants in 4046 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:32] [INFO ] Invariants computation overflowed in 104 ms
[2022-05-15 22:13:33] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 5181 ms to find 0 implicit places.
[2022-05-15 22:13:33] [INFO ] Redundant transitions in 333 ms returned []
// Phase 1: matrix 5395 rows 5599 cols
[2022-05-15 22:13:33] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 22:13:37] [INFO ] Dead Transitions using invariants and state equation in 3543 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5599/5599 places, 5395/5395 transitions.
Built C files in :
/tmp/ltsmin11819875817199546588
[2022-05-15 22:13:37] [INFO ] Too many transitions (5395) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:13:37] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11819875817199546588
Running compilation step : cd /tmp/ltsmin11819875817199546588;'/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/ltsmin11819875817199546588;'/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/ltsmin11819875817199546588;'/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-15 22:13:41] [INFO ] Flatten gal took : 244 ms
[2022-05-15 22:13:41] [INFO ] Flatten gal took : 211 ms
[2022-05-15 22:13:41] [INFO ] Time to serialize gal into /tmp/LTL11521609493154774665.gal : 19 ms
[2022-05-15 22:13:41] [INFO ] Time to serialize properties into /tmp/LTL5404719414668380484.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/LTL11521609493154774665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5404719414668380484.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/LTL1152160...267
Read 1 LTL properties
Checking formula 0 : !((G((G("((p104<1)||(p30<1))"))||(F(G(X(F("((p104<1)||(p30<1))"))))))))
Formula 0 simplified : !G(G"((p104<1)||(p30<1))" | FGXF"((p104<1)||(p30<1))")
Detected timeout of ITS tools.
[2022-05-15 22:13:56] [INFO ] Flatten gal took : 173 ms
[2022-05-15 22:13:56] [INFO ] Applying decomposition
[2022-05-15 22:13:57] [INFO ] Flatten gal took : 176 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/graph2002342695654108450.txt' '-o' '/tmp/graph2002342695654108450.bin' '-w' '/tmp/graph2002342695654108450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2002342695654108450.bin' '-l' '-1' '-v' '-w' '/tmp/graph2002342695654108450.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:13:57] [INFO ] Decomposing Gal with order
[2022-05-15 22:13:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:13:59] [INFO ] Removed a total of 4257 redundant transitions.
[2022-05-15 22:13:59] [INFO ] Flatten gal took : 392 ms
[2022-05-15 22:13:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 107 ms.
[2022-05-15 22:13:59] [INFO ] Time to serialize gal into /tmp/LTL13650602624738481938.gal : 42 ms
[2022-05-15 22:13:59] [INFO ] Time to serialize properties into /tmp/LTL5865428052478107981.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/LTL13650602624738481938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5865428052478107981.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/LTL1365060...246
Read 1 LTL properties
Checking formula 0 : !((G((G("((i21.i1.i0.u68.p104<1)||(i21.i1.i0.u2089.p30<1))"))||(F(G(X(F("((i21.i1.i0.u68.p104<1)||(i21.i1.i0.u2089.p30<1))"))))))))
Formula 0 simplified : !G(G"((i21.i1.i0.u68.p104<1)||(i21.i1.i0.u2089.p30<1))" | FGXF"((i21.i1.i0.u68.p104<1)||(i21.i1.i0.u2089.p30<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin681533672284890573
[2022-05-15 22:14:14] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin681533672284890573
Running compilation step : cd /tmp/ltsmin681533672284890573;'/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/ltsmin681533672284890573;'/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/ltsmin681533672284890573;'/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 DoubleExponent-PT-200-LTLFireability-05 finished in 79866 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(((G(F(p0)) U p1)||G(p0)))&&X(X(p2)))))'
Support contains 3 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3391 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:14:21] [INFO ] Invariants computation overflowed in 319 ms
[2022-05-15 22:14:22] [INFO ] Implicit Places using invariants in 1112 ms returned []
Implicit Place search using SMT only with invariants took 1121 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:14:22] [INFO ] Invariants computation overflowed in 230 ms
[2022-05-15 22:14:23] [INFO ] Dead Transitions using invariants and state equation in 1008 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s2096 1), p0:(GEQ s39 1), p2:(GEQ s9236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-06 finished in 7417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((G(F(G((G(X(p1))||F(p2)))))&&p0)))))'
Support contains 6 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2390 transitions
Trivial Post-agglo rules discarded 2390 transitions
Performed 2390 trivial Post agglomeration. Transition count delta: 2390
Iterating post reduction 0 with 2390 rules applied. Total rules applied 2390 place count 10599 transition count 7607
Reduce places removed 2390 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 2394 rules applied. Total rules applied 4784 place count 8209 transition count 7603
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 4788 place count 8205 transition count 7603
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4788 place count 8205 transition count 7201
Deduced a syphon composed of 402 places in 787 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5592 place count 7803 transition count 7201
Performed 1800 Post agglomeration using F-continuation condition.Transition count delta: 1800
Deduced a syphon composed of 1800 places in 278 ms
Reduce places removed 1800 places and 0 transitions.
Iterating global reduction 3 with 3600 rules applied. Total rules applied 9192 place count 6003 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 301 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9394 place count 5902 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 208 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9596 place count 5801 transition count 5401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 196 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9798 place count 5700 transition count 5401
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 197 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9988 place count 5605 transition count 5401
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9989 place count 5605 transition count 5401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9990 place count 5604 transition count 5400
Applied a total of 9990 rules in 6340 ms. Remains 5604 /10600 variables (removed 4996) and now considering 5400/9998 (removed 4598) transitions.
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:14:31] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 22:14:35] [INFO ] Implicit Places using invariants in 3791 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:14:35] [INFO ] Invariants computation overflowed in 111 ms
[2022-05-15 22:14:36] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 4822 ms to find 0 implicit places.
[2022-05-15 22:14:36] [INFO ] Redundant transitions in 338 ms returned []
// Phase 1: matrix 5400 rows 5604 cols
[2022-05-15 22:14:36] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 22:14:40] [INFO ] Dead Transitions using invariants and state equation in 3557 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5604/10600 places, 5400/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5604/10600 places, 5400/9998 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2720 1) (GEQ s2726 1)), p1:(AND (GEQ s1714 1) (GEQ s1721 1)), p2:(AND (GEQ s3442 1) (GEQ s3500 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-07 finished in 15443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(p0)))||(F(p1)&&p2))))'
Support contains 3 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3232 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:14:43] [INFO ] Invariants computation overflowed in 266 ms
[2022-05-15 22:14:44] [INFO ] Implicit Places using invariants in 1056 ms returned []
Implicit Place search using SMT only with invariants took 1057 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:14:45] [INFO ] Invariants computation overflowed in 264 ms
[2022-05-15 22:14:45] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s4454 1), p2:(GEQ s5364 1), p0:(GEQ s2943 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-08 finished in 7275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X((G(X(X(p1))) U p1)) U p2))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 3230 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:14:51] [INFO ] Invariants computation overflowed in 230 ms
[2022-05-15 22:14:52] [INFO ] Implicit Places using invariants in 1272 ms returned []
Implicit Place search using SMT only with invariants took 1273 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2022-05-15 22:14:52] [INFO ] Invariants computation overflowed in 246 ms
[2022-05-15 22:14:53] [INFO ] Dead Transitions using invariants and state equation in 1156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10600/10600 places, 9998/9998 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (GEQ s5519 1) (GEQ s3848 1)), p0:(GEQ s3848 1), p1:(AND (GEQ s8711 1) (GEQ s8793 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-09 finished in 7600 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(p0)&&X((F(p1)||X(p2))))))))'
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10599 transition count 7599
Reduce places removed 2398 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4798 place count 8201 transition count 7597
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7198
Deduced a syphon composed of 399 places in 692 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 5598 place count 7800 transition count 7198
Performed 1801 Post agglomeration using F-continuation condition.Transition count delta: 1801
Deduced a syphon composed of 1801 places in 275 ms
Reduce places removed 1801 places and 0 transitions.
Iterating global reduction 3 with 3602 rules applied. Total rules applied 9200 place count 5999 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 218 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9402 place count 5898 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 210 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9604 place count 5797 transition count 5397
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 196 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9806 place count 5696 transition count 5397
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 192 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 9994 place count 5602 transition count 5397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9995 place count 5601 transition count 5396
Applied a total of 9995 rules in 5610 ms. Remains 5601 /10600 variables (removed 4999) and now considering 5396/9998 (removed 4602) transitions.
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:15:01] [INFO ] Invariants computation overflowed in 119 ms
[2022-05-15 22:15:04] [INFO ] Implicit Places using invariants in 3755 ms returned []
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:15:04] [INFO ] Invariants computation overflowed in 118 ms
[2022-05-15 22:15:05] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 4783 ms to find 0 implicit places.
[2022-05-15 22:15:06] [INFO ] Redundant transitions in 331 ms returned []
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:15:06] [INFO ] Invariants computation overflowed in 123 ms
[2022-05-15 22:15:09] [INFO ] Dead Transitions using invariants and state equation in 3576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5601/10600 places, 5396/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5601/10600 places, 5396/9998 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1088 1) (LT s1130 1)), p1:(LT s2244 1), p2:(LT s5187 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13841 reset in 319 ms.
Product exploration explored 100000 steps with 13825 reset in 314 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17773 edges and 5601 vertex of which 5599 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 412 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 813 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 790 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 51752 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51752 steps, saw 25887 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:15:15] [INFO ] Invariants computation overflowed in 120 ms
[2022-05-15 22:15:40] [INFO ] After 24019ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-15 22:15:40] [INFO ] State equation strengthened by 398 read => feed constraints.
[2022-05-15 22:15:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:15:40] [INFO ] After 25067ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5601 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5601/5601 places, 5396/5396 transitions.
Graph (complete) has 16973 edges and 5601 vertex of which 5599 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5599 transition count 5394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5599 transition count 5393
Deduced a syphon composed of 1 places in 198 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5598 transition count 5393
Free-agglomeration rule (complex) applied 795 times.
Iterating global reduction 1 with 795 rules applied. Total rules applied 800 place count 5598 transition count 4598
Reduce places removed 795 places and 0 transitions.
Iterating post reduction 1 with 795 rules applied. Total rules applied 1595 place count 4803 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 2 with 798 rules applied. Total rules applied 2393 place count 4803 transition count 4598
Applied a total of 2393 rules in 3307 ms. Remains 4803 /5601 variables (removed 798) and now considering 4598/5396 (removed 798) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/5601 places, 4598/5396 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 58201 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58201 steps, saw 29110 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:15:48] [INFO ] Invariants computation overflowed in 61 ms
[2022-05-15 22:16:13] [INFO ] After 25047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:16:38] [INFO ] After 24053ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 22:16:38] [INFO ] State equation strengthened by 798 read => feed constraints.
[2022-05-15 22:16:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:16:38] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 4598/4598 transitions.
Applied a total of 0 rules in 1128 ms. Remains 4803 /4803 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4803 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 4598/4598 transitions.
Applied a total of 0 rules in 1112 ms. Remains 4803 /4803 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:16:40] [INFO ] Invariants computation overflowed in 63 ms
[2022-05-15 22:17:11] [INFO ] Performed 1103/4803 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:17:41] [INFO ] Performed 2058/4803 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:18:11] [INFO ] Performed 3073/4803 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:18:41] [INFO ] Performed 4426/4803 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:18:41] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:18:41] [INFO ] Implicit Places using invariants in 120996 ms returned []
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:18:41] [INFO ] Invariants computation overflowed in 59 ms
[2022-05-15 22:18:42] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 121886 ms to find 0 implicit places.
[2022-05-15 22:18:43] [INFO ] Redundant transitions in 599 ms returned []
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:18:43] [INFO ] Invariants computation overflowed in 77 ms
[2022-05-15 22:18:48] [INFO ] Dead Transitions using invariants and state equation in 4702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4803 places, 4598/4598 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 347 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 4 out of 5601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5601/5601 places, 5396/5396 transitions.
Applied a total of 0 rules in 481 ms. Remains 5601 /5601 variables (removed 0) and now considering 5396/5396 (removed 0) transitions.
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:18:49] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 22:18:53] [INFO ] Implicit Places using invariants in 3851 ms returned []
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:18:53] [INFO ] Invariants computation overflowed in 125 ms
[2022-05-15 22:18:54] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 4876 ms to find 0 implicit places.
[2022-05-15 22:18:54] [INFO ] Redundant transitions in 330 ms returned []
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:18:55] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 22:18:58] [INFO ] Dead Transitions using invariants and state equation in 3514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5601/5601 places, 5396/5396 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17773 edges and 5601 vertex of which 5599 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 393 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 1403 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 803 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 52515 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52515 steps, saw 26263 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:19:03] [INFO ] Invariants computation overflowed in 120 ms
[2022-05-15 22:19:28] [INFO ] After 24026ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-15 22:19:28] [INFO ] State equation strengthened by 398 read => feed constraints.
[2022-05-15 22:19:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:19:28] [INFO ] After 25055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5601 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5601/5601 places, 5396/5396 transitions.
Graph (complete) has 16973 edges and 5601 vertex of which 5599 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5599 transition count 5394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5599 transition count 5393
Deduced a syphon composed of 1 places in 180 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5598 transition count 5393
Free-agglomeration rule (complex) applied 795 times.
Iterating global reduction 1 with 795 rules applied. Total rules applied 800 place count 5598 transition count 4598
Reduce places removed 795 places and 0 transitions.
Iterating post reduction 1 with 795 rules applied. Total rules applied 1595 place count 4803 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 2 with 798 rules applied. Total rules applied 2393 place count 4803 transition count 4598
Applied a total of 2393 rules in 3078 ms. Remains 4803 /5601 variables (removed 798) and now considering 4598/5396 (removed 798) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/5601 places, 4598/5396 transitions.
Incomplete random walk after 10000 steps, including 1243 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 59192 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59192 steps, saw 29619 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:19:35] [INFO ] Invariants computation overflowed in 56 ms
[2022-05-15 22:20:00] [INFO ] After 24159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2022-05-15 22:20:00] [INFO ] State equation strengthened by 798 read => feed constraints.
[2022-05-15 22:20:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 22:20:00] [INFO ] After 25077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 4598/4598 transitions.
Applied a total of 0 rules in 1144 ms. Remains 4803 /4803 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4803 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4803/4803 places, 4598/4598 transitions.
Applied a total of 0 rules in 1110 ms. Remains 4803 /4803 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:20:03] [INFO ] Invariants computation overflowed in 62 ms
[2022-05-15 22:20:33] [INFO ] Performed 1103/4803 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:21:03] [INFO ] Performed 2058/4803 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:21:33] [INFO ] Performed 3095/4803 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:22:03] [INFO ] Performed 4481/4803 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:22:03] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:22:03] [INFO ] Implicit Places using invariants in 120544 ms returned []
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:22:03] [INFO ] Invariants computation overflowed in 59 ms
[2022-05-15 22:22:04] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 121468 ms to find 0 implicit places.
[2022-05-15 22:22:05] [INFO ] Redundant transitions in 597 ms returned []
// Phase 1: matrix 4598 rows 4803 cols
[2022-05-15 22:22:05] [INFO ] Invariants computation overflowed in 64 ms
[2022-05-15 22:22:09] [INFO ] Dead Transitions using invariants and state equation in 4716 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4803/4803 places, 4598/4598 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 445 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 3 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 13800 reset in 281 ms.
Product exploration explored 100000 steps with 13872 reset in 288 ms.
Built C files in :
/tmp/ltsmin17253459946717448081
[2022-05-15 22:22:11] [INFO ] Too many transitions (5396) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:22:12] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17253459946717448081
Running compilation step : cd /tmp/ltsmin17253459946717448081;'/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/ltsmin17253459946717448081;'/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/ltsmin17253459946717448081;'/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 5601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5601/5601 places, 5396/5396 transitions.
Applied a total of 0 rules in 482 ms. Remains 5601 /5601 variables (removed 0) and now considering 5396/5396 (removed 0) transitions.
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:22:15] [INFO ] Invariants computation overflowed in 151 ms
[2022-05-15 22:22:19] [INFO ] Implicit Places using invariants in 3917 ms returned []
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:22:19] [INFO ] Invariants computation overflowed in 110 ms
[2022-05-15 22:22:20] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 4935 ms to find 0 implicit places.
[2022-05-15 22:22:20] [INFO ] Redundant transitions in 336 ms returned []
// Phase 1: matrix 5396 rows 5601 cols
[2022-05-15 22:22:20] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 22:22:24] [INFO ] Dead Transitions using invariants and state equation in 3358 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5601/5601 places, 5396/5396 transitions.
Built C files in :
/tmp/ltsmin6384176707634640369
[2022-05-15 22:22:24] [INFO ] Too many transitions (5396) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:22:24] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6384176707634640369
Running compilation step : cd /tmp/ltsmin6384176707634640369;'/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/ltsmin6384176707634640369;'/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/ltsmin6384176707634640369;'/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-15 22:22:28] [INFO ] Flatten gal took : 168 ms
[2022-05-15 22:22:28] [INFO ] Flatten gal took : 172 ms
[2022-05-15 22:22:28] [INFO ] Time to serialize gal into /tmp/LTL923228278562055805.gal : 16 ms
[2022-05-15 22:22:28] [INFO ] Time to serialize properties into /tmp/LTL18415453360169474928.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/LTL923228278562055805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18415453360169474928.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/LTL9232282...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X("((p2310<1)||(p2383<1))"))&&(X((F("(p4281<1)"))||(X("(p9296<1)")))))))))
Formula 0 simplified : !GFG(X"((p2310<1)||(p2383<1))" & X(F"(p4281<1)" | X"(p9296<1)"))
Detected timeout of ITS tools.
[2022-05-15 22:22:43] [INFO ] Flatten gal took : 167 ms
[2022-05-15 22:22:43] [INFO ] Applying decomposition
[2022-05-15 22:22:43] [INFO ] Flatten gal took : 171 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/graph8479915537495099630.txt' '-o' '/tmp/graph8479915537495099630.bin' '-w' '/tmp/graph8479915537495099630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8479915537495099630.bin' '-l' '-1' '-v' '-w' '/tmp/graph8479915537495099630.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:22:44] [INFO ] Decomposing Gal with order
[2022-05-15 22:22:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:22:45] [INFO ] Removed a total of 4198 redundant transitions.
[2022-05-15 22:22:45] [INFO ] Flatten gal took : 302 ms
[2022-05-15 22:22:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 288 labels/synchronizations in 96 ms.
[2022-05-15 22:22:45] [INFO ] Time to serialize gal into /tmp/LTL13582960519363115516.gal : 43 ms
[2022-05-15 22:22:45] [INFO ] Time to serialize properties into /tmp/LTL10068450535235485466.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/LTL13582960519363115516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10068450535235485466.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/LTL1358296...247
Read 1 LTL properties
Checking formula 0 : !((G(F(G((X("((i5.i0.i0.u381.p2310<1)||(i5.i0.i0.u396.p2383<1))"))&&(X((F("(i11.i0.i1.u808.p4281<1)"))||(X("(i24.i1.i2.u1913.p9296<1)"...164
Formula 0 simplified : !GFG(X"((i5.i0.i0.u381.p2310<1)||(i5.i0.i0.u396.p2383<1))" & X(F"(i11.i0.i1.u808.p4281<1)" | X"(i24.i1.i2.u1913.p9296<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16733639461071858560
[2022-05-15 22:23:01] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16733639461071858560
Running compilation step : cd /tmp/ltsmin16733639461071858560;'/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/ltsmin16733639461071858560;'/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/ltsmin16733639461071858560;'/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 DoubleExponent-PT-200-LTLFireability-12 finished in 488688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((F(p1)&&p0)))))'
Support contains 5 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2394 transitions
Trivial Post-agglo rules discarded 2394 transitions
Performed 2394 trivial Post agglomeration. Transition count delta: 2394
Iterating post reduction 0 with 2394 rules applied. Total rules applied 2394 place count 10599 transition count 7603
Reduce places removed 2394 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4790 place count 8205 transition count 7601
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4792 place count 8203 transition count 7601
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4792 place count 8203 transition count 7199
Deduced a syphon composed of 402 places in 794 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5596 place count 7801 transition count 7199
Performed 1800 Post agglomeration using F-continuation condition.Transition count delta: 1800
Deduced a syphon composed of 1800 places in 277 ms
Reduce places removed 1800 places and 0 transitions.
Iterating global reduction 3 with 3600 rules applied. Total rules applied 9196 place count 6001 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 302 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9398 place count 5900 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 207 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9600 place count 5799 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 197 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9802 place count 5698 transition count 5399
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 94 places in 194 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 9990 place count 5604 transition count 5399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9991 place count 5603 transition count 5398
Applied a total of 9991 rules in 6028 ms. Remains 5603 /10600 variables (removed 4997) and now considering 5398/9998 (removed 4600) transitions.
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:23:10] [INFO ] Invariants computation overflowed in 148 ms
[2022-05-15 22:23:13] [INFO ] Implicit Places using invariants in 3888 ms returned []
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:23:14] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-15 22:23:15] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 5001 ms to find 0 implicit places.
[2022-05-15 22:23:15] [INFO ] Redundant transitions in 341 ms returned []
// Phase 1: matrix 5398 rows 5603 cols
[2022-05-15 22:23:15] [INFO ] Invariants computation overflowed in 101 ms
[2022-05-15 22:23:19] [INFO ] Dead Transitions using invariants and state equation in 3647 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5603/10600 places, 5398/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5603/10600 places, 5398/9998 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s4684 1) (LT s4696 1)), p0:(AND (GEQ s293 1) (GEQ s312 1) (OR (GEQ s3649 1) (AND (GEQ s4684 1) (GEQ s4696 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 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-200-LTLFireability-14 finished in 15367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))&&p1)))'
Found a SL insensitive property : DoubleExponent-PT-200-LTLFireability-00
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 10600 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2394 transitions
Trivial Post-agglo rules discarded 2394 transitions
Performed 2394 trivial Post agglomeration. Transition count delta: 2394
Iterating post reduction 0 with 2394 rules applied. Total rules applied 2394 place count 10599 transition count 7603
Reduce places removed 2394 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4790 place count 8205 transition count 7601
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4792 place count 8203 transition count 7601
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4792 place count 8203 transition count 7199
Deduced a syphon composed of 402 places in 740 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5596 place count 7801 transition count 7199
Performed 1800 Post agglomeration using F-continuation condition.Transition count delta: 1800
Deduced a syphon composed of 1800 places in 279 ms
Reduce places removed 1800 places and 0 transitions.
Iterating global reduction 3 with 3600 rules applied. Total rules applied 9196 place count 6001 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 223 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9398 place count 5900 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 248 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9600 place count 5799 transition count 5399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 216 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9802 place count 5698 transition count 5399
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 226 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9992 place count 5603 transition count 5399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9993 place count 5602 transition count 5398
Applied a total of 9993 rules in 5996 ms. Remains 5602 /10600 variables (removed 4998) and now considering 5398/9998 (removed 4600) transitions.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:23:25] [INFO ] Invariants computation overflowed in 105 ms
[2022-05-15 22:23:29] [INFO ] Implicit Places using invariants in 4035 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:23:29] [INFO ] Invariants computation overflowed in 113 ms
[2022-05-15 22:23:30] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 5018 ms to find 0 implicit places.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:23:30] [INFO ] Invariants computation overflowed in 98 ms
[2022-05-15 22:23:34] [INFO ] Dead Transitions using invariants and state equation in 3545 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 5602/10600 places, 5398/9998 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/10600 places, 5398/9998 transitions.
Running random walk in product with property : DoubleExponent-PT-200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s765 1) (LT s821 1)), p0:(OR (LT s2556 1) (LT s2767 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13854 reset in 315 ms.
Product exploration explored 100000 steps with 13879 reset in 450 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17771 edges and 5602 vertex of which 5600 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), true, (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1381 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 788 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 53728 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53728 steps, saw 26870 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:23:39] [INFO ] Invariants computation overflowed in 104 ms
[2022-05-15 22:24:02] [INFO ] After 22938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Graph (complete) has 16973 edges and 5602 vertex of which 5600 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5600 transition count 5396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5600 transition count 5395
Deduced a syphon composed of 1 places in 181 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5599 transition count 5395
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 1 with 797 rules applied. Total rules applied 802 place count 5599 transition count 4598
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 1 with 797 rules applied. Total rules applied 1599 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 2 with 798 rules applied. Total rules applied 2397 place count 4802 transition count 4598
Applied a total of 2397 rules in 3066 ms. Remains 4802 /5602 variables (removed 800) and now considering 4598/5398 (removed 800) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/5602 places, 4598/5398 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 64840 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64840 steps, saw 32442 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:24:09] [INFO ] Invariants computation overflowed in 77 ms
[2022-05-15 22:24:31] [INFO ] After 22238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1134 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1108 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:24:33] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-15 22:25:04] [INFO ] Performed 1098/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:25:34] [INFO ] Performed 2037/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:26:04] [INFO ] Performed 3074/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:26:34] [INFO ] Performed 4433/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:26:34] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:26:34] [INFO ] Implicit Places using invariants in 121004 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:26:34] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-15 22:26:35] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 121926 ms to find 0 implicit places.
[2022-05-15 22:26:36] [INFO ] Redundant transitions in 605 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:26:36] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-15 22:26:40] [INFO ] Dead Transitions using invariants and state equation in 4707 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), true, (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 232 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Applied a total of 0 rules in 454 ms. Remains 5602 /5602 variables (removed 0) and now considering 5398/5398 (removed 0) transitions.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:26:42] [INFO ] Invariants computation overflowed in 106 ms
[2022-05-15 22:26:46] [INFO ] Implicit Places using invariants in 4038 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:26:46] [INFO ] Invariants computation overflowed in 107 ms
[2022-05-15 22:26:47] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 5168 ms to find 0 implicit places.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:26:47] [INFO ] Invariants computation overflowed in 107 ms
[2022-05-15 22:26:51] [INFO ] Dead Transitions using invariants and state equation in 3705 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/5602 places, 5398/5398 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 17771 edges and 5602 vertex of which 5600 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1378 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 803 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 55519 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55519 steps, saw 27766 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:26:55] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-15 22:27:19] [INFO ] After 23595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Graph (complete) has 16973 edges and 5602 vertex of which 5600 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5600 transition count 5396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 5600 transition count 5395
Deduced a syphon composed of 1 places in 183 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 5599 transition count 5395
Free-agglomeration rule (complex) applied 797 times.
Iterating global reduction 1 with 797 rules applied. Total rules applied 802 place count 5599 transition count 4598
Reduce places removed 797 places and 0 transitions.
Iterating post reduction 1 with 797 rules applied. Total rules applied 1599 place count 4802 transition count 4598
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 798 times.
Drop transitions removed 798 transitions
Iterating global reduction 2 with 798 rules applied. Total rules applied 2397 place count 4802 transition count 4598
Applied a total of 2397 rules in 3093 ms. Remains 4802 /5602 variables (removed 800) and now considering 4598/5398 (removed 800) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/5602 places, 4598/5398 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 63442 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63442 steps, saw 31749 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:27:26] [INFO ] Invariants computation overflowed in 86 ms
[2022-05-15 22:27:48] [INFO ] After 22542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 4802 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1121 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4802/4802 places, 4598/4598 transitions.
Applied a total of 0 rules in 1102 ms. Remains 4802 /4802 variables (removed 0) and now considering 4598/4598 (removed 0) transitions.
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:27:51] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-15 22:28:21] [INFO ] Performed 1103/4802 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-05-15 22:28:52] [INFO ] Performed 2058/4802 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2022-05-15 22:29:22] [INFO ] Performed 3079/4802 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2022-05-15 22:29:52] [INFO ] Performed 4460/4802 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2022-05-15 22:29:52] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2022-05-15 22:29:52] [INFO ] Implicit Places using invariants in 120974 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:29:52] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-15 22:29:53] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 121887 ms to find 0 implicit places.
[2022-05-15 22:29:53] [INFO ] Redundant transitions in 599 ms returned []
// Phase 1: matrix 4598 rows 4802 cols
[2022-05-15 22:29:53] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-15 22:29:58] [INFO ] Dead Transitions using invariants and state equation in 4724 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4802/4802 places, 4598/4598 transitions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 13885 reset in 267 ms.
Product exploration explored 100000 steps with 13823 reset in 278 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 5602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Applied a total of 0 rules in 488 ms. Remains 5602 /5602 variables (removed 0) and now considering 5398/5398 (removed 0) transitions.
[2022-05-15 22:30:01] [INFO ] Redundant transitions in 339 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:30:01] [INFO ] Invariants computation overflowed in 106 ms
[2022-05-15 22:30:04] [INFO ] Dead Transitions using invariants and state equation in 3773 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/5602 places, 5398/5398 transitions.
Product exploration explored 100000 steps with 13872 reset in 4944 ms.
Product exploration explored 100000 steps with 13839 reset in 4947 ms.
Built C files in :
/tmp/ltsmin3901573711336914340
[2022-05-15 22:30:14] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3901573711336914340
Running compilation step : cd /tmp/ltsmin3901573711336914340;'/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/ltsmin3901573711336914340;'/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/ltsmin3901573711336914340;'/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 5602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5602/5602 places, 5398/5398 transitions.
Applied a total of 0 rules in 479 ms. Remains 5602 /5602 variables (removed 0) and now considering 5398/5398 (removed 0) transitions.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:30:18] [INFO ] Invariants computation overflowed in 116 ms
[2022-05-15 22:30:22] [INFO ] Implicit Places using invariants in 3879 ms returned []
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:30:22] [INFO ] Invariants computation overflowed in 102 ms
[2022-05-15 22:30:23] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 4898 ms to find 0 implicit places.
// Phase 1: matrix 5398 rows 5602 cols
[2022-05-15 22:30:23] [INFO ] Invariants computation overflowed in 100 ms
[2022-05-15 22:30:26] [INFO ] Dead Transitions using invariants and state equation in 3564 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5602/5602 places, 5398/5398 transitions.
Built C files in :
/tmp/ltsmin9970736746370524587
[2022-05-15 22:30:27] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9970736746370524587
Running compilation step : cd /tmp/ltsmin9970736746370524587;'/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/ltsmin9970736746370524587;'/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/ltsmin9970736746370524587;'/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-15 22:30:30] [INFO ] Flatten gal took : 171 ms
[2022-05-15 22:30:30] [INFO ] Flatten gal took : 173 ms
[2022-05-15 22:30:30] [INFO ] Time to serialize gal into /tmp/LTL13805591397893173902.gal : 16 ms
[2022-05-15 22:30:30] [INFO ] Time to serialize properties into /tmp/LTL369529671816838494.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/LTL13805591397893173902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL369529671816838494.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/LTL1380559...266
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((p481<1)||(p517<1))")))&&("((p1752<1)||(p1848<1))"))))
Formula 0 simplified : !G("((p1752<1)||(p1848<1))" & XX"((p481<1)||(p517<1))")
Detected timeout of ITS tools.
[2022-05-15 22:30:46] [INFO ] Flatten gal took : 166 ms
[2022-05-15 22:30:46] [INFO ] Applying decomposition
[2022-05-15 22:30:46] [INFO ] Flatten gal took : 171 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/graph7612203369688855661.txt' '-o' '/tmp/graph7612203369688855661.bin' '-w' '/tmp/graph7612203369688855661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7612203369688855661.bin' '-l' '-1' '-v' '-w' '/tmp/graph7612203369688855661.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:30:46] [INFO ] Decomposing Gal with order
[2022-05-15 22:30:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:30:48] [INFO ] Removed a total of 4301 redundant transitions.
[2022-05-15 22:30:48] [INFO ] Flatten gal took : 307 ms
[2022-05-15 22:30:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 226 labels/synchronizations in 98 ms.
[2022-05-15 22:30:48] [INFO ] Time to serialize gal into /tmp/LTL2326958741450543434.gal : 46 ms
[2022-05-15 22:30:48] [INFO ] Time to serialize properties into /tmp/LTL18119461784378060856.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/LTL2326958741450543434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18119461784378060856.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/LTL2326958...246
Read 1 LTL properties
Checking formula 0 : !((G((X(X("((i12.i0.i1.u1042.p481<1)||(i12.i0.i1.u1042.p517<1))")))&&("((i3.u284.p1752<1)||(i3.u305.p1848<1))"))))
Formula 0 simplified : !G("((i3.u284.p1752<1)||(i3.u305.p1848<1))" & XX"((i12.i0.i1.u1042.p481<1)||(i12.i0.i1.u1042.p517<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9123130921767875730
[2022-05-15 22:31:03] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9123130921767875730
Running compilation step : cd /tmp/ltsmin9123130921767875730;'/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/ltsmin9123130921767875730;'/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/ltsmin9123130921767875730;'/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 DoubleExponent-PT-200-LTLFireability-00 finished in 467099 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(G(X(F(p0)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(p0)&&X((F(p1)||X(p2))))))))'
[2022-05-15 22:31:07] [INFO ] Flatten gal took : 259 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4390038539868333221
[2022-05-15 22:31:07] [INFO ] Too many transitions (9998) to apply POR reductions. Disabling POR matrices.
[2022-05-15 22:31:07] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4390038539868333221
Running compilation step : cd /tmp/ltsmin4390038539868333221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 22:31:07] [INFO ] Applying decomposition
[2022-05-15 22:31:07] [INFO ] Flatten gal took : 268 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9435075439626110710.txt' '-o' '/tmp/graph9435075439626110710.bin' '-w' '/tmp/graph9435075439626110710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9435075439626110710.bin' '-l' '-1' '-v' '-w' '/tmp/graph9435075439626110710.weights' '-q' '0' '-e' '0.001'
[2022-05-15 22:31:08] [INFO ] Decomposing Gal with order
[2022-05-15 22:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 22:31:15] [INFO ] Removed a total of 2836 redundant transitions.
[2022-05-15 22:31:15] [INFO ] Flatten gal took : 439 ms
[2022-05-15 22:31:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 195 ms.
[2022-05-15 22:31:16] [INFO ] Time to serialize gal into /tmp/LTLFireability3616799468873931673.gal : 126 ms
[2022-05-15 22:31:16] [INFO ] Time to serialize properties into /tmp/LTLFireability9627793660848968591.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/LTLFireability3616799468873931673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9627793660848968591.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 4 LTL properties
Checking formula 0 : !((G((X(X("((i13.u1868.p481<1)||(i13.u2240.p517<1))")))&&("((i5.i0.i4.i2.u623.p1752<1)||(i5.i0.i4.i2.u624.p1848<1))"))))
Formula 0 simplified : !G("((i5.i0.i4.i2.u623.p1752<1)||(i5.i0.i4.i2.u624.p1848<1))" & XX"((i13.u1868.p481<1)||(i13.u2240.p517<1))")
Compilation finished in 65147 ms.
Running link step : cd /tmp/ltsmin4390038539868333221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin4390038539868333221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin4390038539868333221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X((LTLAPp0==true)))&&(LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4390038539868333221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp2==true))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-200"
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 DoubleExponent-PT-200, 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 r078-tall-165260110000220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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