Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599400524.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 ServersAndClients-PT-200320, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599400524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 41M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-200320-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652975842218

Running Version 202205111006
[2022-05-19 15:57:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 15:57:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:57:25] [INFO ] Load time of PNML (sax parser for PT used): 1732 ms
[2022-05-19 15:57:25] [INFO ] Transformed 65121 places.
[2022-05-19 15:57:25] [INFO ] Transformed 128400 transitions.
[2022-05-19 15:57:25] [INFO ] Parsed PT model containing 65121 places and 128400 transitions in 2147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 83 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-200320-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1298 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:57:29] [INFO ] Computed 721 place invariants in 2224 ms
[2022-05-19 15:57:34] [INFO ] Implicit Places using invariants in 6994 ms returned []
Implicit Place search using SMT only with invariants took 7056 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:57:37] [INFO ] Computed 721 place invariants in 2656 ms
[2022-05-19 15:57:42] [INFO ] Dead Transitions using invariants and state equation in 7889 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Support contains 49 out of 65121 places after structural reductions.
[2022-05-19 15:57:46] [INFO ] Flatten gal took : 3877 ms
[2022-05-19 15:57:50] [INFO ] Flatten gal took : 3685 ms
[2022-05-19 15:57:58] [INFO ] Input system was already deterministic with 128400 transitions.
Support contains 45 out of 65121 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2029 ms. (steps per millisecond=4 ) properties (out of 34) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:58:04] [INFO ] Computed 721 place invariants in 2793 ms
[2022-05-19 15:58:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 15:58:29] [INFO ] After 25131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63976 transitions
Trivial Post-agglo rules discarded 63976 transitions
Performed 63976 trivial Post agglomeration. Transition count delta: 63976
Iterating post reduction 0 with 63976 rules applied. Total rules applied 63976 place count 65121 transition count 64424
Reduce places removed 64273 places and 0 transitions.
Ensure Unique test removed 59200 transitions
Reduce isomorphic transitions removed 59200 transitions.
Iterating post reduction 1 with 123473 rules applied. Total rules applied 187449 place count 848 transition count 5224
Drop transitions removed 4576 transitions
Redundant transition composition rules discarded 4576 transitions
Iterating global reduction 2 with 4576 rules applied. Total rules applied 192025 place count 848 transition count 648
Discarding 176 places :
Implicit places reduction removed 176 places
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 2 with 528 rules applied. Total rules applied 192553 place count 672 transition count 296
Reduce places removed 528 places and 0 transitions.
Drop transitions removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Iterating post reduction 3 with 704 rules applied. Total rules applied 193257 place count 144 transition count 120
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 193281 place count 144 transition count 120
Applied a total of 193281 rules in 2463 ms. Remains 144 /65121 variables (removed 64977) and now considering 120/128400 (removed 128280) transitions.
Finished structural reductions, in 1 iterations. Remains : 144/65121 places, 120/128400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 144 cols
[2022-05-19 15:58:31] [INFO ] Computed 72 place invariants in 2 ms
[2022-05-19 15:58:31] [INFO ] [Real]Absence check using 48 positive place invariants in 9 ms returned sat
[2022-05-19 15:58:31] [INFO ] [Real]Absence check using 48 positive and 24 generalized place invariants in 4 ms returned sat
[2022-05-19 15:58:31] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ServersAndClients-PT-200320-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(!(p0 U F(G(!G(!p0))))))))'
Support contains 2 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63481 transitions
Trivial Post-agglo rules discarded 63481 transitions
Performed 63481 trivial Post agglomeration. Transition count delta: 63481
Iterating post reduction 0 with 63481 rules applied. Total rules applied 63481 place count 65121 transition count 64919
Reduce places removed 63481 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 63800 rules applied. Total rules applied 127281 place count 1640 transition count 64600
Reduce places removed 638 places and 0 transitions.
Ensure Unique test removed 63600 transitions
Reduce isomorphic transitions removed 63600 transitions.
Iterating post reduction 2 with 64238 rules applied. Total rules applied 191519 place count 1002 transition count 1000
Applied a total of 191519 rules in 2449 ms. Remains 1002 /65121 variables (removed 64119) and now considering 1000/128400 (removed 127400) transitions.
// Phase 1: matrix 1000 rows 1002 cols
[2022-05-19 15:58:35] [INFO ] Computed 402 place invariants in 8 ms
[2022-05-19 15:58:35] [INFO ] Implicit Places using invariants in 579 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 588 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 602/65121 places, 1000/128400 transitions.
Graph (trivial) has 598 edges and 602 vertex of which 399 / 602 are part of one of the 1 SCC in 3 ms
Free SCC test removed 398 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 6 transition count 206
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 6 transition count 206
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 597 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 4 transition count 6
Applied a total of 599 rules in 14 ms. Remains 4 /602 variables (removed 598) and now considering 6/1000 (removed 994) transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:58:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:58:35] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:58:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:58:35] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/65121 places, 6/128400 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/65121 places, 6/128400 transitions.
Stuttering acceptance computed with spot in 138 ms :[p0]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-00 finished in 3494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(p0)))))'
Support contains 1 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63999 transitions
Trivial Post-agglo rules discarded 63999 transitions
Performed 63999 trivial Post agglomeration. Transition count delta: 63999
Iterating post reduction 0 with 63999 rules applied. Total rules applied 63999 place count 65121 transition count 64401
Reduce places removed 64318 places and 0 transitions.
Ensure Unique test removed 63600 transitions
Reduce isomorphic transitions removed 63600 transitions.
Iterating post reduction 1 with 127918 rules applied. Total rules applied 191917 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 192116 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 2 with 597 rules applied. Total rules applied 192713 place count 604 transition count 204
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 795 rules applied. Total rules applied 193508 place count 7 transition count 6
Applied a total of 193508 rules in 1915 ms. Remains 7 /65121 variables (removed 65114) and now considering 6/128400 (removed 128394) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 15:58:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 15:58:38] [INFO ] Implicit Places using invariants in 25 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/65121 places, 6/128400 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:58:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:58:38] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:58:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:58:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/65121 places, 3/128400 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/65121 places, 3/128400 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-01 finished in 2248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(p1)) U X(p2)))'
Support contains 5 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 2115 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:58:42] [INFO ] Computed 721 place invariants in 2132 ms
[2022-05-19 15:58:46] [INFO ] Implicit Places using invariants in 6283 ms returned []
Implicit Place search using SMT only with invariants took 6286 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:58:49] [INFO ] Computed 721 place invariants in 2462 ms
[2022-05-19 15:58:54] [INFO ] Dead Transitions using invariants and state equation in 7553 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s62484 1), p2:(OR (GEQ s27789 1) (AND (GEQ s777 1) (GEQ s60498 1))), p1:(LT s57654 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 23 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-02 finished in 16646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0))&&p1))))'
Support contains 3 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1727 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:58:59] [INFO ] Computed 721 place invariants in 2286 ms
[2022-05-19 15:59:04] [INFO ] Implicit Places using invariants in 7845 ms returned []
Implicit Place search using SMT only with invariants took 7846 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:59:06] [INFO ] Computed 721 place invariants in 1943 ms
[2022-05-19 15:59:11] [INFO ] Dead Transitions using invariants and state equation in 6969 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s15416 1) (AND (GEQ s505 1) (GEQ s29142 1))), p0:(GEQ s15416 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 28 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-04 finished in 17151 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U p1)&&F(G(!p1))&&F(p2)))'
Support contains 5 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1860 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:59:16] [INFO ] Computed 721 place invariants in 2320 ms
[2022-05-19 15:59:21] [INFO ] Implicit Places using invariants in 7115 ms returned []
Implicit Place search using SMT only with invariants took 7115 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:59:23] [INFO ] Computed 721 place invariants in 1927 ms
[2022-05-19 15:59:28] [INFO ] Dead Transitions using invariants and state equation in 7259 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, p1, (NOT p2), (OR (NOT p1) p0), true]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s657 1) (GEQ s64518 1)), p1:(GEQ s25477 1), p0:(AND (GEQ s573 1) (GEQ s24117 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]]
Entered a terminal (fully accepting) state of product in 4631 steps with 5 reset in 671 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-05 finished in 17439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63998 transitions
Trivial Post-agglo rules discarded 63998 transitions
Performed 63998 trivial Post agglomeration. Transition count delta: 63998
Iterating post reduction 0 with 63998 rules applied. Total rules applied 63998 place count 65121 transition count 64402
Reduce places removed 64316 places and 0 transitions.
Ensure Unique test removed 63400 transitions
Reduce isomorphic transitions removed 63400 transitions.
Iterating post reduction 1 with 127716 rules applied. Total rules applied 191714 place count 805 transition count 1002
Drop transitions removed 398 transitions
Redundant transition composition rules discarded 398 transitions
Iterating global reduction 2 with 398 rules applied. Total rules applied 192112 place count 805 transition count 604
Discarding 198 places :
Implicit places reduction removed 198 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 2 with 594 rules applied. Total rules applied 192706 place count 607 transition count 208
Reduce places removed 594 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 3 with 791 rules applied. Total rules applied 193497 place count 13 transition count 11
Applied a total of 193497 rules in 1688 ms. Remains 13 /65121 variables (removed 65108) and now considering 11/128400 (removed 128389) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 15:59:31] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-19 15:59:31] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 43 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/65121 places, 11/128400 transitions.
Graph (trivial) has 7 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Applied a total of 1 rules in 1 ms. Remains 3 /7 variables (removed 4) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:59:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:59:31] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:59:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:59:31] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/65121 places, 5/128400 transitions.
Finished structural reductions, in 2 iterations. Remains : 3/65121 places, 5/128400 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s2 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-06 finished in 1968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p0)))'
Support contains 1 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1425 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:59:35] [INFO ] Computed 721 place invariants in 1925 ms
[2022-05-19 15:59:39] [INFO ] Implicit Places using invariants in 6153 ms returned []
Implicit Place search using SMT only with invariants took 6160 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 15:59:41] [INFO ] Computed 721 place invariants in 1713 ms
[2022-05-19 15:59:45] [INFO ] Dead Transitions using invariants and state equation in 6080 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s53107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 83680 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 14 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-07 finished in 24103 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63999 transitions
Trivial Post-agglo rules discarded 63999 transitions
Performed 63999 trivial Post agglomeration. Transition count delta: 63999
Iterating post reduction 0 with 63999 rules applied. Total rules applied 63999 place count 65121 transition count 64401
Reduce places removed 64318 places and 0 transitions.
Ensure Unique test removed 63600 transitions
Reduce isomorphic transitions removed 63600 transitions.
Iterating post reduction 1 with 127918 rules applied. Total rules applied 191917 place count 803 transition count 801
Drop transitions removed 199 transitions
Redundant transition composition rules discarded 199 transitions
Iterating global reduction 2 with 199 rules applied. Total rules applied 192116 place count 803 transition count 602
Discarding 199 places :
Implicit places reduction removed 199 places
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 2 with 597 rules applied. Total rules applied 192713 place count 604 transition count 204
Reduce places removed 597 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 3 with 795 rules applied. Total rules applied 193508 place count 7 transition count 6
Applied a total of 193508 rules in 1668 ms. Remains 7 /65121 variables (removed 65114) and now considering 6/128400 (removed 128394) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 15:59:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 15:59:57] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/65121 places, 6/128400 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 2 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:59:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:59:57] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:59:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:59:57] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/65121 places, 3/128400 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/65121 places, 3/128400 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-08 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:(GEQ s1 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-08 finished in 1861 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||p1) U ((G((p2 U p3)) U p3)&&p4)))'
Support contains 6 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63477 transitions
Trivial Post-agglo rules discarded 63477 transitions
Performed 63477 trivial Post agglomeration. Transition count delta: 63477
Iterating post reduction 0 with 63477 rules applied. Total rules applied 63477 place count 65121 transition count 64923
Reduce places removed 63477 places and 0 transitions.
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Iterating post reduction 1 with 63796 rules applied. Total rules applied 127273 place count 1644 transition count 64604
Reduce places removed 634 places and 0 transitions.
Ensure Unique test removed 62800 transitions
Reduce isomorphic transitions removed 62800 transitions.
Iterating post reduction 2 with 63434 rules applied. Total rules applied 190707 place count 1010 transition count 1804
Drop transitions removed 796 transitions
Redundant transition composition rules discarded 796 transitions
Iterating global reduction 3 with 796 rules applied. Total rules applied 191503 place count 1010 transition count 1008
Applied a total of 191503 rules in 1861 ms. Remains 1010 /65121 variables (removed 64111) and now considering 1008/128400 (removed 127392) transitions.
// Phase 1: matrix 1008 rows 1010 cols
[2022-05-19 15:59:59] [INFO ] Computed 406 place invariants in 7 ms
[2022-05-19 16:00:00] [INFO ] Implicit Places using invariants in 510 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 801, 803, 1006, 1008]
Discarding 404 places :
Implicit Place search using SMT only with invariants took 530 ms to find 404 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 606/65121 places, 1008/128400 transitions.
Graph (trivial) has 598 edges and 606 vertex of which 399 / 606 are part of one of the 1 SCC in 0 ms
Free SCC test removed 398 places
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 10 transition count 214
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 10 transition count 214
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 595 place count 10 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 597 place count 9 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 598 place count 8 transition count 14
Iterating global reduction 1 with 1 rules applied. Total rules applied 599 place count 8 transition count 14
Applied a total of 599 rules in 5 ms. Remains 8 /606 variables (removed 598) and now considering 14/1008 (removed 994) transitions.
// Phase 1: matrix 14 rows 8 cols
[2022-05-19 16:00:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 16:00:00] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 14 rows 8 cols
[2022-05-19 16:00:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 16:00:00] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/65121 places, 14/128400 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/65121 places, 14/128400 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p4) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3)]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p4) (AND (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p4) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p4 (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p4 (NOT p3) p2), acceptance={} source=0 dest: 5}, { cond=(AND p4 (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND p4 (NOT p3) p2), acceptance={0} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p4) p3 (NOT p1) (NOT p0)) (AND (NOT p3) p2 (NOT p1) (NOT p0))), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p4) p3) (AND (NOT p3) p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p4:(GEQ s6 1), p3:(GEQ s2 1), p2:(GEQ s3 1), p1:(GEQ s7 1), p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-09 finished in 2863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(!X(X(p0)))||p1) U (X(!p1)||p1)))'
Support contains 2 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1093 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:00:03] [INFO ] Computed 721 place invariants in 1883 ms
[2022-05-19 16:00:07] [INFO ] Implicit Places using invariants in 6199 ms returned []
Implicit Place search using SMT only with invariants took 6200 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:00:09] [INFO ] Computed 721 place invariants in 1652 ms
[2022-05-19 16:00:14] [INFO ] Dead Transitions using invariants and state equation in 7086 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, true]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s28556 1), p1:(GEQ s41281 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 32 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-10 finished in 14989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(G(p0)))||p1||(X(!p1)&&G(p2)))))'
Support contains 3 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 2472 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:00:19] [INFO ] Computed 721 place invariants in 1886 ms
[2022-05-19 16:00:25] [INFO ] Implicit Places using invariants in 7630 ms returned []
Implicit Place search using SMT only with invariants took 7631 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:00:27] [INFO ] Computed 721 place invariants in 1838 ms
[2022-05-19 16:00:32] [INFO ] Dead Transitions using invariants and state equation in 6878 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p1 (NOT p0)) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(GEQ s23618 1), p2:(LT s12811 1), p0:(LT s54621 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 56910 steps with 0 reset in 10001 ms.
Product exploration timeout after 56100 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2 p0)), (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (NOT p1)), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0))))), (X (X (OR (AND p1 (NOT p0)) (NOT p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (NOT p2))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 745 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1787 ms. (steps per millisecond=5 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 3975 steps, run timeout after 6004 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 3975 steps, saw 1485 distinct states, run finished after 6008 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:01:05] [INFO ] Computed 721 place invariants in 1708 ms
[2022-05-19 16:01:30] [INFO ] [Real]Absence check using 521 positive place invariants in 4794 ms returned unknown
[2022-05-19 16:01:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 16:01:31] [INFO ] After 25201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63997 transitions
Trivial Post-agglo rules discarded 63997 transitions
Performed 63997 trivial Post agglomeration. Transition count delta: 63997
Iterating post reduction 0 with 63997 rules applied. Total rules applied 63997 place count 65121 transition count 64403
Reduce places removed 64314 places and 0 transitions.
Ensure Unique test removed 63200 transitions
Reduce isomorphic transitions removed 63200 transitions.
Iterating post reduction 1 with 127514 rules applied. Total rules applied 191511 place count 807 transition count 1203
Drop transitions removed 597 transitions
Redundant transition composition rules discarded 597 transitions
Iterating global reduction 2 with 597 rules applied. Total rules applied 192108 place count 807 transition count 606
Discarding 197 places :
Implicit places reduction removed 197 places
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 2 with 591 rules applied. Total rules applied 192699 place count 610 transition count 212
Reduce places removed 591 places and 0 transitions.
Drop transitions removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 3 with 788 rules applied. Total rules applied 193487 place count 19 transition count 15
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 193490 place count 19 transition count 15
Applied a total of 193490 rules in 1655 ms. Remains 19 /65121 variables (removed 65102) and now considering 15/128400 (removed 128385) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/65121 places, 15/128400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 19 cols
[2022-05-19 16:01:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 16:01:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-19 16:01:32] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 16:01:32] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2 p0)), (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (NOT p1)), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (G (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (OR (AND p1 p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND p1 p0) (AND (NOT p2) p0))))), (X (X (OR (AND p1 (NOT p0)) (NOT p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (NOT p2))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (AND p0 p2))), (F (OR (NOT p0) (NOT p2))), (F (NOT p0)), (F (OR (AND p0 p1) (AND p0 (NOT p2)))), (F (AND p0 p1 p2)), (F (OR (AND (NOT p0) p1) (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 916 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 175 ms :[true, (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 187 ms :[true, (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p0) (NOT p2))]
Support contains 3 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1472 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:01:38] [INFO ] Computed 721 place invariants in 2631 ms
[2022-05-19 16:01:42] [INFO ] Implicit Places using invariants in 7026 ms returned []
Implicit Place search using SMT only with invariants took 7027 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:01:45] [INFO ] Computed 721 place invariants in 2395 ms
[2022-05-19 16:01:49] [INFO ] Dead Transitions using invariants and state equation in 6625 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (AND p0 (NOT p1) p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 585 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[true, (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2116 ms. (steps per millisecond=4 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :7
Running SMT prover for 3 properties.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:01:56] [INFO ] Computed 721 place invariants in 1952 ms
[2022-05-19 16:02:17] [INFO ] [Real]Absence check using 521 positive place invariants in 6817 ms returned sat
[2022-05-19 16:02:18] [INFO ] [Real]Absence check using 521 positive and 200 generalized place invariants in 1409 ms returned sat
[2022-05-19 16:02:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 16:02:21] [INFO ] After 25108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Drop transitions removed 63997 transitions
Trivial Post-agglo rules discarded 63997 transitions
Performed 63997 trivial Post agglomeration. Transition count delta: 63997
Iterating post reduction 0 with 63997 rules applied. Total rules applied 63997 place count 65121 transition count 64403
Reduce places removed 64314 places and 0 transitions.
Ensure Unique test removed 63200 transitions
Reduce isomorphic transitions removed 63200 transitions.
Iterating post reduction 1 with 127514 rules applied. Total rules applied 191511 place count 807 transition count 1203
Drop transitions removed 597 transitions
Redundant transition composition rules discarded 597 transitions
Iterating global reduction 2 with 597 rules applied. Total rules applied 192108 place count 807 transition count 606
Discarding 197 places :
Implicit places reduction removed 197 places
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 2 with 591 rules applied. Total rules applied 192699 place count 610 transition count 212
Reduce places removed 591 places and 0 transitions.
Drop transitions removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 3 with 788 rules applied. Total rules applied 193487 place count 19 transition count 15
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 193490 place count 19 transition count 15
Applied a total of 193490 rules in 1790 ms. Remains 19 /65121 variables (removed 65102) and now considering 15/128400 (removed 128385) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/65121 places, 15/128400 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (AND p0 (NOT p1) p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (G (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (F (OR (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 p2))), (F (NOT p2)), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (OR (AND p0 p1) (AND p0 (NOT p2)))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 7 factoid took 664 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 172 ms :[true, (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p0) (NOT p2))]
Product exploration timeout after 79340 steps with 0 reset in 10001 ms.
Product exploration timeout after 81680 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, false, true, false, false, true]
Stuttering acceptance computed with spot in 189 ms :[true, (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p0) (NOT p2))]
Support contains 3 out of 65121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Performed 16490 Post agglomeration using F-continuation condition.
Performed 33242 Post agglomeration using F-continuation condition.
Performed 51634 Post agglomeration using F-continuation condition.
Performed 63997 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63997 rules applied. Total rules applied 63997 place count 65121 transition count 128400
Discarding 316 places :
Symmetric choice reduction at 1 with 316 rule applications. Total rules 64313 place count 64805 transition count 65200
Deduced a syphon composed of 63997 places in 27 ms
Iterating global reduction 1 with 316 rules applied. Total rules applied 64629 place count 64805 transition count 65200
Deduced a syphon composed of 63997 places in 26 ms
Applied a total of 64629 rules in 107031 ms. Remains 64805 /65121 variables (removed 316) and now considering 65200/128400 (removed 63200) transitions.
[2022-05-19 16:04:31] [INFO ] Flow matrix only has 64603 transitions (discarded 597 similar events)
// Phase 1: matrix 64603 rows 64805 cols
[2022-05-19 16:05:19] [INFO ] Computed 405 place invariants in 47832 ms
[2022-05-19 16:05:24] [INFO ] Dead Transitions using invariants and state equation in 52158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64805/65121 places, 65200/128400 transitions.
Finished structural reductions, in 1 iterations. Remains : 64805/65121 places, 65200/128400 transitions.
Product exploration timeout after 79850 steps with 0 reset in 10002 ms.
Product exploration timeout after 54570 steps with 0 reset in 10002 ms.
Built C files in :
/tmp/ltsmin8895885174827376632
[2022-05-19 16:05:45] [INFO ] Built C files in 1097ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8895885174827376632
Running compilation step : cd /tmp/ltsmin8895885174827376632;'/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/ltsmin8895885174827376632;'/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/ltsmin8895885174827376632;'/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 3 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 911 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:05:51] [INFO ] Computed 721 place invariants in 1778 ms
[2022-05-19 16:05:55] [INFO ] Implicit Places using invariants in 5914 ms returned []
Implicit Place search using SMT only with invariants took 5915 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:05:57] [INFO ] Computed 721 place invariants in 1881 ms
[2022-05-19 16:06:01] [INFO ] Dead Transitions using invariants and state equation in 5950 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Built C files in :
/tmp/ltsmin12526010746414878023
[2022-05-19 16:06:02] [INFO ] Built C files in 632ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12526010746414878023
Running compilation step : cd /tmp/ltsmin12526010746414878023;'/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/ltsmin12526010746414878023;'/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/ltsmin12526010746414878023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 16:06:12] [INFO ] Flatten gal took : 3414 ms
[2022-05-19 16:06:15] [INFO ] Flatten gal took : 3144 ms
[2022-05-19 16:06:16] [INFO ] Time to serialize gal into /tmp/LTL14835489295618098403.gal : 407 ms
[2022-05-19 16:06:16] [INFO ] Time to serialize properties into /tmp/LTL17092886432408901368.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/LTL14835489295618098403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17092886432408901368.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/LTL1483548...268
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-19 16:06:35] [INFO ] Flatten gal took : 3300 ms
[2022-05-19 16:06:35] [INFO ] Applying decomposition
[2022-05-19 16:06:38] [INFO ] Flatten gal took : 3115 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/graph8467327770654317210.txt' '-o' '/tmp/graph8467327770654317210.bin' '-w' '/tmp/graph8467327770654317210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8467327770654317210.bin' '-l' '-1' '-v' '-w' '/tmp/graph8467327770654317210.weights' '-q' '0' '-e' '0.001'
[2022-05-19 16:06:47] [INFO ] Decomposing Gal with order
[2022-05-19 16:06:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 16:08:05] [INFO ] Removed a total of 127137 redundant transitions.
[2022-05-19 16:08:09] [INFO ] Flatten gal took : 44050 ms
[2022-05-19 16:08:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 558 ms.
[2022-05-19 16:08:13] [INFO ] Time to serialize gal into /tmp/LTL13261367230909721507.gal : 829 ms
[2022-05-19 16:08:13] [INFO ] Time to serialize properties into /tmp/LTL3747727029943930381.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/LTL13261367230909721507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3747727029943930381.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/LTL1326136...246
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2356385773115216252
[2022-05-19 16:08:46] [INFO ] Built C files in 927ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2356385773115216252
Running compilation step : cd /tmp/ltsmin2356385773115216252;'/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/ltsmin2356385773115216252;'/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/ltsmin2356385773115216252;'/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 ServersAndClients-PT-200320-LTLFireability-11 finished in 514196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)&&p0))&&G(p1)&&G(p2))))'
Support contains 5 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.
Applied a total of 0 rules in 1612 ms. Remains 65121 /65121 variables (removed 0) and now considering 128400/128400 (removed 0) transitions.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:09:02] [INFO ] Computed 721 place invariants in 10793 ms
[2022-05-19 16:09:11] [INFO ] Implicit Places using invariants in 20313 ms returned []
Implicit Place search using SMT only with invariants took 20315 ms to find 0 implicit places.
// Phase 1: matrix 128400 rows 65121 cols
[2022-05-19 16:09:13] [INFO ] Computed 721 place invariants in 2136 ms
[2022-05-19 16:09:22] [INFO ] Dead Transitions using invariants and state equation in 10874 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65121/65121 places, 128400/128400 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-200320-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s537 1) (GEQ s11454 1)), p2:(AND (GEQ s579 1) (GEQ s15072 1)), p0:(GEQ s8383 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 9595 ms.
FORMULA ServersAndClients-PT-200320-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200320-LTLFireability-12 finished in 43117 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U p1)))'
Support contains 2 out of 65121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65121/65121 places, 128400/128400 transitions.

BK_STOP 1652976597275

--------------------
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="ServersAndClients-PT-200320"
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 ServersAndClients-PT-200320, 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 r204-oct2-165281599400524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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