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-165281599400499.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-200040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599400499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 6.0K Apr 29 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 5.1M 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-200040-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-200040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652974762445

Running Version 202205111006
[2022-05-19 15:39:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:39:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:39:24] [INFO ] Load time of PNML (sax parser for PT used): 492 ms
[2022-05-19 15:39:24] [INFO ] Transformed 8841 places.
[2022-05-19 15:39:24] [INFO ] Transformed 16400 transitions.
[2022-05-19 15:39:24] [INFO ] Parsed PT model containing 8841 places and 16400 transitions in 632 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-200040-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2161 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:39:26] [INFO ] Computed 441 place invariants in 271 ms
[2022-05-19 15:39:27] [INFO ] Implicit Places using invariants in 1096 ms returned []
Implicit Place search using SMT only with invariants took 1125 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:39:27] [INFO ] Computed 441 place invariants in 140 ms
[2022-05-19 15:39:28] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Support contains 48 out of 8841 places after structural reductions.
[2022-05-19 15:39:29] [INFO ] Flatten gal took : 640 ms
[2022-05-19 15:39:29] [INFO ] Flatten gal took : 465 ms
[2022-05-19 15:39:30] [INFO ] Input system was already deterministic with 16400 transitions.
Support contains 46 out of 8841 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1040 ms. (steps per millisecond=9 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:39:32] [INFO ] Computed 441 place invariants in 112 ms
[2022-05-19 15:39:35] [INFO ] After 2747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-19 15:39:38] [INFO ] [Nat]Absence check using 241 positive place invariants in 279 ms returned sat
[2022-05-19 15:39:38] [INFO ] [Nat]Absence check using 241 positive and 200 generalized place invariants in 160 ms returned sat
[2022-05-19 15:39:59] [INFO ] After 19548ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :13
[2022-05-19 15:40:00] [INFO ] After 20357ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :13
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-19 15:40:00] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :13
Fused 20 Parikh solutions to 13 different solutions.
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 13 properties in 67 ms.
FORMULA ServersAndClients-PT-200040-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
FORMULA ServersAndClients-PT-200040-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ServersAndClients-PT-200040-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (G(p1) U X(p2))))))'
Support contains 5 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 2099 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:40:02] [INFO ] Computed 441 place invariants in 107 ms
[2022-05-19 15:40:03] [INFO ] Implicit Places using invariants in 820 ms returned []
Implicit Place search using SMT only with invariants took 829 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:40:03] [INFO ] Computed 441 place invariants in 107 ms
[2022-05-19 15:40:13] [INFO ] Dead Transitions using invariants and state equation in 10086 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s8704 s2391), p0:(LEQ s683 s8284), p2:(OR (LEQ s683 s8284) (LEQ 3 s1873))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33341 reset in 5561 ms.
Product exploration explored 100000 steps with 33318 reset in 5213 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 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 18 factoid took 1432 ms. Reduced automaton from 7 states, 37 edges and 3 AP to 7 states, 37 edges and 3 AP.
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 698 ms. (steps per millisecond=14 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:40:27] [INFO ] Computed 441 place invariants in 126 ms
[2022-05-19 15:40:28] [INFO ] After 885ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2022-05-19 15:40:29] [INFO ] [Nat]Absence check using 241 positive place invariants in 213 ms returned sat
[2022-05-19 15:40:29] [INFO ] [Nat]Absence check using 241 positive and 200 generalized place invariants in 130 ms returned sat
[2022-05-19 15:40:29] [INFO ] After 1236ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 24 factoid took 1725 ms. Reduced automaton from 7 states, 37 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1411 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:40:33] [INFO ] Computed 441 place invariants in 101 ms
[2022-05-19 15:40:34] [INFO ] Implicit Places using invariants in 768 ms returned []
Implicit Place search using SMT only with invariants took 772 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:40:34] [INFO ] Computed 441 place invariants in 103 ms
[2022-05-19 15:40:43] [INFO ] Dead Transitions using invariants and state equation in 9645 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 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 p0 p2 p1), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 299 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 2306 steps, including 0 resets, run visited all 4 properties in 85 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 p2 p1), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 312 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33220 reset in 5000 ms.
Product exploration explored 100000 steps with 33316 reset in 5027 ms.
Built C files in :
/tmp/ltsmin15036398804632454905
[2022-05-19 15:40:55] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15036398804632454905
Running compilation step : cd /tmp/ltsmin15036398804632454905;'/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/ltsmin15036398804632454905;'/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/ltsmin15036398804632454905;'/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 5 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1388 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:41:00] [INFO ] Computed 441 place invariants in 102 ms
[2022-05-19 15:41:02] [INFO ] Implicit Places using invariants in 1894 ms returned []
Implicit Place search using SMT only with invariants took 1896 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:41:02] [INFO ] Computed 441 place invariants in 108 ms
[2022-05-19 15:41:02] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Built C files in :
/tmp/ltsmin1181813536396568210
[2022-05-19 15:41:03] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1181813536396568210
Running compilation step : cd /tmp/ltsmin1181813536396568210;'/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/ltsmin1181813536396568210;'/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/ltsmin1181813536396568210;'/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 15:41:07] [INFO ] Flatten gal took : 508 ms
[2022-05-19 15:41:07] [INFO ] Flatten gal took : 474 ms
[2022-05-19 15:41:07] [INFO ] Time to serialize gal into /tmp/LTL8733889950763927658.gal : 124 ms
[2022-05-19 15:41:07] [INFO ] Time to serialize properties into /tmp/LTL16138575156467813163.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/LTL8733889950763927658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16138575156467813163.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/LTL8733889...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("(sys_req141<=sv37_c45)")U((G("(sv39_c63<=sv7_c182)"))U(X("((sys_req141<=sv37_c45)||(sv5_c66>=3))")))))))
Formula 0 simplified : !FG("(sys_req141<=sv37_c45)" U (G"(sv39_c63<=sv7_c182)" U X"((sys_req141<=sv37_c45)||(sv5_c66>=3))"))
Detected timeout of ITS tools.
[2022-05-19 15:41:23] [INFO ] Flatten gal took : 417 ms
[2022-05-19 15:41:23] [INFO ] Applying decomposition
[2022-05-19 15:41:23] [INFO ] Flatten gal took : 487 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/graph6222894298727924809.txt' '-o' '/tmp/graph6222894298727924809.bin' '-w' '/tmp/graph6222894298727924809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6222894298727924809.bin' '-l' '-1' '-v' '-w' '/tmp/graph6222894298727924809.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:41:24] [INFO ] Decomposing Gal with order
[2022-05-19 15:41:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:41:32] [INFO ] Removed a total of 15261 redundant transitions.
[2022-05-19 15:41:33] [INFO ] Flatten gal took : 7426 ms
[2022-05-19 15:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 124 ms.
[2022-05-19 15:41:34] [INFO ] Time to serialize gal into /tmp/LTL1802360176384639727.gal : 123 ms
[2022-05-19 15:41:34] [INFO ] Time to serialize properties into /tmp/LTL11749581381991466438.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/LTL1802360176384639727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11749581381991466438.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/LTL1802360...267
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu200.sys_req141<=gu200.sv37_c45)")U((G("(gu210.sv39_c63<=gu210.sv7_c182)"))U(X("((gu200.sys_req141<=gu200.sv37_c45)||(gi1.g...180
Formula 0 simplified : !FG("(gu200.sys_req141<=gu200.sv37_c45)" U (G"(gu210.sv39_c63<=gu210.sv7_c182)" U X"((gu200.sys_req141<=gu200.sv37_c45)||(gi1.gu207....170
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5470223931956300821
[2022-05-19 15:41:49] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5470223931956300821
Running compilation step : cd /tmp/ltsmin5470223931956300821;'/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/ltsmin5470223931956300821;'/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/ltsmin5470223931956300821;'/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-200040-LTLCardinality-02 finished in 112120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(p0)||!p0))))'
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7998 transitions
Trivial Post-agglo rules discarded 7998 transitions
Performed 7998 trivial Post agglomeration. Transition count delta: 7998
Iterating post reduction 0 with 7998 rules applied. Total rules applied 7998 place count 8841 transition count 8402
Reduce places removed 8036 places and 0 transitions.
Ensure Unique test removed 7400 transitions
Reduce isomorphic transitions removed 7400 transitions.
Iterating post reduction 1 with 15436 rules applied. Total rules applied 23434 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 23832 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 24426 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 25217 place count 13 transition count 11
Applied a total of 25217 rules in 257 ms. Remains 13 /8841 variables (removed 8828) and now considering 11/16400 (removed 16389) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 15:41:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-19 15:41:53] [INFO ] Implicit Places using invariants in 75 ms returned [0, 1, 2, 3, 9, 11]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 76 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8841 places, 11/16400 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 2 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:41:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:41:53] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-19 15:41:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:41:53] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/8841 places, 5/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 3/8841 places, 5/16400 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, false, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLCardinality-03 finished in 691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1894 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:41:55] [INFO ] Computed 441 place invariants in 184 ms
[2022-05-19 15:41:56] [INFO ] Implicit Places using invariants in 831 ms returned []
Implicit Place search using SMT only with invariants took 831 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:41:56] [INFO ] Computed 441 place invariants in 107 ms
[2022-05-19 15:41:56] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s4218 s4791)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-200040-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLCardinality-04 finished in 3594 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7996 transitions
Trivial Post-agglo rules discarded 7996 transitions
Performed 7996 trivial Post agglomeration. Transition count delta: 7996
Iterating post reduction 0 with 7996 rules applied. Total rules applied 7996 place count 8841 transition count 8404
Reduce places removed 8032 places and 0 transitions.
Ensure Unique test removed 7000 transitions
Reduce isomorphic transitions removed 7000 transitions.
Iterating post reduction 1 with 15032 rules applied. Total rules applied 23028 place count 809 transition count 1404
Drop transitions removed 796 transitions
Redundant transition composition rules discarded 796 transitions
Iterating global reduction 2 with 796 rules applied. Total rules applied 23824 place count 809 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 588 rules applied. Total rules applied 24412 place count 613 transition count 216
Reduce places removed 588 places and 0 transitions.
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 3 with 783 rules applied. Total rules applied 25195 place count 25 transition count 21
Applied a total of 25195 rules in 203 ms. Remains 25 /8841 variables (removed 8816) and now considering 21/16400 (removed 16379) transitions.
// Phase 1: matrix 21 rows 25 cols
[2022-05-19 15:41:57] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-19 15:41:57] [INFO ] Implicit Places using invariants in 70 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 17, 19, 21, 23]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 71 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/8841 places, 21/16400 transitions.
Graph (trivial) has 13 edges and 13 vertex of which 9 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Applied a total of 1 rules in 0 ms. Remains 5 /13 variables (removed 8) and now considering 9/21 (removed 12) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:41:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:41:57] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:41:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:41:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/8841 places, 9/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8841 places, 9/16400 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s4 s1) (LEQ s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-200040-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLCardinality-07 finished in 430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7996 transitions
Trivial Post-agglo rules discarded 7996 transitions
Performed 7996 trivial Post agglomeration. Transition count delta: 7996
Iterating post reduction 0 with 7996 rules applied. Total rules applied 7996 place count 8841 transition count 8404
Reduce places removed 8032 places and 0 transitions.
Ensure Unique test removed 7000 transitions
Reduce isomorphic transitions removed 7000 transitions.
Iterating post reduction 1 with 15032 rules applied. Total rules applied 23028 place count 809 transition count 1404
Drop transitions removed 796 transitions
Redundant transition composition rules discarded 796 transitions
Iterating global reduction 2 with 796 rules applied. Total rules applied 23824 place count 809 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 588 rules applied. Total rules applied 24412 place count 613 transition count 216
Reduce places removed 588 places and 0 transitions.
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 3 with 783 rules applied. Total rules applied 25195 place count 25 transition count 21
Applied a total of 25195 rules in 136 ms. Remains 25 /8841 variables (removed 8816) and now considering 21/16400 (removed 16379) transitions.
// Phase 1: matrix 21 rows 25 cols
[2022-05-19 15:41:57] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-19 15:41:57] [INFO ] Implicit Places using invariants in 26 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 17, 19, 21, 23]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 27 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/8841 places, 21/16400 transitions.
Graph (trivial) has 13 edges and 13 vertex of which 9 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Applied a total of 1 rules in 0 ms. Remains 5 /13 variables (removed 8) and now considering 9/21 (removed 12) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:41:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:41:57] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:41:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:41:57] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/8841 places, 9/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8841 places, 9/16400 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT s3 s4), p1:(GT s2 s1)], 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-200040-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-200040-LTLCardinality-08 finished in 324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(X(F(p2)) U (F(p2)||p2)))))'
Support contains 5 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1607 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:41:59] [INFO ] Computed 441 place invariants in 109 ms
[2022-05-19 15:42:00] [INFO ] Implicit Places using invariants in 726 ms returned []
Implicit Place search using SMT only with invariants took 727 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:00] [INFO ] Computed 441 place invariants in 108 ms
[2022-05-19 15:42:00] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(LEQ 1 s5566), p1:(LEQ s2143 s3827), p0:(LEQ s4929 s8245)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 3194 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ServersAndClients-PT-200040-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-200040-LTLCardinality-12 finished in 6469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p1)) U (!G(!p1)||X(p0)))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Applied a total of 0 rules in 1602 ms. Remains 8841 /8841 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:05] [INFO ] Computed 441 place invariants in 106 ms
[2022-05-19 15:42:06] [INFO ] Implicit Places using invariants in 717 ms returned []
Implicit Place search using SMT only with invariants took 717 ms to find 0 implicit places.
// Phase 1: matrix 16400 rows 8841 cols
[2022-05-19 15:42:06] [INFO ] Computed 441 place invariants in 104 ms
[2022-05-19 15:42:07] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8841/8841 places, 16400/16400 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s7238 s6519), p0:(LEQ s1762 s8000)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 3210 ms.
Product exploration explored 100000 steps with 2 reset in 3301 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Probably explored full state space saw : 8401 states, properties seen :1
Probabilistic random walk after 24801 steps, saw 8401 distinct states, run finished after 2897 ms. (steps per millisecond=8 ) properties seen :1
Explored full state space saw : 8401 states, properties seen :0
Exhaustive walk after 24801 steps, saw 8401 distinct states, run finished after 2927 ms. (steps per millisecond=8 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ServersAndClients-PT-200040-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-200040-LTLCardinality-13 finished in 16535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 4 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7996 transitions
Trivial Post-agglo rules discarded 7996 transitions
Performed 7996 trivial Post agglomeration. Transition count delta: 7996
Iterating post reduction 0 with 7996 rules applied. Total rules applied 7996 place count 8841 transition count 8404
Reduce places removed 8032 places and 0 transitions.
Ensure Unique test removed 7000 transitions
Reduce isomorphic transitions removed 7000 transitions.
Iterating post reduction 1 with 15032 rules applied. Total rules applied 23028 place count 809 transition count 1404
Drop transitions removed 796 transitions
Redundant transition composition rules discarded 796 transitions
Iterating global reduction 2 with 796 rules applied. Total rules applied 23824 place count 809 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 2 with 588 rules applied. Total rules applied 24412 place count 613 transition count 216
Reduce places removed 588 places and 0 transitions.
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 3 with 783 rules applied. Total rules applied 25195 place count 25 transition count 21
Applied a total of 25195 rules in 217 ms. Remains 25 /8841 variables (removed 8816) and now considering 21/16400 (removed 16379) transitions.
// Phase 1: matrix 21 rows 25 cols
[2022-05-19 15:42:20] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-19 15:42:21] [INFO ] Implicit Places using invariants in 70 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 17, 19, 21, 23]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 71 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/8841 places, 21/16400 transitions.
Graph (trivial) has 13 edges and 13 vertex of which 9 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Applied a total of 1 rules in 1 ms. Remains 5 /13 variables (removed 8) and now considering 9/21 (removed 12) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:42:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:21] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:42:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:21] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/8841 places, 9/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8841 places, 9/16400 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-15 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:(AND (LEQ s4 s1) (LEQ s3 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9948 reset in 176 ms.
Product exploration explored 100000 steps with 10032 reset in 102 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 212 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 282 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:42:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:22] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:42:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:22] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-19 15:42:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-19 15:42:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:22] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 9/9 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10044 reset in 72 ms.
Product exploration explored 100000 steps with 9960 reset in 77 ms.
Built C files in :
/tmp/ltsmin16829159247922458706
[2022-05-19 15:42:22] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2022-05-19 15:42:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:42:22] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2022-05-19 15:42:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:42:22] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2022-05-19 15:42:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:42:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16829159247922458706
Running compilation step : cd /tmp/ltsmin16829159247922458706;'/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'
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin16829159247922458706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin16829159247922458706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13229937822231231562.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA ServersAndClients-PT-200040-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-200040-LTLCardinality-15 finished in 2552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (G(p1) U X(p2))))))'
Found a SL insensitive property : ServersAndClients-PT-200040-LTLCardinality-02
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 8841 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions removed 7956 transitions
Trivial Post-agglo rules discarded 7956 transitions
Performed 7956 trivial Post agglomeration. Transition count delta: 7956
Iterating post reduction 0 with 7956 rules applied. Total rules applied 7956 place count 8841 transition count 8444
Reduce places removed 7956 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 1 with 7996 rules applied. Total rules applied 15952 place count 885 transition count 8404
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 7000 transitions
Reduce isomorphic transitions removed 7000 transitions.
Iterating post reduction 2 with 7076 rules applied. Total rules applied 23028 place count 809 transition count 1404
Drop transitions removed 796 transitions
Redundant transition composition rules discarded 796 transitions
Iterating global reduction 3 with 796 rules applied. Total rules applied 23824 place count 809 transition count 608
Discarding 196 places :
Implicit places reduction removed 196 places
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 3 with 586 rules applied. Total rules applied 24410 place count 613 transition count 218
Reduce places removed 585 places and 0 transitions.
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 780 rules applied. Total rules applied 25190 place count 28 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 25191 place count 27 transition count 23
Applied a total of 25191 rules in 144 ms. Remains 27 /8841 variables (removed 8814) and now considering 23/16400 (removed 16377) transitions.
// Phase 1: matrix 23 rows 27 cols
[2022-05-19 15:42:23] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-19 15:42:24] [INFO ] Implicit Places using invariants in 68 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 19, 21, 23, 25]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 69 ms to find 13 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 14/8841 places, 23/16400 transitions.
Graph (trivial) has 13 edges and 14 vertex of which 9 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Applied a total of 1 rules in 1 ms. Remains 6 /14 variables (removed 8) and now considering 11/23 (removed 12) transitions.
// Phase 1: matrix 11 rows 6 cols
[2022-05-19 15:42:24] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:42:24] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 11 rows 6 cols
[2022-05-19 15:42:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 6/8841 places, 11/16400 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/8841 places, 11/16400 transitions.
Running random walk in product with property : ServersAndClients-PT-200040-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s5 s3), p0:(LEQ s0 s4), p2:(OR (LEQ s0 s4) (LEQ 3 s2))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32389 reset in 150 ms.
Product exploration explored 100000 steps with 32623 reset in 122 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 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 1131 ms. Reduced automaton from 7 states, 37 edges and 3 AP to 7 states, 37 edges and 3 AP.
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 11 rows 6 cols
[2022-05-19 15:42:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2022-05-19 15:42:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-19 15:42:26] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 19 factoid took 1462 ms. Reduced automaton from 7 states, 37 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 6 cols
[2022-05-19 15:42:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 15:42:28] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 11 rows 6 cols
[2022-05-19 15:42:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 6 cols
[2022-05-19 15:42:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:42:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 11/11 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 p0 p2 p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 17 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 p2 p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 262 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 32461 reset in 60 ms.
Product exploration explored 100000 steps with 32383 reset in 65 ms.
Built C files in :
/tmp/ltsmin16110886277861739916
[2022-05-19 15:42:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16110886277861739916
Running compilation step : cd /tmp/ltsmin16110886277861739916;'/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'
Compilation finished in 51 ms.
Running link step : cd /tmp/ltsmin16110886277861739916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 17 ms.
Running LTSmin : cd /tmp/ltsmin16110886277861739916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15318157239936075807.hoa' '--buchi-type=spotba'
LTSmin run took 34 ms.
Treatment of property ServersAndClients-PT-200040-LTLCardinality-02 finished in 6421 ms.
CL/SL decision was in the wrong direction : SL + true
[2022-05-19 15:42:30] [INFO ] Flatten gal took : 642 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1490866460236694209
[2022-05-19 15:42:30] [INFO ] Too many transitions (16400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 15:42:30] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1490866460236694209
Running compilation step : cd /tmp/ltsmin1490866460236694209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 15:42:30] [INFO ] Applying decomposition
[2022-05-19 15:42:31] [INFO ] Flatten gal took : 725 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/graph5637511620140855314.txt' '-o' '/tmp/graph5637511620140855314.bin' '-w' '/tmp/graph5637511620140855314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5637511620140855314.bin' '-l' '-1' '-v' '-w' '/tmp/graph5637511620140855314.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:42:33] [INFO ] Decomposing Gal with order
[2022-05-19 15:42:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:42:41] [INFO ] Removed a total of 15321 redundant transitions.
[2022-05-19 15:42:42] [INFO ] Flatten gal took : 7884 ms
[2022-05-19 15:42:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 289 ms.
[2022-05-19 15:42:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality15626136711618946098.gal : 71 ms
[2022-05-19 15:42:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality10765489821224936018.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/LTLCardinality15626136711618946098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10765489821224936018.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/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu241.sys_req141<=gu241.sv37_c45)")U((G("(gu208.sv39_c63<=gu208.sv7_c182)"))U(X("((gu241.sys_req141<=gu241.sv37_c45)||(gi1.g...180
Formula 0 simplified : !FG("(gu241.sys_req141<=gu241.sv37_c45)" U (G"(gu208.sv39_c63<=gu208.sv7_c182)" U X"((gu241.sys_req141<=gu241.sv37_c45)||(gi1.gu227....170
Compilation finished in 165275 ms.
Running link step : cd /tmp/ltsmin1490866460236694209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 110 ms.
Running LTSmin : cd /tmp/ltsmin1490866460236694209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true) U ([]((LTLAPp1==true)) U X((LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 107843 ms.
FORMULA ServersAndClients-PT-200040-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 460581 ms.

BK_STOP 1652975224265

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-200040"
export BK_EXAMINATION="LTLCardinality"
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-200040, examination is LTLCardinality"
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-165281599400499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-200040.tgz
mv ServersAndClients-PT-200040 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;