Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820600228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-5000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820600228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 30 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 02:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 02:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 16M 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 JoinFreeModules-PT-5000-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652761323816

Running Version 202205111006
[2022-05-17 04:22:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 04:22:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 04:22:05] [INFO ] Load time of PNML (sax parser for PT used): 786 ms
[2022-05-17 04:22:05] [INFO ] Transformed 25001 places.
[2022-05-17 04:22:06] [INFO ] Transformed 40001 transitions.
[2022-05-17 04:22:06] [INFO ] Parsed PT model containing 25001 places and 40001 transitions in 1020 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-5000-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 9448 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:22:16] [INFO ] Computed 5000 place invariants in 182 ms
[2022-05-17 04:22:18] [INFO ] Dead Transitions using invariants and state equation in 2481 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:22:18] [INFO ] Computed 5000 place invariants in 92 ms
[2022-05-17 04:22:23] [INFO ] Implicit Places using invariants in 5482 ms returned []
Implicit Place search using SMT only with invariants took 5484 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:22:23] [INFO ] Computed 5000 place invariants in 91 ms
[2022-05-17 04:22:25] [INFO ] Dead Transitions using invariants and state equation in 2050 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Support contains 36 out of 25000 places after structural reductions.
[2022-05-17 04:22:27] [INFO ] Flatten gal took : 1262 ms
[2022-05-17 04:22:28] [INFO ] Flatten gal took : 944 ms
[2022-05-17 04:22:30] [INFO ] Input system was already deterministic with 40001 transitions.
Incomplete random walk after 12506 steps, including 2 resets, run finished after 2803 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 325 ms. (steps per millisecond=3 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 212 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 219 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 312 ms. (steps per millisecond=3 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 214 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 214 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 221 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 279 ms. (steps per millisecond=3 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 238 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 264 ms. (steps per millisecond=3 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 266 ms. (steps per millisecond=3 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 251 ms. (steps per millisecond=3 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 221 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 209 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 209 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 209 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 210 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 223 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 211 ms. (steps per millisecond=4 ) properties (out of 31) seen :0
Probabilistic random walk exhausted memory after 45424 steps, saw 45419 distinct states, run finished after 20317 ms. (steps per millisecond=2 ) properties seen :6
Running SMT prover for 25 properties.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:23:00] [INFO ] Computed 5000 place invariants in 76 ms
[2022-05-17 04:23:14] [INFO ] [Real]Absence check using 5000 positive place invariants in 3330 ms returned sat
[2022-05-17 04:23:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 04:23:26] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 28 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 140 are kept as prefixes of interest. Removing 24860 places using SCC suffix rule.51 ms
Discarding 24860 places :
Also discarding 39776 output transitions
Drop transitions removed 39776 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 224
Applied a total of 2 rules in 165 ms. Remains 140 /25000 variables (removed 24860) and now considering 224/40001 (removed 39777) transitions.
// Phase 1: matrix 224 rows 140 cols
[2022-05-17 04:23:26] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-17 04:23:26] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 140/25000 places, 224/40001 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
// Phase 1: matrix 224 rows 140 cols
[2022-05-17 04:23:26] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-17 04:23:26] [INFO ] [Real]Absence check using 28 positive place invariants in 4 ms returned sat
[2022-05-17 04:23:26] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-17 04:23:26] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2022-05-17 04:23:26] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-17 04:23:26] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-17 04:23:27] [INFO ] After 99ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-17 04:23:27] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 114 ms.
[2022-05-17 04:23:27] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=142 )
Parikh walk visited 9 properties in 10145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)&&p2) U X((!p1 U G((F(p2)||p3))))))'
Support contains 4 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 7965 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:23:53] [INFO ] Computed 5000 place invariants in 80 ms
[2022-05-17 04:23:55] [INFO ] Dead Transitions using invariants and state equation in 2297 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:23:56] [INFO ] Computed 5000 place invariants in 82 ms
[2022-05-17 04:24:02] [INFO ] Implicit Places using invariants in 6018 ms returned []
Implicit Place search using SMT only with invariants took 6021 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:24:02] [INFO ] Computed 5000 place invariants in 103 ms
[2022-05-17 04:24:04] [INFO ] Dead Transitions using invariants and state equation in 2319 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 476 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(GEQ s13005 3), p2:(GEQ s5420 3), p3:(GEQ s2214 5), p0:(GEQ s2731 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 10 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-00 finished in 19231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p1)))'
Support contains 4 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 24456 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:24:29] [INFO ] Computed 5000 place invariants in 121 ms
[2022-05-17 04:24:31] [INFO ] Dead Transitions using invariants and state equation in 2034 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:24:31] [INFO ] Computed 5000 place invariants in 103 ms
[2022-05-17 04:24:36] [INFO ] Implicit Places using invariants in 5345 ms returned []
Implicit Place search using SMT only with invariants took 5346 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:24:36] [INFO ] Computed 5000 place invariants in 83 ms
[2022-05-17 04:24:38] [INFO ] Dead Transitions using invariants and state equation in 1999 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s23727 2), p0:(OR (AND (GEQ s10273 4) (GEQ s16780 3)) (AND (OR (GEQ s23727 2) (GEQ s16780 3)) (GEQ s5566 2)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-02 finished in 34008 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((G(p0)||(p1 U p2))))))))'
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3111 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:24:42] [INFO ] Computed 5000 place invariants in 82 ms
[2022-05-17 04:24:44] [INFO ] Dead Transitions using invariants and state equation in 1998 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:24:44] [INFO ] Computed 5000 place invariants in 84 ms
[2022-05-17 04:24:49] [INFO ] Implicit Places using invariants in 5439 ms returned []
Implicit Place search using SMT only with invariants took 5440 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:24:49] [INFO ] Computed 5000 place invariants in 86 ms
[2022-05-17 04:24:51] [INFO ] Dead Transitions using invariants and state equation in 2013 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 326 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p2:(GEQ s13062 1), p1:(GEQ s12494 5), p0:(GEQ s18024 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 8830 steps with 1471 reset in 10011 ms.
Product exploration timeout after 8860 steps with 1476 reset in 10010 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 p2 (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 9 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 12506 steps, including 2 resets, run finished after 2440 ms. (steps per millisecond=5 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2211 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2169 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2302 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2191 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2186 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2253 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2250 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Probabilistic random walk exhausted memory after 45426 steps, saw 45421 distinct states, run finished after 21881 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:26:01] [INFO ] Computed 5000 place invariants in 80 ms
[2022-05-17 04:26:09] [INFO ] [Real]Absence check using 5000 positive place invariants in 3311 ms returned sat
[2022-05-17 04:26:26] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 15 are kept as prefixes of interest. Removing 24985 places using SCC suffix rule.9 ms
Discarding 24985 places :
Also discarding 39976 output transitions
Drop transitions removed 39976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 24
Applied a total of 2 rules in 41 ms. Remains 15 /25000 variables (removed 24985) and now considering 24/40001 (removed 39977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 04:26:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 04:26:26] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/25000 places, 24/40001 transitions.
Incomplete random walk after 12505 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3126 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 04:26:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 04:26:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 04:26:26] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 04:26:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 04:26:26] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 04:26:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-17 04:26:26] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-17 04:26:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2022-05-17 04:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-17 04:26:26] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 04:26:26] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 5043 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=840 )
Parikh walk visited 6 properties in 263 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 9 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3370 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:26:31] [INFO ] Computed 5000 place invariants in 83 ms
[2022-05-17 04:26:33] [INFO ] Dead Transitions using invariants and state equation in 2340 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:26:33] [INFO ] Computed 5000 place invariants in 93 ms
[2022-05-17 04:26:39] [INFO ] Implicit Places using invariants in 6183 ms returned []
Implicit Place search using SMT only with invariants took 6184 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:26:39] [INFO ] Computed 5000 place invariants in 100 ms
[2022-05-17 04:26:41] [INFO ] Dead Transitions using invariants and state equation in 2307 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 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 (NOT p1) p2 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 53 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 9 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 12505 steps, including 2 resets, run finished after 2542 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2322 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2503 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2249 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2198 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2243 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2340 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2192 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Probabilistic random walk exhausted memory after 45318 steps, saw 45313 distinct states, run finished after 19164 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:27:30] [INFO ] Computed 5000 place invariants in 90 ms
[2022-05-17 04:27:41] [INFO ] [Real]Absence check using 5000 positive place invariants in 5433 ms returned sat
[2022-05-17 04:27:55] [INFO ] After 11382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2022-05-17 04:27:55] [INFO ] State equation strengthened by 5000 read => feed constraints.
[2022-05-17 04:27:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 04:27:55] [INFO ] After 25177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 15 are kept as prefixes of interest. Removing 24985 places using SCC suffix rule.12 ms
Discarding 24985 places :
Also discarding 39976 output transitions
Drop transitions removed 39976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 24
Applied a total of 2 rules in 55 ms. Remains 15 /25000 variables (removed 24985) and now considering 24/40001 (removed 39977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 04:27:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 04:27:55] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/25000 places, 24/40001 transitions.
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 04:27:56] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 04:27:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 04:27:56] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 04:27:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 04:27:56] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 04:27:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-17 04:27:56] [INFO ] After 14ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-17 04:27:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 04:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-17 04:27:56] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-17 04:27:56] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 5043 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1008 )
Parikh walk visited 6 properties in 344 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 1 factoid took 205 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 9 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 320 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 9070 steps with 1511 reset in 10006 ms.
Product exploration timeout after 9020 steps with 1503 reset in 10003 ms.
Applying partial POR strategy [true, true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 21713 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:28:40] [INFO ] Computed 5000 place invariants in 94 ms
[2022-05-17 04:28:42] [INFO ] Dead Transitions using invariants and state equation in 2014 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:28:42] [INFO ] Computed 5000 place invariants in 111 ms
[2022-05-17 04:28:44] [INFO ] Dead Transitions using invariants and state equation in 2145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Product exploration timeout after 4660 steps with 776 reset in 10016 ms.
Product exploration timeout after 4530 steps with 755 reset in 10001 ms.
Built C files in :
/tmp/ltsmin11129897560608306120
[2022-05-17 04:29:04] [INFO ] Built C files in 386ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11129897560608306120
Running compilation step : cd /tmp/ltsmin11129897560608306120;'/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/ltsmin11129897560608306120;'/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/ltsmin11129897560608306120;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3382 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:29:11] [INFO ] Computed 5000 place invariants in 143 ms
[2022-05-17 04:29:13] [INFO ] Dead Transitions using invariants and state equation in 2122 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:29:13] [INFO ] Computed 5000 place invariants in 94 ms
[2022-05-17 04:29:18] [INFO ] Implicit Places using invariants in 5447 ms returned []
Implicit Place search using SMT only with invariants took 5448 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:29:18] [INFO ] Computed 5000 place invariants in 93 ms
[2022-05-17 04:29:20] [INFO ] Dead Transitions using invariants and state equation in 2138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Built C files in :
/tmp/ltsmin1889348705364191617
[2022-05-17 04:29:21] [INFO ] Built C files in 305ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1889348705364191617
Running compilation step : cd /tmp/ltsmin1889348705364191617;'/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/ltsmin1889348705364191617;'/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/ltsmin1889348705364191617;'/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-17 04:29:26] [INFO ] Flatten gal took : 1242 ms
[2022-05-17 04:29:27] [INFO ] Flatten gal took : 997 ms
[2022-05-17 04:29:27] [INFO ] Time to serialize gal into /tmp/LTL7355106743616648154.gal : 355 ms
[2022-05-17 04:29:27] [INFO ] Time to serialize properties into /tmp/LTL14823725976369111144.ltl : 3 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/LTL7355106743616648154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14823725976369111144.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/LTL7355106...267
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-17 04:29:43] [INFO ] Flatten gal took : 885 ms
[2022-05-17 04:29:43] [INFO ] Applying decomposition
[2022-05-17 04:29:44] [INFO ] Flatten gal took : 910 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/graph15404602298408952681.txt' '-o' '/tmp/graph15404602298408952681.bin' '-w' '/tmp/graph15404602298408952681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15404602298408952681.bin' '-l' '-1' '-v' '-w' '/tmp/graph15404602298408952681.weights' '-q' '0' '-e' '0.001'
[2022-05-17 04:29:48] [INFO ] Decomposing Gal with order
[2022-05-17 04:29:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:31:47] [INFO ] Flatten gal took : 1215 ms
[2022-05-17 04:31:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2647 ms.
[2022-05-17 04:31:50] [INFO ] Time to serialize gal into /tmp/LTL77863700691596645.gal : 332 ms
[2022-05-17 04:31:50] [INFO ] Time to serialize properties into /tmp/LTL8399055454667527600.ltl : 43 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/LTL77863700691596645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8399055454667527600.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7786370...243
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X((G("(u3604.p18025>=5)"))||(("(u2498.p12495>=5)")U("(u2612.p13063>=1)")))))))))
Formula 0 simplified : !XXXXX(G"(u3604.p18025>=5)" | ("(u2498.p12495>=5)" U "(u2612.p13063>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1845561598373398771
[2022-05-17 04:32:05] [INFO ] Built C files in 495ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1845561598373398771
Running compilation step : cd /tmp/ltsmin1845561598373398771;'/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/ltsmin1845561598373398771;'/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/ltsmin1845561598373398771;'/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 JoinFreeModules-PT-5000-LTLFireability-03 finished in 449869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 46599 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:32:55] [INFO ] Computed 5000 place invariants in 204 ms
[2022-05-17 04:32:59] [INFO ] Dead Transitions using invariants and state equation in 3740 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:32:59] [INFO ] Computed 5000 place invariants in 198 ms
[2022-05-17 04:33:09] [INFO ] Implicit Places using invariants in 10208 ms returned []
Implicit Place search using SMT only with invariants took 10228 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:33:09] [INFO ] Computed 5000 place invariants in 202 ms
[2022-05-17 04:33:12] [INFO ] Dead Transitions using invariants and state equation in 3146 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s16554 5), p1:(LT s15127 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 5 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-04 finished in 64083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0)&&X(F(p1))&&G(p2)))))'
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 20944 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:33:34] [INFO ] Computed 5000 place invariants in 186 ms
[2022-05-17 04:33:37] [INFO ] Dead Transitions using invariants and state equation in 4115 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:33:38] [INFO ] Computed 5000 place invariants in 226 ms
[2022-05-17 04:33:49] [INFO ] Implicit Places using invariants in 11279 ms returned []
Implicit Place search using SMT only with invariants took 11289 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:33:49] [INFO ] Computed 5000 place invariants in 182 ms
[2022-05-17 04:33:57] [INFO ] Dead Transitions using invariants and state equation in 8093 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 1790 ms :[(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) p0 (NOT p1)) (AND (NOT p2) p0 p1) (AND p2 (NOT p0) (NOT p1)) (AND p2 (NOT p0) p1) (AND p2 p0 (NOT p1))), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s22735 3), p0:(LT s24242 1), p1:(GEQ s21694 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 48 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-05 finished in 46601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!(X(p0) U p1)&&p2))))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 10077 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:34:09] [INFO ] Computed 5000 place invariants in 174 ms
[2022-05-17 04:34:13] [INFO ] Dead Transitions using invariants and state equation in 3718 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:34:13] [INFO ] Computed 5000 place invariants in 195 ms
[2022-05-17 04:34:22] [INFO ] Implicit Places using invariants in 8992 ms returned []
Implicit Place search using SMT only with invariants took 9002 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:34:22] [INFO ] Computed 5000 place invariants in 101 ms
[2022-05-17 04:34:24] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s15960 3), p2:(LT s820 3)], 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]]
Product exploration timeout after 7090 steps with 0 reset in 10008 ms.
Entered a terminal (fully accepting) state of product in 2867 steps with 0 reset in 3763 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-06 finished in 38815 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F(p0)))))'
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 8237 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:34:46] [INFO ] Computed 5000 place invariants in 119 ms
[2022-05-17 04:34:48] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:34:48] [INFO ] Computed 5000 place invariants in 188 ms
[2022-05-17 04:34:53] [INFO ] Implicit Places using invariants in 5306 ms returned []
Implicit Place search using SMT only with invariants took 5316 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:34:53] [INFO ] Computed 5000 place invariants in 94 ms
[2022-05-17 04:34:55] [INFO ] Dead Transitions using invariants and state equation in 1876 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s10438 3)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 5 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-07 finished in 17627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G((G((G(p0)||p1))&&p2))))))'
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 71131 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:36:07] [INFO ] Computed 5000 place invariants in 190 ms
[2022-05-17 04:36:11] [INFO ] Dead Transitions using invariants and state equation in 4398 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:36:11] [INFO ] Computed 5000 place invariants in 161 ms
[2022-05-17 04:36:25] [INFO ] Implicit Places using invariants in 13658 ms returned []
Implicit Place search using SMT only with invariants took 13680 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:36:25] [INFO ] Computed 5000 place invariants in 147 ms
[2022-05-17 04:36:30] [INFO ] Dead Transitions using invariants and state equation in 5104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s16048 4), p2:(OR (LT s16048 4) (GEQ s24310 5)), p0:(GEQ s1699 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 5 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-08 finished in 94739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 11800 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:36:42] [INFO ] Computed 5000 place invariants in 102 ms
[2022-05-17 04:36:44] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:36:44] [INFO ] Computed 5000 place invariants in 95 ms
[2022-05-17 04:36:49] [INFO ] Implicit Places using invariants in 5119 ms returned []
Implicit Place search using SMT only with invariants took 5131 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:36:49] [INFO ] Computed 5000 place invariants in 102 ms
[2022-05-17 04:36:51] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s7828 4) (LT s5252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 6700 steps with 3350 reset in 10006 ms.
Product exploration timeout after 6430 steps with 3215 reset in 10006 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, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-5000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-5000-LTLFireability-09 finished in 52881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 31798 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:37:55] [INFO ] Computed 5000 place invariants in 123 ms
[2022-05-17 04:37:57] [INFO ] Dead Transitions using invariants and state equation in 1936 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:37:57] [INFO ] Computed 5000 place invariants in 108 ms
[2022-05-17 04:38:02] [INFO ] Implicit Places using invariants in 5613 ms returned []
Implicit Place search using SMT only with invariants took 5615 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:38:03] [INFO ] Computed 5000 place invariants in 91 ms
[2022-05-17 04:38:05] [INFO ] Dead Transitions using invariants and state equation in 2381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s23816 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 5220 steps with 0 reset in 10016 ms.
Product exploration timeout after 4740 steps with 0 reset in 10009 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 p0), (X (NOT p0))]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10004 steps, including 1 resets, run finished after 1984 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2407 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9527 steps, run visited all 1 properties in 2647 ms. (steps per millisecond=3 )
Probabilistic random walk after 9527 steps, saw 9528 distinct states, run finished after 2800 ms. (steps per millisecond=3 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 30738 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:39:18] [INFO ] Computed 5000 place invariants in 103 ms
[2022-05-17 04:39:20] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:39:20] [INFO ] Computed 5000 place invariants in 98 ms
[2022-05-17 04:39:26] [INFO ] Implicit Places using invariants in 5935 ms returned []
Implicit Place search using SMT only with invariants took 5945 ms to find 0 implicit places.
// Phase 1: matrix 40001 rows 25000 cols
[2022-05-17 04:39:26] [INFO ] Computed 5000 place invariants in 116 ms
[2022-05-17 04:39:28] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25000/25000 places, 40001/40001 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 p0), (X (NOT p0))]
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 1995 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2513 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9527 steps, run visited all 1 properties in 2840 ms. (steps per millisecond=3 )
Probabilistic random walk after 9527 steps, saw 9528 distinct states, run finished after 2995 ms. (steps per millisecond=3 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration timeout after 6830 steps with 0 reset in 10027 ms.
Product exploration timeout after 4460 steps with 0 reset in 10012 ms.
Built C files in :
/tmp/ltsmin9492954300943470382
[2022-05-17 04:40:08] [INFO ] Too many transitions (40001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 04:40:08] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9492954300943470382
Running compilation step : cd /tmp/ltsmin9492954300943470382;'/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/ltsmin9492954300943470382;'/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/ltsmin9492954300943470382;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.

BK_STOP 1652762468853

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-5000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-5000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820600228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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