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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 9.0K Apr 30 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:20 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.9K 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.4K 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 1.6M 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-0500-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652752900733

Running Version 202205111006
[2022-05-17 02:01:41] [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 02:01:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 02:01:42] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2022-05-17 02:01:42] [INFO ] Transformed 2501 places.
[2022-05-17 02:01:42] [INFO ] Transformed 4001 transitions.
[2022-05-17 02:01:42] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 347 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 272 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:01:42] [INFO ] Computed 500 place invariants in 40 ms
[2022-05-17 02:01:44] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:01:44] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:01:45] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:01:45] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:01:46] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:01:46] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:01:46] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:01:48] [INFO ] Dead Transitions using invariants and state equation in 1681 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 33 out of 2500 places after structural reductions.
[2022-05-17 02:01:48] [INFO ] Flatten gal took : 244 ms
[2022-05-17 02:01:49] [INFO ] Flatten gal took : 144 ms
[2022-05-17 02:01:49] [INFO ] Input system was already deterministic with 4001 transitions.
Incomplete random walk after 10026 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Probabilistic random walk after 56221 steps, saw 56135 distinct states, run finished after 3044 ms. (steps per millisecond=18 ) properties seen :7
Running SMT prover for 15 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:01:53] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-17 02:01:54] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2022-05-17 02:01:54] [INFO ] After 1202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-17 02:01:55] [INFO ] [Nat]Absence check using 500 positive place invariants in 95 ms returned sat
[2022-05-17 02:02:19] [INFO ] After 23608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-17 02:02:19] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:02:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 02:02:19] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 10 properties in 24016 ms.
Support contains 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 35 are kept as prefixes of interest. Removing 2465 places using SCC suffix rule.12 ms
Discarding 2465 places :
Also discarding 3944 output transitions
Drop transitions removed 3944 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 35 transition count 56
Applied a total of 2 rules in 32 ms. Remains 35 /2500 variables (removed 2465) and now considering 56/4001 (removed 3945) transitions.
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 02:02:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 02:02:43] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/2500 places, 56/4001 transitions.
Incomplete random walk after 10030 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1432 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 02:02:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 02:02:43] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 02:02:43] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:02:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 02:02:43] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:02:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 02:02:43] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:02:43] [INFO ] After 10ms 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 02:02:43] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 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(G(p0)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 332 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:02:44] [INFO ] Computed 500 place invariants in 19 ms
[2022-05-17 02:02:46] [INFO ] Dead Transitions using invariants and state equation in 1733 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:02:46] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:02:46] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:02:46] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:02:48] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:02:48] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
[2022-05-17 02:02:48] [INFO ] Redundant transitions in 248 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:02:48] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:02:50] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2141 s1599)], 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 38760 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 6313 steps with 0 reset with depth 6314 and stack size 5517 in 1199 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-01 finished in 17515 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(p1)&&X(p2)))||p0)))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 183 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:03:01] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:03:03] [INFO ] Dead Transitions using invariants and state equation in 1679 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:03:03] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:03:03] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:03:03] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:03:05] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:03:05] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
[2022-05-17 02:03:05] [INFO ] Redundant transitions in 228 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:03:05] [INFO ] Computed 500 place invariants in 16 ms
[2022-05-17 02:03:07] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 s2373) (LEQ s371 s2094)), p1:(GT s371 s2094), p2:(GT 3 s1865)], 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 46360 steps with 3183 reset in 10001 ms.
Product exploration timeout after 44370 steps with 1949 reset in 10008 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 p0) p1 p2)]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10029 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Finished Best-First random walk after 1001 steps, including 0 resets, run visited all 2 properties in 21 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (F p0), (F (OR (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 172 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:03:48] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:03:49] [INFO ] Dead Transitions using invariants and state equation in 1692 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:03:49] [INFO ] Computed 500 place invariants in 16 ms
[2022-05-17 02:03:50] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:03:50] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:03:51] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:03:51] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2022-05-17 02:03:51] [INFO ] Redundant transitions in 115 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:03:51] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:03:53] [INFO ] Dead Transitions using invariants and state equation in 1683 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 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 p0) p1 p2)]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10279 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Finished Best-First random walk after 1001 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (F p0), (F (OR (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Product exploration timeout after 60160 steps with 5342 reset in 10001 ms.
Product exploration timeout after 44280 steps with 675 reset in 10001 ms.
Built C files in :
/tmp/ltsmin6533574741172063532
[2022-05-17 02:04:34] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 02:04:34] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6533574741172063532
Running compilation step : cd /tmp/ltsmin6533574741172063532;'/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/ltsmin6533574741172063532;'/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/ltsmin6533574741172063532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 171 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:04:37] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:04:38] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:04:38] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:04:39] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:04:39] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:04:40] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:04:40] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
[2022-05-17 02:04:41] [INFO ] Redundant transitions in 126 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:04:41] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:04:42] [INFO ] Dead Transitions using invariants and state equation in 1682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin11293873831005467779
[2022-05-17 02:04:42] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 02:04:42] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11293873831005467779
Running compilation step : cd /tmp/ltsmin11293873831005467779;'/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/ltsmin11293873831005467779;'/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/ltsmin11293873831005467779;'/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 02:04:46] [INFO ] Flatten gal took : 99 ms
[2022-05-17 02:04:46] [INFO ] Flatten gal took : 96 ms
[2022-05-17 02:04:46] [INFO ] Time to serialize gal into /tmp/LTL1752287635346419482.gal : 26 ms
[2022-05-17 02:04:46] [INFO ] Time to serialize properties into /tmp/LTL16726961270433081745.ltl : 42 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/LTL1752287635346419482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16726961270433081745.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/LTL1752287...267
Read 1 LTL properties
Checking formula 0 : !((G(((F((X("(p372>p2095)"))&&(X("(p1866<3)"))))||("(p2374>=3)"))||("(p372<=p2095)"))))
Formula 0 simplified : !G("(p372<=p2095)" | "(p2374>=3)" | F(X"(p372>p2095)" & X"(p1866<3)"))
Detected timeout of ITS tools.
[2022-05-17 02:05:01] [INFO ] Flatten gal took : 86 ms
[2022-05-17 02:05:01] [INFO ] Applying decomposition
[2022-05-17 02:05:01] [INFO ] Flatten gal took : 90 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/graph6892487058773211774.txt' '-o' '/tmp/graph6892487058773211774.bin' '-w' '/tmp/graph6892487058773211774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6892487058773211774.bin' '-l' '-1' '-v' '-w' '/tmp/graph6892487058773211774.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:05:01] [INFO ] Decomposing Gal with order
[2022-05-17 02:05:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:05:02] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-17 02:05:02] [INFO ] Flatten gal took : 151 ms
[2022-05-17 02:05:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 115 ms.
[2022-05-17 02:05:02] [INFO ] Time to serialize gal into /tmp/LTL1166002041790833190.gal : 12 ms
[2022-05-17 02:05:02] [INFO ] Time to serialize properties into /tmp/LTL18238755831771674628.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/LTL1166002041790833190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18238755831771674628.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/LTL1166002...267
Read 1 LTL properties
Checking formula 0 : !((G(((F((X("(gu420.p372>gu420.p2095)"))&&(X("(gu373.p1866<3)"))))||("(gu476.p2374>=3)"))||("(gu420.p372<=gu420.p2095)"))))
Formula 0 simplified : !G("(gu420.p372<=gu420.p2095)" | "(gu476.p2374>=3)" | F(X"(gu420.p372>gu420.p2095)" & X"(gu373.p1866<3)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18085837704634822350
[2022-05-17 02:05:17] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18085837704634822350
Running compilation step : cd /tmp/ltsmin18085837704634822350;'/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/ltsmin18085837704634822350;'/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/ltsmin18085837704634822350;'/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-0500-LTLCardinality-04 finished in 138942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 184 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:05:20] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:05:22] [INFO ] Dead Transitions using invariants and state equation in 1744 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:05:22] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:05:22] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:05:22] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:05:24] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:05:24] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2022-05-17 02:05:24] [INFO ] Redundant transitions in 114 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:05:24] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:05:26] [INFO ] Dead Transitions using invariants and state equation in 1676 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1200 s1141)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-05 finished in 5791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(F(G(p0)))))&&X(p1)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 58 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:05:26] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:05:28] [INFO ] Dead Transitions using invariants and state equation in 1706 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:05:28] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:05:28] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:05:28] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:05:29] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:05:30] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:05:30] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:05:31] [INFO ] Dead Transitions using invariants and state equation in 1698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s365), p0:(OR (LEQ 2 s365) (LEQ 1 s470))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 37810 steps with 0 reset in 10003 ms.
Product exploration timeout after 36410 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Incomplete random walk after 10092 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Probabilistic random walk after 101419 steps, saw 101256 distinct states, run finished after 3029 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:06:15] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:06:15] [INFO ] [Real]Absence check using 500 positive place invariants in 95 ms returned sat
[2022-05-17 02:06:17] [INFO ] After 1760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:06:17] [INFO ] [Nat]Absence check using 500 positive place invariants in 87 ms returned sat
[2022-05-17 02:06:40] [INFO ] After 23527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:06:40] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:06:41] [INFO ] After 834ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:06:42] [INFO ] After 1118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 02:06:42] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 865 steps, including 0 resets, run visited all 1 properties in 78 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 81 ms.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 163 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 169 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:06:42] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:06:44] [INFO ] Dead Transitions using invariants and state equation in 1714 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:06:44] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:06:44] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:06:44] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:06:46] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:06:46] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2022-05-17 02:06:46] [INFO ] Redundant transitions in 118 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:06:46] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:06:48] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 27 ms :[(NOT p0)]
Incomplete random walk after 10113 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Probabilistic random walk after 100416 steps, saw 100254 distinct states, run finished after 3013 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:07:11] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:07:11] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2022-05-17 02:07:13] [INFO ] After 1818ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:07:13] [INFO ] [Nat]Absence check using 500 positive place invariants in 90 ms returned sat
[2022-05-17 02:07:37] [INFO ] After 23647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:07:37] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:07:37] [INFO ] After 858ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:07:38] [INFO ] After 1008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-17 02:07:38] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Finished Parikh walk after 1048 steps, including 0 resets, run visited all 1 properties in 95 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 95 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration timeout after 37550 steps with 0 reset in 10003 ms.
Product exploration timeout after 36320 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin16562412492508715820
[2022-05-17 02:07:58] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 02:07:58] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16562412492508715820
Running compilation step : cd /tmp/ltsmin16562412492508715820;'/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/ltsmin16562412492508715820;'/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/ltsmin16562412492508715820;'/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 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 166 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:01] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:08:03] [INFO ] Dead Transitions using invariants and state equation in 1658 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:03] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:08:03] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:03] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:08:05] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:08:05] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2022-05-17 02:08:05] [INFO ] Redundant transitions in 121 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:05] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:08:07] [INFO ] Dead Transitions using invariants and state equation in 1669 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin14868325589312700669
[2022-05-17 02:08:07] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 02:08:07] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14868325589312700669
Running compilation step : cd /tmp/ltsmin14868325589312700669;'/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/ltsmin14868325589312700669;'/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/ltsmin14868325589312700669;'/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 02:08:10] [INFO ] Flatten gal took : 83 ms
[2022-05-17 02:08:10] [INFO ] Flatten gal took : 85 ms
[2022-05-17 02:08:10] [INFO ] Time to serialize gal into /tmp/LTL8039101270015395719.gal : 10 ms
[2022-05-17 02:08:10] [INFO ] Time to serialize properties into /tmp/LTL3019006134191429636.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/LTL8039101270015395719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3019006134191429636.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/LTL8039101...266
Read 1 LTL properties
Checking formula 0 : !(((F(X(X(F(G("((p366>=2)||(p471>=1))"))))))&&(X("(p366>=2)"))))
Formula 0 simplified : !(FXXFG"((p366>=2)||(p471>=1))" & X"(p366>=2)")
Detected timeout of ITS tools.
[2022-05-17 02:08:25] [INFO ] Flatten gal took : 81 ms
[2022-05-17 02:08:25] [INFO ] Applying decomposition
[2022-05-17 02:08:25] [INFO ] Flatten gal took : 81 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/graph14207571692577681895.txt' '-o' '/tmp/graph14207571692577681895.bin' '-w' '/tmp/graph14207571692577681895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14207571692577681895.bin' '-l' '-1' '-v' '-w' '/tmp/graph14207571692577681895.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:08:25] [INFO ] Decomposing Gal with order
[2022-05-17 02:08:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:08:26] [INFO ] Flatten gal took : 91 ms
[2022-05-17 02:08:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 99 ms.
[2022-05-17 02:08:26] [INFO ] Time to serialize gal into /tmp/LTL1669070440749665498.gal : 13 ms
[2022-05-17 02:08:26] [INFO ] Time to serialize properties into /tmp/LTL4495793970355565595.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/LTL1669070440749665498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4495793970355565595.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/LTL1669070...245
Read 1 LTL properties
Checking formula 0 : !(((F(X(X(F(G("((u73.p366>=2)||(u94.p471>=1))"))))))&&(X("(u73.p366>=2)"))))
Formula 0 simplified : !(FXXFG"((u73.p366>=2)||(u94.p471>=1))" & X"(u73.p366>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12998976303831284463
[2022-05-17 02:08:41] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12998976303831284463
Running compilation step : cd /tmp/ltsmin12998976303831284463;'/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/ltsmin12998976303831284463;'/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/ltsmin12998976303831284463;'/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-0500-LTLCardinality-07 finished in 198262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((F(p0)||p1))||p2)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:44] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:08:46] [INFO ] Dead Transitions using invariants and state equation in 1652 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:46] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:08:46] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:46] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:08:48] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:08:48] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:48] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:08:49] [INFO ] Dead Transitions using invariants and state equation in 1652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ 2 s2076), p1:(GT 1 s820), p0:(AND (GT 2 s2076) (GT 2 s1787))], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-09 finished in 5409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:50] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:08:51] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:51] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:08:52] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:52] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:08:53] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:08:53] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:53] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:08:55] [INFO ] Dead Transitions using invariants and state equation in 1728 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT s2303 s763), p1:(GT s295 s2034)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2593 steps with 0 reset in 375 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-10 finished in 5969 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||(G(!F(G(p1))) U X(p2)))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 52 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:56] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:08:57] [INFO ] Dead Transitions using invariants and state equation in 1719 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:57] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:08:58] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:58] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:08:59] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:08:59] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:08:59] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:09:01] [INFO ] Dead Transitions using invariants and state equation in 1701 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s773 s2012), p2:(LEQ s1994 s1731), p1:(LEQ 3 s776)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 37810 steps with 0 reset in 10002 ms.
Product exploration timeout after 36090 steps with 0 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 p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 8 factoid took 521 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10029 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:09:43] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:09:44] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 02:09:44] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:10:02] [INFO ] After 17461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 02:10:02] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:10:09] [INFO ] After 7012ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 02:10:09] [INFO ] After 7014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 02:10:09] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6001 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 25 are kept as prefixes of interest. Removing 2475 places using SCC suffix rule.6 ms
Discarding 2475 places :
Also discarding 3960 output transitions
Drop transitions removed 3960 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 25 transition count 40
Applied a total of 2 rules in 15 ms. Remains 25 /2500 variables (removed 2475) and now considering 40/4001 (removed 3961) transitions.
// Phase 1: matrix 40 rows 25 cols
[2022-05-17 02:10:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 02:10:15] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/2500 places, 40/4001 transitions.
Finished random walk after 1254 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1254 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 486 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 54 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:16] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:10:17] [INFO ] Dead Transitions using invariants and state equation in 1716 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:17] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:10:18] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:18] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:10:19] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:10:19] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:19] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:10:21] [INFO ] Dead Transitions using invariants and state equation in 1722 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 8 factoid took 436 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10336 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:44] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:10:44] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 02:10:44] [INFO ] [Nat]Absence check using 500 positive place invariants in 91 ms returned sat
[2022-05-17 02:11:02] [INFO ] After 17159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 02:11:02] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:11:09] [INFO ] After 7331ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 02:11:09] [INFO ] After 7332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 02:11:09] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6001 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 25 are kept as prefixes of interest. Removing 2475 places using SCC suffix rule.2 ms
Discarding 2475 places :
Also discarding 3960 output transitions
Drop transitions removed 3960 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 25 transition count 40
Applied a total of 2 rules in 16 ms. Remains 25 /2500 variables (removed 2475) and now considering 40/4001 (removed 3961) transitions.
// Phase 1: matrix 40 rows 25 cols
[2022-05-17 02:11:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 02:11:15] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/2500 places, 40/4001 transitions.
Incomplete random walk after 10091 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2018 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 40 rows 25 cols
[2022-05-17 02:11:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 02:11:15] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 02:11:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 02:11:15] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 02:11:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 02:11:15] [INFO ] After 11ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 02:11:15] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-17 02:11:15] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1086 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=155 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 529 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration timeout after 37240 steps with 0 reset in 10001 ms.
Product exploration timeout after 36730 steps with 0 reset in 10003 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 310 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:11:37] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:11:39] [INFO ] Dead Transitions using invariants and state equation in 1748 ms found 0 transitions.
[2022-05-17 02:11:39] [INFO ] Redundant transitions in 118 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:11:39] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:11:40] [INFO ] Dead Transitions using invariants and state equation in 1698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Product exploration timeout after 38250 steps with 0 reset in 10002 ms.
Product exploration timeout after 36640 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin18097883453624026998
[2022-05-17 02:12:01] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18097883453624026998
Running compilation step : cd /tmp/ltsmin18097883453624026998;'/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/ltsmin18097883453624026998;'/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/ltsmin18097883453624026998;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:04] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:12:05] [INFO ] Dead Transitions using invariants and state equation in 1686 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:05] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:12:06] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:06] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:12:07] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:12:07] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:07] [INFO ] Computed 500 place invariants in 18 ms
[2022-05-17 02:12:09] [INFO ] Dead Transitions using invariants and state equation in 1666 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin10292829260235169607
[2022-05-17 02:12:09] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10292829260235169607
Running compilation step : cd /tmp/ltsmin10292829260235169607;'/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/ltsmin10292829260235169607;'/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/ltsmin10292829260235169607;'/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 02:12:12] [INFO ] Flatten gal took : 82 ms
[2022-05-17 02:12:12] [INFO ] Flatten gal took : 83 ms
[2022-05-17 02:12:12] [INFO ] Time to serialize gal into /tmp/LTL10200326271404103815.gal : 9 ms
[2022-05-17 02:12:12] [INFO ] Time to serialize properties into /tmp/LTL117044490630619734.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/LTL10200326271404103815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL117044490630619734.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/LTL1020032...266
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(p774<=p2013)")))||((G(!(F(G("(p777>=3)")))))U(X("(p1995<=p1732)"))))))
Formula 0 simplified : !G(FG"(p774<=p2013)" | (G!FG"(p777>=3)" U X"(p1995<=p1732)"))
Detected timeout of ITS tools.
[2022-05-17 02:12:27] [INFO ] Flatten gal took : 78 ms
[2022-05-17 02:12:27] [INFO ] Applying decomposition
[2022-05-17 02:12:27] [INFO ] Flatten gal took : 78 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/graph1791448291758056109.txt' '-o' '/tmp/graph1791448291758056109.bin' '-w' '/tmp/graph1791448291758056109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1791448291758056109.bin' '-l' '-1' '-v' '-w' '/tmp/graph1791448291758056109.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:12:28] [INFO ] Decomposing Gal with order
[2022-05-17 02:12:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:12:28] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-17 02:12:28] [INFO ] Flatten gal took : 122 ms
[2022-05-17 02:12:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 34 ms.
[2022-05-17 02:12:28] [INFO ] Time to serialize gal into /tmp/LTL3343714579228240173.gal : 9 ms
[2022-05-17 02:12:28] [INFO ] Time to serialize properties into /tmp/LTL10088803772986697351.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/LTL3343714579228240173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10088803772986697351.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/LTL3343714...267
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(gu155.p774<=gu155.p2013)")))||((G(!(F(G("(gu156.p777>=3)")))))U(X("(gu348.p1995<=gu348.p1732)"))))))
Formula 0 simplified : !G(FG"(gu155.p774<=gu155.p2013)" | (G!FG"(gu156.p777>=3)" U X"(gu348.p1995<=gu348.p1732)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16642340660993895330
[2022-05-17 02:12:43] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16642340660993895330
Running compilation step : cd /tmp/ltsmin16642340660993895330;'/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/ltsmin16642340660993895330;'/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/ltsmin16642340660993895330;'/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-0500-LTLCardinality-12 finished in 230873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((p1||G(p2))))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 60 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:46] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-17 02:12:48] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:48] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:12:48] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:48] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:12:50] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:12:50] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:50] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:12:52] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s1927), p1:(GT 2 s82), p2:(GT s2294 s1585)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-13 finished in 5517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((F((G(p0)&&p1))&&p2)))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 149 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:52] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:12:54] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:54] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:12:54] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:54] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:12:56] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:12:56] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2022-05-17 02:12:56] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:56] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:12:57] [INFO ] Dead Transitions using invariants and state equation in 1731 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s493 s716), p0:(LEQ s1926 s1159), p2:(LEQ 2 s2190)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-14 finished in 5813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 55 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:58] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:12:59] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:59] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:13:00] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:00] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:13:01] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:13:01] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:01] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:13:03] [INFO ] Dead Transitions using invariants and state equation in 1682 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LEQ s1865 s2113), p1:(GT 3 s2176)], 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 explored 100000 steps with 50000 reset in 7816 ms.
Product exploration explored 100000 steps with 50000 reset in 8277 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 p0) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0500-LTLCardinality-15 finished in 41478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(p1)&&X(p2)))||p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(F(G(p0)))))&&X(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||(G(!F(G(p1))) U X(p2)))))'
Found a SL insensitive property : JoinFreeModules-PT-0500-LTLCardinality-12
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 163 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:40] [INFO ] Computed 500 place invariants in 16 ms
[2022-05-17 02:13:41] [INFO ] Dead Transitions using invariants and state equation in 1690 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:41] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:13:42] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:42] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:13:43] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:13:43] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:43] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:13:45] [INFO ] Dead Transitions using invariants and state equation in 1666 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Running random walk in product with property : JoinFreeModules-PT-0500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s773 s2012), p2:(LEQ s1994 s1731), p1:(LEQ 3 s776)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 38010 steps with 0 reset in 10003 ms.
Product exploration timeout after 36590 steps with 0 reset in 10001 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 p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 8 factoid took 374 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10030 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:27] [INFO ] Computed 500 place invariants in 16 ms
[2022-05-17 02:14:27] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 02:14:28] [INFO ] [Nat]Absence check using 500 positive place invariants in 92 ms returned sat
[2022-05-17 02:14:45] [INFO ] After 16915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 02:14:45] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:14:52] [INFO ] After 7588ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 02:14:52] [INFO ] After 7589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 02:14:52] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6001 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 25 are kept as prefixes of interest. Removing 2475 places using SCC suffix rule.6 ms
Discarding 2475 places :
Also discarding 3960 output transitions
Drop transitions removed 3960 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 25 transition count 40
Applied a total of 2 rules in 16 ms. Remains 25 /2500 variables (removed 2475) and now considering 40/4001 (removed 3961) transitions.
// Phase 1: matrix 40 rows 25 cols
[2022-05-17 02:14:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 02:14:58] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/2500 places, 40/4001 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 40 rows 25 cols
[2022-05-17 02:14:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 02:14:58] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 02:14:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:58] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 02:14:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 02:14:58] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 02:14:58] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-17 02:14:58] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1086 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=120 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 527 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 57 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:00] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:15:01] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:01] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:15:02] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:02] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:15:03] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:15:03] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:03] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:15:05] [INFO ] Dead Transitions using invariants and state equation in 1691 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10030 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:27] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:15:27] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 02:15:27] [INFO ] [Nat]Absence check using 500 positive place invariants in 92 ms returned sat
[2022-05-17 02:15:44] [INFO ] After 16684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 02:15:44] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:15:52] [INFO ] After 7839ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 02:15:52] [INFO ] After 7840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 02:15:52] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6002 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 25 are kept as prefixes of interest. Removing 2475 places using SCC suffix rule.1 ms
Discarding 2475 places :
Also discarding 3960 output transitions
Drop transitions removed 3960 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 25 transition count 40
Applied a total of 2 rules in 7 ms. Remains 25 /2500 variables (removed 2475) and now considering 40/4001 (removed 3961) transitions.
// Phase 1: matrix 40 rows 25 cols
[2022-05-17 02:15:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 02:15:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/2500 places, 40/4001 transitions.
Incomplete random walk after 10062 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2012 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 40 rows 25 cols
[2022-05-17 02:15:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 02:15:58] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 02:15:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 02:15:58] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 02:15:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 02:15:58] [INFO ] After 13ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 02:15:58] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-17 02:15:58] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1086 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=98 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 495 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration timeout after 38000 steps with 0 reset in 10001 ms.
Product exploration timeout after 36770 steps with 0 reset in 10002 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 145 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:20] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:16:21] [INFO ] Dead Transitions using invariants and state equation in 1710 ms found 0 transitions.
[2022-05-17 02:16:22] [INFO ] Redundant transitions in 115 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:22] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:16:23] [INFO ] Dead Transitions using invariants and state equation in 1691 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Product exploration timeout after 38110 steps with 0 reset in 10003 ms.
Product exploration timeout after 36380 steps with 0 reset in 10002 ms.
Built C files in :
/tmp/ltsmin5995856011878869037
[2022-05-17 02:16:43] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5995856011878869037
Running compilation step : cd /tmp/ltsmin5995856011878869037;'/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/ltsmin5995856011878869037;'/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/ltsmin5995856011878869037;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 58 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:46] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:16:48] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:48] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:16:48] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:48] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:16:50] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:16:50] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:50] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:16:52] [INFO ] Dead Transitions using invariants and state equation in 1667 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin11828558504793952733
[2022-05-17 02:16:52] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11828558504793952733
Running compilation step : cd /tmp/ltsmin11828558504793952733;'/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/ltsmin11828558504793952733;'/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/ltsmin11828558504793952733;'/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 02:16:55] [INFO ] Flatten gal took : 80 ms
[2022-05-17 02:16:55] [INFO ] Flatten gal took : 82 ms
[2022-05-17 02:16:55] [INFO ] Time to serialize gal into /tmp/LTL2910193969379101675.gal : 13 ms
[2022-05-17 02:16:55] [INFO ] Time to serialize properties into /tmp/LTL8766881405826276215.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/LTL2910193969379101675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8766881405826276215.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/LTL2910193...266
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(p774<=p2013)")))||((G(!(F(G("(p777>=3)")))))U(X("(p1995<=p1732)"))))))
Formula 0 simplified : !G(FG"(p774<=p2013)" | (G!FG"(p777>=3)" U X"(p1995<=p1732)"))
Detected timeout of ITS tools.
[2022-05-17 02:17:10] [INFO ] Flatten gal took : 76 ms
[2022-05-17 02:17:10] [INFO ] Applying decomposition
[2022-05-17 02:17:10] [INFO ] Flatten gal took : 75 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/graph16575247061284109855.txt' '-o' '/tmp/graph16575247061284109855.bin' '-w' '/tmp/graph16575247061284109855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16575247061284109855.bin' '-l' '-1' '-v' '-w' '/tmp/graph16575247061284109855.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:17:10] [INFO ] Decomposing Gal with order
[2022-05-17 02:17:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:17:11] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-17 02:17:11] [INFO ] Flatten gal took : 97 ms
[2022-05-17 02:17:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 31 ms.
[2022-05-17 02:17:11] [INFO ] Time to serialize gal into /tmp/LTL15190411373781874655.gal : 8 ms
[2022-05-17 02:17:11] [INFO ] Time to serialize properties into /tmp/LTL13188721207248948259.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/LTL15190411373781874655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13188721207248948259.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/LTL1519041...268
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(gu155.p774<=gu155.p2013)")))||((G(!(F(G("(gu156.p777>=3)")))))U(X("(gu348.p1995<=gu348.p1732)"))))))
Formula 0 simplified : !G(FG"(gu155.p774<=gu155.p2013)" | (G!FG"(gu156.p777>=3)" U X"(gu348.p1995<=gu348.p1732)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9423856309974449797
[2022-05-17 02:17:26] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9423856309974449797
Running compilation step : cd /tmp/ltsmin9423856309974449797;'/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/ltsmin9423856309974449797;'/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/ltsmin9423856309974449797;'/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-0500-LTLCardinality-12 finished in 229475 ms.
[2022-05-17 02:17:29] [INFO ] Flatten gal took : 80 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12706777200532812015
[2022-05-17 02:17:29] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 02:17:29] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12706777200532812015
Running compilation step : cd /tmp/ltsmin12706777200532812015;'/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 02:17:29] [INFO ] Applying decomposition
[2022-05-17 02:17:29] [INFO ] Flatten gal took : 108 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/graph2884015306182890904.txt' '-o' '/tmp/graph2884015306182890904.bin' '-w' '/tmp/graph2884015306182890904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2884015306182890904.bin' '-l' '-1' '-v' '-w' '/tmp/graph2884015306182890904.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:17:29] [INFO ] Decomposing Gal with order
[2022-05-17 02:17:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:17:29] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-17 02:17:29] [INFO ] Flatten gal took : 97 ms
[2022-05-17 02:17:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 32 ms.
[2022-05-17 02:17:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality1412446149591810652.gal : 9 ms
[2022-05-17 02:17:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality4821507615462180874.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/LTLCardinality1412446149591810652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4821507615462180874.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 : !((G(((F((X("(gu74.p372>gu74.p2095)"))&&(X("(gu374.p1866<3)"))))||("(gu479.p2374>=3)"))||("(gu74.p372<=gu74.p2095)"))))
Formula 0 simplified : !G("(gu74.p372<=gu74.p2095)" | "(gu479.p2374>=3)" | F(X"(gu74.p372>gu74.p2095)" & X"(gu374.p1866<3)"))
Compilation finished in 9873 ms.
Running link step : cd /tmp/ltsmin12706777200532812015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin12706777200532812015;'/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((LTLAPp1==true))&&X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 10731 ms.
FORMULA JoinFreeModules-PT-0500-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12706777200532812015;'/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(<>([]((LTLAPp3==true))))))&&X((LTLAPp4==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.051: LTL layer: formula: (<>(X(X(<>([]((LTLAPp3==true))))))&&X((LTLAPp4==true)))
pins2lts-mc-linux64( 1/ 8), 0.051: "(<>(X(X(<>([]((LTLAPp3==true))))))&&X((LTLAPp4==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.053: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.649: There are 4010 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.649: State length is 2501, there are 4009 groups
pins2lts-mc-linux64( 0/ 8), 0.649: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.649: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.649: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.649: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 2.775: [Blue] ~120 levels ~960 states ~964512 transitions
pins2lts-mc-linux64( 5/ 8), 3.697: [Blue] ~240 levels ~1920 states ~1934712 transitions
pins2lts-mc-linux64( 3/ 8), 5.614: [Blue] ~480 levels ~3840 states ~3861880 transitions
pins2lts-mc-linux64( 3/ 8), 9.255: [Blue] ~960 levels ~7680 states ~7721656 transitions
pins2lts-mc-linux64( 3/ 8), 16.811: [Blue] ~1920 levels ~15360 states ~15448776 transitions
pins2lts-mc-linux64( 2/ 8), 32.093: [Blue] ~3840 levels ~30720 states ~30816632 transitions
pins2lts-mc-linux64( 6/ 8), 46.562: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 60.942:
pins2lts-mc-linux64( 0/ 8), 60.942: Explored 42144 states 42316220 transitions, fanout: 1004.086
pins2lts-mc-linux64( 0/ 8), 60.942: Total exploration time 60.270 sec (46.230 sec minimum, 54.396 sec on average)
pins2lts-mc-linux64( 0/ 8), 60.942: States per second: 699, Transitions per second: 702111
pins2lts-mc-linux64( 0/ 8), 60.942:
pins2lts-mc-linux64( 0/ 8), 60.942: State space has 42291160 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 60.942: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 60.942: blue states: 42144 (0.10%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 60.942: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 60.942: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 60.942:
pins2lts-mc-linux64( 0/ 8), 60.942: Total memory used for local state coloring: 0.6MB
pins2lts-mc-linux64( 0/ 8), 60.942:
pins2lts-mc-linux64( 0/ 8), 60.942: Queue width: 8B, total height: 42144, memory: 0.32MB
pins2lts-mc-linux64( 0/ 8), 60.942: Tree memory: 578.7MB, 14.3 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 60.942: Tree fill ratio (roots/leafs): 31.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 60.942: Stored 4328 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 60.942: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 60.942: Est. total memory use: 579.0MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12706777200532812015;'/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(<>([]((LTLAPp3==true))))))&&X((LTLAPp4==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12706777200532812015;'/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(<>([]((LTLAPp3==true))))))&&X((LTLAPp4==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 02:42:45] [INFO ] Flatten gal took : 82 ms
[2022-05-17 02:42:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality722240139434018046.gal : 8 ms
[2022-05-17 02:42:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality14867424750642042076.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/LTLCardinality722240139434018046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14867424750642042076.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 2 LTL properties
Checking formula 0 : !(((F(X(X(F(G("((p366>=2)||(p471>=1))"))))))&&(X("(p366>=2)"))))
Formula 0 simplified : !(FXXFG"((p366>=2)||(p471>=1))" & X"(p366>=2)")

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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

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