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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.5M
-rw-r--r-- 1 mcc users 9.2K Apr 30 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 30 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 02:21 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.8K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 6.2M 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-2000-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-2000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652757709794

Running Version 202205111006
[2022-05-17 03:21:50] [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-17 03:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 03:21:51] [INFO ] Load time of PNML (sax parser for PT used): 549 ms
[2022-05-17 03:21:51] [INFO ] Transformed 10001 places.
[2022-05-17 03:21:51] [INFO ] Transformed 16001 transitions.
[2022-05-17 03:21:51] [INFO ] Parsed PT model containing 10001 places and 16001 transitions in 739 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 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-2000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1519 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:21:53] [INFO ] Computed 2000 place invariants in 96 ms
[2022-05-17 03:21:54] [INFO ] Dead Transitions using invariants and state equation in 1272 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:21:54] [INFO ] Computed 2000 place invariants in 44 ms
[2022-05-17 03:21:56] [INFO ] Implicit Places using invariants in 1581 ms returned []
Implicit Place search using SMT only with invariants took 1585 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:21:56] [INFO ] Computed 2000 place invariants in 44 ms
[2022-05-17 03:21:57] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Support contains 42 out of 10000 places after structural reductions.
[2022-05-17 03:21:58] [INFO ] Flatten gal took : 595 ms
[2022-05-17 03:21:58] [INFO ] Flatten gal took : 397 ms
[2022-05-17 03:21:59] [INFO ] Input system was already deterministic with 16001 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 835 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 122 ms. (steps per millisecond=8 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 108 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 24) seen :0
Probabilistic random walk after 55045 steps, saw 55025 distinct states, run finished after 9080 ms. (steps per millisecond=6 ) properties seen :4
Running SMT prover for 20 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:22:11] [INFO ] Computed 2000 place invariants in 51 ms
[2022-05-17 03:22:15] [INFO ] After 3685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-17 03:22:19] [INFO ] [Nat]Absence check using 2000 positive place invariants in 708 ms returned sat
[2022-05-17 03:22:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:22:40] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 170 are kept as prefixes of interest. Removing 9830 places using SCC suffix rule.26 ms
Discarding 9830 places :
Also discarding 15728 output transitions
Drop transitions removed 15728 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 170 transition count 272
Applied a total of 2 rules in 92 ms. Remains 170 /10000 variables (removed 9830) and now considering 272/16001 (removed 15729) transitions.
// Phase 1: matrix 272 rows 170 cols
[2022-05-17 03:22:40] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-17 03:22:40] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/10000 places, 272/16001 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 20) 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 18) 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 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 :0
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 :0
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 :0
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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 15) 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 14) 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 14) 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 13) 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 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 11) 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 11) 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 11) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 272 rows 170 cols
[2022-05-17 03:22:40] [INFO ] Computed 34 place invariants in 0 ms
[2022-05-17 03:22:40] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-17 03:22:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2022-05-17 03:22:41] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-17 03:22:41] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-05-17 03:22:41] [INFO ] After 212ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-17 03:22:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 3 ms to minimize.
[2022-05-17 03:22:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-17 03:22:41] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:22:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2022-05-17 03:22:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2022-05-17 03:22:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:22:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-17 03:22:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:22:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-05-17 03:22:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:22:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-05-17 03:22:41] [INFO ] After 838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-17 03:22:42] [INFO ] After 1297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Finished Parikh walk after 37275 steps, including 0 resets, run visited all 1 properties in 149 ms. (steps per millisecond=250 )
Parikh walk visited 10 properties in 8568 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' '!((F(p0)&&(X(!G(F(p1))) U (G(p2)||p3))))'
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3387 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:22:55] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:22:56] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:22:56] [INFO ] Computed 2000 place invariants in 32 ms
[2022-05-17 03:22:58] [INFO ] Implicit Places using invariants in 2122 ms returned []
Implicit Place search using SMT only with invariants took 2125 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:22:58] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:22:59] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), p1, (NOT p0), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 3 s6898), p2:(GT s2994 s9187), p0:(GT s3233 s6241), p1:(LEQ 2 s2264)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 16 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-02 finished in 7982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!F(p0) U (F(p0)||p1))&&G(p2)&&p3)))'
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1155 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:23:00] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:23:01] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:23:01] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:23:03] [INFO ] Implicit Places using invariants in 1434 ms returned []
Implicit Place search using SMT only with invariants took 1439 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:23:03] [INFO ] Computed 2000 place invariants in 38 ms
[2022-05-17 03:23:04] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 p2 p3) (AND p1 p2 p3)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2 p3), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(LEQ 1 s1589), p0:(LEQ s4725 s4053), p3:(LEQ s1456 s4189), p1:(LEQ 3 s90)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-03 finished in 4618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(G(F(p0)))))))'
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3437 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:23:07] [INFO ] Computed 2000 place invariants in 29 ms
[2022-05-17 03:23:08] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:23:08] [INFO ] Computed 2000 place invariants in 33 ms
[2022-05-17 03:23:10] [INFO ] Implicit Places using invariants in 1644 ms returned []
Implicit Place search using SMT only with invariants took 1647 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:23:10] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:23:11] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s5826)], 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 timeout after 12910 steps with 0 reset in 10007 ms.
Product exploration timeout after 12440 steps with 0 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 : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 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 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 999 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Probabilistic random walk after 25011 steps, saw 25005 distinct states, run finished after 3074 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:23:37] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:23:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 656 ms returned sat
[2022-05-17 03:23:52] [INFO ] After 14369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:23:53] [INFO ] [Nat]Absence check using 2000 positive place invariants in 629 ms returned sat
[2022-05-17 03:24:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:24:17] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 5 are kept as prefixes of interest. Removing 9995 places using SCC suffix rule.5 ms
Discarding 9995 places :
Also discarding 15992 output transitions
Drop transitions removed 15992 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 5 transition count 8
Applied a total of 2 rules in 25 ms. Remains 5 /10000 variables (removed 9995) and now considering 8/16001 (removed 15993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:24:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:24:17] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/10000 places, 8/16001 transitions.
Finished random walk after 5508 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2754 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2933 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:24:20] [INFO ] Computed 2000 place invariants in 29 ms
[2022-05-17 03:24:21] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:24:21] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:24:22] [INFO ] Implicit Places using invariants in 1554 ms returned []
Implicit Place search using SMT only with invariants took 1557 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:24:23] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:24:23] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 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, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 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)]
Incomplete random walk after 11008 steps, including 2 resets, run finished after 962 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1111 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Probabilistic random walk after 47034 steps, saw 47017 distinct states, run finished after 6119 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:24:33] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:24:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 632 ms returned sat
[2022-05-17 03:24:47] [INFO ] After 13921ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:24:49] [INFO ] [Nat]Absence check using 2000 positive place invariants in 630 ms returned sat
[2022-05-17 03:25:12] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 5 are kept as prefixes of interest. Removing 9995 places using SCC suffix rule.6 ms
Discarding 9995 places :
Also discarding 15992 output transitions
Drop transitions removed 15992 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 5 transition count 8
Applied a total of 2 rules in 31 ms. Remains 5 /10000 variables (removed 9995) and now considering 8/16001 (removed 15993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:25:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:25:12] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/10000 places, 8/16001 transitions.
Incomplete random walk after 10063 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3354 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31 steps, run visited all 1 properties in 3 ms. (steps per millisecond=10 )
Probabilistic random walk after 31 steps, saw 24 distinct states, run finished after 3 ms. (steps per millisecond=10 ) properties seen :1
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 76 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)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 13020 steps with 0 reset in 10002 ms.
Product exploration timeout after 12680 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin12545223094977834620
[2022-05-17 03:25:32] [INFO ] Too many transitions (16001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:25:33] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12545223094977834620
Running compilation step : cd /tmp/ltsmin12545223094977834620;'/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/ltsmin12545223094977834620;'/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/ltsmin12545223094977834620;'/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 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2944 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:25:39] [INFO ] Computed 2000 place invariants in 24 ms
[2022-05-17 03:25:40] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:25:40] [INFO ] Computed 2000 place invariants in 24 ms
[2022-05-17 03:25:41] [INFO ] Implicit Places using invariants in 1572 ms returned []
Implicit Place search using SMT only with invariants took 1580 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:25:41] [INFO ] Computed 2000 place invariants in 25 ms
[2022-05-17 03:25:42] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Built C files in :
/tmp/ltsmin17422998169892756891
[2022-05-17 03:25:42] [INFO ] Too many transitions (16001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:25:42] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17422998169892756891
Running compilation step : cd /tmp/ltsmin17422998169892756891;'/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/ltsmin17422998169892756891;'/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/ltsmin17422998169892756891;'/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 03:25:46] [INFO ] Flatten gal took : 350 ms
[2022-05-17 03:25:47] [INFO ] Flatten gal took : 520 ms
[2022-05-17 03:25:47] [INFO ] Time to serialize gal into /tmp/LTL318510047466981407.gal : 153 ms
[2022-05-17 03:25:47] [INFO ] Time to serialize properties into /tmp/LTL14421027994820773840.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/LTL318510047466981407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14421027994820773840.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/LTL3185100...266
Read 1 LTL properties
Checking formula 0 : !((X(G(X(X(G(F("(p5827>=1)"))))))))
Formula 0 simplified : !XGXXGF"(p5827>=1)"
Detected timeout of ITS tools.
[2022-05-17 03:26:03] [INFO ] Flatten gal took : 597 ms
[2022-05-17 03:26:03] [INFO ] Applying decomposition
[2022-05-17 03:26:03] [INFO ] Flatten gal took : 642 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/graph15223998853017428719.txt' '-o' '/tmp/graph15223998853017428719.bin' '-w' '/tmp/graph15223998853017428719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15223998853017428719.bin' '-l' '-1' '-v' '-w' '/tmp/graph15223998853017428719.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:26:05] [INFO ] Decomposing Gal with order
[2022-05-17 03:26:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:26:12] [INFO ] Flatten gal took : 691 ms
[2022-05-17 03:26:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 954 ms.
[2022-05-17 03:26:13] [INFO ] Time to serialize gal into /tmp/LTL16608040928548724747.gal : 121 ms
[2022-05-17 03:26:13] [INFO ] Time to serialize properties into /tmp/LTL15220203458404030513.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16608040928548724747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15220203458404030513.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/LTL1660804...247
Read 1 LTL properties
Checking formula 0 : !((X(G(X(X(G(F("(u1165.p5827>=1)"))))))))
Formula 0 simplified : !XGXXGF"(u1165.p5827>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4555328344919123366
[2022-05-17 03:26:28] [INFO ] Built C files in 303ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4555328344919123366
Running compilation step : cd /tmp/ltsmin4555328344919123366;'/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/ltsmin4555328344919123366;'/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/ltsmin4555328344919123366;'/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-2000-LTLCardinality-05 finished in 207441 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 5409 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:37] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:26:38] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:38] [INFO ] Computed 2000 place invariants in 62 ms
[2022-05-17 03:26:41] [INFO ] Implicit Places using invariants in 2470 ms returned []
Implicit Place search using SMT only with invariants took 2488 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:41] [INFO ] Computed 2000 place invariants in 59 ms
[2022-05-17 03:26:42] [INFO ] Dead Transitions using invariants and state equation in 1226 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GT s5844 s2497), p0:(GT s4879 s1964)], 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 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-06 finished in 11060 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(X(p0) U p1)&&p2))))'
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1242 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:44] [INFO ] Computed 2000 place invariants in 43 ms
[2022-05-17 03:26:45] [INFO ] Dead Transitions using invariants and state equation in 1548 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:45] [INFO ] Computed 2000 place invariants in 44 ms
[2022-05-17 03:26:48] [INFO ] Implicit Places using invariants in 2518 ms returned []
Implicit Place search using SMT only with invariants took 2531 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:48] [INFO ] Computed 2000 place invariants in 60 ms
[2022-05-17 03:26:49] [INFO ] Dead Transitions using invariants and state equation in 1440 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 683 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(AND (LEQ 3 s6069) (LEQ s430 s4637)), p2:(OR (GT s2632 s9056) (GT 3 s1881)), p0:(LEQ s2632 s9056)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 13570 steps with 3392 reset in 10018 ms.
Product exploration timeout after 11090 steps with 2772 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 11009 steps, including 2 resets, run finished after 1793 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1715 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1710 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1875 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1354 ms. (steps per millisecond=7 ) properties (out of 4) seen :0
Probabilistic random walk after 84075 steps, saw 84043 distinct states, run finished after 24210 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:27:45] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:27:47] [INFO ] After 1294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 03:27:48] [INFO ] [Nat]Absence check using 2000 positive place invariants in 555 ms returned sat
[2022-05-17 03:28:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:28:12] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 30 are kept as prefixes of interest. Removing 9970 places using SCC suffix rule.4 ms
Discarding 9970 places :
Also discarding 15952 output transitions
Drop transitions removed 15952 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 30 transition count 48
Applied a total of 2 rules in 51 ms. Remains 30 /10000 variables (removed 9970) and now considering 48/16001 (removed 15953) transitions.
// Phase 1: matrix 48 rows 30 cols
[2022-05-17 03:28:12] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 03:28:12] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/10000 places, 48/16001 transitions.
Incomplete random walk after 10594 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1765 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 30 cols
[2022-05-17 03:28:12] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 03:28:12] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 03:28:12] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:28:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-17 03:28:12] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:28:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 03:28:12] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 03:28:12] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-17 03:28:12] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 54 ms.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 25 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 12 ms. Remains 25 /30 variables (removed 5) and now considering 40/48 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 40/48 transitions.
Incomplete random walk after 10210 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2552 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 238454 steps, run visited all 1 properties in 669 ms. (steps per millisecond=356 )
Probabilistic random walk after 238454 steps, saw 205279 distinct states, run finished after 670 ms. (steps per millisecond=355 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (OR p1 (NOT p2))), (F (AND p0 p1)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 164 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1174 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:14] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:28:15] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:15] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:28:17] [INFO ] Implicit Places using invariants in 1494 ms returned []
Implicit Place search using SMT only with invariants took 1497 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:17] [INFO ] Computed 2000 place invariants in 34 ms
[2022-05-17 03:28:18] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 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 72 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 854 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 964 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1036 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 927 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 941 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Probabilistic random walk after 82075 steps, saw 82043 distinct states, run finished after 12021 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:36] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:28:37] [INFO ] After 1348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 03:28:39] [INFO ] [Nat]Absence check using 2000 positive place invariants in 718 ms returned sat
[2022-05-17 03:29:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:29:02] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 30 are kept as prefixes of interest. Removing 9970 places using SCC suffix rule.4 ms
Discarding 9970 places :
Also discarding 15952 output transitions
Drop transitions removed 15952 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 30 transition count 48
Applied a total of 2 rules in 34 ms. Remains 30 /10000 variables (removed 9970) and now considering 48/16001 (removed 15953) transitions.
// Phase 1: matrix 48 rows 30 cols
[2022-05-17 03:29:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 03:29:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/10000 places, 48/16001 transitions.
Finished random walk after 9997 steps, including 2 resets, run visited all 4 properties in 6 ms. (steps per millisecond=1666 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (OR p1 (NOT p2))), (F (AND p0 p1)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 168 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration timeout after 24320 steps with 6080 reset in 10004 ms.
Product exploration timeout after 23710 steps with 5927 reset in 10003 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 195 ms :[true, (OR (NOT p2) p1), (AND p1 p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3146 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:27] [INFO ] Computed 2000 place invariants in 35 ms
[2022-05-17 03:29:28] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:28] [INFO ] Computed 2000 place invariants in 68 ms
[2022-05-17 03:29:29] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Product exploration timeout after 12030 steps with 3007 reset in 10003 ms.
Product exploration timeout after 11740 steps with 2935 reset in 10004 ms.
Built C files in :
/tmp/ltsmin3282784642806291871
[2022-05-17 03:29:49] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3282784642806291871
Running compilation step : cd /tmp/ltsmin3282784642806291871;'/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/ltsmin3282784642806291871;'/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/ltsmin3282784642806291871;'/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 6 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1046 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:53] [INFO ] Computed 2000 place invariants in 33 ms
[2022-05-17 03:29:54] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:54] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:29:55] [INFO ] Implicit Places using invariants in 1441 ms returned []
Implicit Place search using SMT only with invariants took 1442 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:55] [INFO ] Computed 2000 place invariants in 34 ms
[2022-05-17 03:29:56] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Built C files in :
/tmp/ltsmin6512580196610494772
[2022-05-17 03:29:56] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6512580196610494772
Running compilation step : cd /tmp/ltsmin6512580196610494772;'/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/ltsmin6512580196610494772;'/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/ltsmin6512580196610494772;'/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 03:30:00] [INFO ] Flatten gal took : 442 ms
[2022-05-17 03:30:00] [INFO ] Flatten gal took : 377 ms
[2022-05-17 03:30:00] [INFO ] Time to serialize gal into /tmp/LTL878097653224224622.gal : 34 ms
[2022-05-17 03:30:00] [INFO ] Time to serialize properties into /tmp/LTL12597774054789326265.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL878097653224224622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12597774054789326265.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/LTL8780976...266
Read 1 LTL properties
Checking formula 0 : !((X(X((!((X("(p2633<=p9057)"))U("((p6070>=3)&&(p431<=p4638))")))&&("((p2633>p9057)||(p1882<3))")))))
Formula 0 simplified : !XX("((p2633>p9057)||(p1882<3))" & !(X"(p2633<=p9057)" U "((p6070>=3)&&(p431<=p4638))"))
Detected timeout of ITS tools.
[2022-05-17 03:30:16] [INFO ] Flatten gal took : 324 ms
[2022-05-17 03:30:16] [INFO ] Applying decomposition
[2022-05-17 03:30:16] [INFO ] Flatten gal took : 408 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/graph29504529071165859.txt' '-o' '/tmp/graph29504529071165859.bin' '-w' '/tmp/graph29504529071165859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph29504529071165859.bin' '-l' '-1' '-v' '-w' '/tmp/graph29504529071165859.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:30:17] [INFO ] Decomposing Gal with order
[2022-05-17 03:30:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:30:22] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-17 03:30:22] [INFO ] Flatten gal took : 596 ms
[2022-05-17 03:30:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 483 ms.
[2022-05-17 03:30:23] [INFO ] Time to serialize gal into /tmp/LTL12259873422059481279.gal : 56 ms
[2022-05-17 03:30:23] [INFO ] Time to serialize properties into /tmp/LTL17623091973803837520.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/LTL12259873422059481279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17623091973803837520.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/LTL1225987...268
Read 1 LTL properties
Checking formula 0 : !((X(X((!((X("(gu1812.p2633<=gu1812.p9057)"))U("((gu1214.p6070>=3)&&(gu928.p431<=gu928.p4638))")))&&("((gu1812.p2633>gu1812.p9057)||(g...175
Formula 0 simplified : !XX("((gu1812.p2633>gu1812.p9057)||(gu376.p1882<3))" & !(X"(gu1812.p2633<=gu1812.p9057)" U "((gu1214.p6070>=3)&&(gu928.p431<=gu928.p...164
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9421514599619384788
[2022-05-17 03:30:38] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9421514599619384788
Running compilation step : cd /tmp/ltsmin9421514599619384788;'/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/ltsmin9421514599619384788;'/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/ltsmin9421514599619384788;'/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-2000-LTLCardinality-07 finished in 238330 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 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2340 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:30:43] [INFO ] Computed 2000 place invariants in 63 ms
[2022-05-17 03:30:45] [INFO ] Dead Transitions using invariants and state equation in 1483 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:30:45] [INFO ] Computed 2000 place invariants in 67 ms
[2022-05-17 03:30:48] [INFO ] Implicit Places using invariants in 2901 ms returned []
Implicit Place search using SMT only with invariants took 2915 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:30:48] [INFO ] Computed 2000 place invariants in 77 ms
[2022-05-17 03:30:49] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6783 s5670)], 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 21810 steps with 10905 reset in 10001 ms.
Product exploration timeout after 15220 steps with 7610 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 : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-08 finished in 30831 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!X((X(p0)||p1))) U !(X(G(p2)) U p2)))'
Support contains 5 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1247 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:13] [INFO ] Computed 2000 place invariants in 25 ms
[2022-05-17 03:31:14] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:14] [INFO ] Computed 2000 place invariants in 25 ms
[2022-05-17 03:31:15] [INFO ] Implicit Places using invariants in 1467 ms returned []
Implicit Place search using SMT only with invariants took 1473 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:15] [INFO ] Computed 2000 place invariants in 25 ms
[2022-05-17 03:31:16] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 108 ms :[p2, (OR p0 p1), p2, p0]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s1970 s6169), p1:(LEQ 3 s9664), p0:(LEQ s2499 s85)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 22690 steps with 11345 reset in 10001 ms.
Product exploration timeout after 24340 steps with 12170 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-09 finished in 25510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(!(p0 U p1))))))'
Support contains 5 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3207 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:40] [INFO ] Computed 2000 place invariants in 25 ms
[2022-05-17 03:31:41] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:41] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:31:42] [INFO ] Implicit Places using invariants in 1333 ms returned []
Implicit Place search using SMT only with invariants took 1339 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:42] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:31:43] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 61 ms :[p1, p1]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s1412), p0:(AND (GT s5162 s286) (LEQ s4210 s5967))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-11 finished in 6221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(X(G(p0)))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3282 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:47] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:31:47] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:47] [INFO ] Computed 2000 place invariants in 32 ms
[2022-05-17 03:31:49] [INFO ] Implicit Places using invariants in 1376 ms returned []
Implicit Place search using SMT only with invariants took 1381 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:49] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:31:50] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s6961 s7332)], 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 13150 steps with 0 reset in 10003 ms.
Product exploration timeout after 12810 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, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 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 30 ms :[(NOT p0)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 772 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1008 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Probabilistic random walk after 24008 steps, saw 24003 distinct states, run finished after 3093 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:16] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:32:17] [INFO ] After 867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:32:18] [INFO ] [Nat]Absence check using 2000 positive place invariants in 554 ms returned sat
[2022-05-17 03:32:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:32:42] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.3 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 10 transition count 16
Applied a total of 2 rules in 15 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:32:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 03:32:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 1001 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1001 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 88 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3150 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:45] [INFO ] Computed 2000 place invariants in 41 ms
[2022-05-17 03:32:46] [INFO ] Dead Transitions using invariants and state equation in 1037 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:46] [INFO ] Computed 2000 place invariants in 37 ms
[2022-05-17 03:32:48] [INFO ] Implicit Places using invariants in 1552 ms returned []
Implicit Place search using SMT only with invariants took 1554 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:48] [INFO ] Computed 2000 place invariants in 41 ms
[2022-05-17 03:32:49] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 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, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 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 40 ms :[(NOT p0)]
Incomplete random walk after 11010 steps, including 2 resets, run finished after 845 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 914 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Probabilistic random walk after 25011 steps, saw 25005 distinct states, run finished after 3063 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:55] [INFO ] Computed 2000 place invariants in 40 ms
[2022-05-17 03:32:56] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:32:58] [INFO ] [Nat]Absence check using 2000 positive place invariants in 954 ms returned sat
[2022-05-17 03:33:21] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.3 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 10 transition count 16
Applied a total of 2 rules in 14 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:33:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 03:33:21] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 3002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1501 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration timeout after 13480 steps with 0 reset in 10007 ms.
Product exploration timeout after 13010 steps with 0 reset in 10008 ms.
Built C files in :
/tmp/ltsmin12558590711351585913
[2022-05-17 03:33:41] [INFO ] Too many transitions (16001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:33:41] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12558590711351585913
Running compilation step : cd /tmp/ltsmin12558590711351585913;'/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/ltsmin12558590711351585913;'/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/ltsmin12558590711351585913;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2980 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:47] [INFO ] Computed 2000 place invariants in 34 ms
[2022-05-17 03:33:48] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:48] [INFO ] Computed 2000 place invariants in 29 ms
[2022-05-17 03:33:50] [INFO ] Implicit Places using invariants in 1568 ms returned []
Implicit Place search using SMT only with invariants took 1569 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:50] [INFO ] Computed 2000 place invariants in 33 ms
[2022-05-17 03:33:51] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Built C files in :
/tmp/ltsmin3922363414713633800
[2022-05-17 03:33:51] [INFO ] Too many transitions (16001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:33:51] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3922363414713633800
Running compilation step : cd /tmp/ltsmin3922363414713633800;'/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/ltsmin3922363414713633800;'/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/ltsmin3922363414713633800;'/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 03:33:55] [INFO ] Flatten gal took : 644 ms
[2022-05-17 03:33:55] [INFO ] Flatten gal took : 657 ms
[2022-05-17 03:33:56] [INFO ] Time to serialize gal into /tmp/LTL10342616967423946788.gal : 65 ms
[2022-05-17 03:33:56] [INFO ] Time to serialize properties into /tmp/LTL7461259147338033058.ltl : 44 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/LTL10342616967423946788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7461259147338033058.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/LTL1034261...267
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G(X(G("(p6962<=p7333)"))))))))
Formula 0 simplified : !FXFGXG"(p6962<=p7333)"
Detected timeout of ITS tools.
[2022-05-17 03:34:11] [INFO ] Flatten gal took : 348 ms
[2022-05-17 03:34:11] [INFO ] Applying decomposition
[2022-05-17 03:34:11] [INFO ] Flatten gal took : 347 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/graph4062002937854044276.txt' '-o' '/tmp/graph4062002937854044276.bin' '-w' '/tmp/graph4062002937854044276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4062002937854044276.bin' '-l' '-1' '-v' '-w' '/tmp/graph4062002937854044276.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:34:12] [INFO ] Decomposing Gal with order
[2022-05-17 03:34:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:34:17] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-17 03:34:17] [INFO ] Flatten gal took : 386 ms
[2022-05-17 03:34:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 505 ms.
[2022-05-17 03:34:18] [INFO ] Time to serialize gal into /tmp/LTL2633350168544970830.gal : 329 ms
[2022-05-17 03:34:18] [INFO ] Time to serialize properties into /tmp/LTL2216467716011372417.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2633350168544970830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2216467716011372417.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/LTL2633350...266
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G(X(G("(gu1466.p6962<=gu1466.p7333)"))))))))
Formula 0 simplified : !FXFGXG"(gu1466.p6962<=gu1466.p7333)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7140946646327245095
[2022-05-17 03:34:33] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7140946646327245095
Running compilation step : cd /tmp/ltsmin7140946646327245095;'/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/ltsmin7140946646327245095;'/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/ltsmin7140946646327245095;'/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-2000-LTLCardinality-12 finished in 172805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(p0)&&X(p1))))||X(p2)))'
Support contains 5 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1218 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:34:37] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:34:38] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:34:38] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:34:40] [INFO ] Implicit Places using invariants in 1354 ms returned []
Implicit Place search using SMT only with invariants took 1360 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:34:40] [INFO ] Computed 2000 place invariants in 74 ms
[2022-05-17 03:34:40] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(LEQ 1 s1227), p0:(LEQ s8422 s3467), p1:(LEQ s6745 s2288)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 26750 steps with 13375 reset in 10004 ms.
Product exploration timeout after 25610 steps with 12805 reset in 10004 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 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0)))
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-2000-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-2000-LTLCardinality-14 finished in 25579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(G(F(p0)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(X(p0) U p1)&&p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(X(G(p0)))))))'
[2022-05-17 03:35:02] [INFO ] Flatten gal took : 374 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8360669374279698164
[2022-05-17 03:35:03] [INFO ] Too many transitions (16001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:35:03] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8360669374279698164
Running compilation step : cd /tmp/ltsmin8360669374279698164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 03:35:03] [INFO ] Applying decomposition
[2022-05-17 03:35:03] [INFO ] Flatten gal took : 597 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/graph12143868853188534921.txt' '-o' '/tmp/graph12143868853188534921.bin' '-w' '/tmp/graph12143868853188534921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12143868853188534921.bin' '-l' '-1' '-v' '-w' '/tmp/graph12143868853188534921.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:35:06] [INFO ] Decomposing Gal with order
[2022-05-17 03:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:35:13] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-17 03:35:14] [INFO ] Flatten gal took : 490 ms
[2022-05-17 03:35:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 793 ms.
[2022-05-17 03:35:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality241365132034151230.gal : 67 ms
[2022-05-17 03:35:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality12601325602741236088.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality241365132034151230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12601325602741236088.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...288
Read 3 LTL properties
Checking formula 0 : !((X(G(X(X(G(F("(gu1167.p5827>=1)"))))))))
Formula 0 simplified : !XGXXGF"(gu1167.p5827>=1)"
Compilation finished in 171084 ms.
Running link step : cd /tmp/ltsmin8360669374279698164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 133 ms.
Running LTSmin : cd /tmp/ltsmin8360669374279698164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(X([](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8360669374279698164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(X([](<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8360669374279698164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((!(X((LTLAPp1==true)) U (LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 03:59:40] [INFO ] Flatten gal took : 892 ms
[2022-05-17 03:59:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality7139885766142232108.gal : 70 ms
[2022-05-17 03:59:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality8114183305995793753.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/LTLCardinality7139885766142232108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8114183305995793753.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...288
Read 3 LTL properties
Checking formula 0 : !((X(G(X(X(G(F("(p5827>=1)"))))))))
Formula 0 simplified : !XGXXGF"(p5827>=1)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8360669374279698164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((!(X((LTLAPp1==true)) U (LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8360669374279698164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(<>([](X([]((LTLAPp4==true)))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="JoinFreeModules-PT-2000"
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 JoinFreeModules-PT-2000, 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 r132-tall-165271820600219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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