About the Execution of ITS-Tools for AirplaneLD-PT-4000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1415106.00 | 0.00 | 0.00 | FTTFTTFFT?F???TF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689100307.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AirplaneLD-PT-4000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689100307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 45M
-rw-r--r-- 1 mcc users 1002K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 29 22:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.5M Apr 29 22:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1M May 9 07:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.7M May 9 07:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 9 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.5M May 9 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 191K May 9 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 358K May 9 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 18M May 10 09:33 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 AirplaneLD-PT-4000-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-4000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652659085404
Running Version 202205111006
[2022-05-15 23:58:07] [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-15 23:58:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:58:08] [INFO ] Load time of PNML (sax parser for PT used): 1361 ms
[2022-05-15 23:58:08] [INFO ] Transformed 28019 places.
[2022-05-15 23:58:08] [INFO ] Transformed 32008 transitions.
[2022-05-15 23:58:08] [INFO ] Parsed PT model containing 28019 places and 32008 transitions in 1641 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9121 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 12002 places and 0 transitions.
FORMULA AirplaneLD-PT-4000-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-4000-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-4000-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-4000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16016 out of 16017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Applied a total of 0 rules in 127 ms. Remains 16017 /16017 variables (removed 0) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16017 cols
[2022-05-15 23:58:42] [INFO ] Computed 3 place invariants in 23934 ms
[2022-05-15 23:58:44] [INFO ] Implicit Places using invariants in 25757 ms returned []
Implicit Place search using SMT only with invariants took 25788 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16017 cols
[2022-05-15 23:59:08] [INFO ] Computed 3 place invariants in 23721 ms
[2022-05-15 23:59:09] [INFO ] Dead Transitions using invariants and state equation in 25208 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16017/16017 places, 32008/32008 transitions.
Support contains 16016 out of 16017 places after structural reductions.
[2022-05-15 23:59:11] [INFO ] Flatten gal took : 1264 ms
[2022-05-15 23:59:12] [INFO ] Flatten gal took : 987 ms
[2022-05-15 23:59:15] [INFO ] Input system was already deterministic with 32008 transitions.
Support contains 16015 out of 16017 places (down from 16016) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 24527 ms. (steps per millisecond=0 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1074 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 32008 rows 16017 cols
[2022-05-16 00:00:05] [INFO ] Computed 3 place invariants in 23528 ms
[2022-05-16 00:00:09] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-05-16 00:00:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:00:09] [INFO ] After 4162ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2022-05-16 00:00:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 00:00:13] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 00:00:34] [INFO ] After 19994ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2022-05-16 00:00:34] [INFO ] After 20033ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 00:00:34] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16005 out of 16017 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Graph (complete) has 42023 edges and 16017 vertex of which 16012 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.66 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 16012 transition count 32004
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 16012 transition count 32002
Deduced a syphon composed of 2 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 16009 transition count 32002
Applied a total of 10 rules in 545 ms. Remains 16009 /16017 variables (removed 8) and now considering 32002/32008 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 16009/16017 places, 32002/32008 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 25809 ms. (steps per millisecond=0 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 913 ms. (steps per millisecond=10 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 622375 steps, run timeout after 81001 ms. (steps per millisecond=7 ) properties seen :{1=1, 2=1, 4=1, 7=1}
Probabilistic random walk after 622375 steps, saw 260627 distinct states, run finished after 81004 ms. (steps per millisecond=7 ) properties seen :4
Running SMT prover for 5 properties.
// Phase 1: matrix 32002 rows 16009 cols
[2022-05-16 00:02:47] [INFO ] Computed 2 place invariants in 23607 ms
[2022-05-16 00:02:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 53 ms returned sat
[2022-05-16 00:03:12] [INFO ] After 20849ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2022-05-16 00:03:12] [INFO ] After 20882ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-16 00:03:12] [INFO ] After 25059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12003 out of 16009 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16009/16009 places, 32002/32002 transitions.
Graph (complete) has 22007 edges and 16009 vertex of which 14010 are kept as prefixes of interest. Removing 1999 places using SCC suffix rule.20 ms
Discarding 1999 places :
Also discarding 0 output transitions
Drop transitions removed 3998 transitions
Reduce isomorphic transitions removed 3998 transitions.
Iterating post reduction 0 with 3998 rules applied. Total rules applied 3999 place count 14010 transition count 28004
Discarding 1999 places :
Symmetric choice reduction at 1 with 1999 rule applications. Total rules 5998 place count 12011 transition count 26005
Iterating global reduction 1 with 1999 rules applied. Total rules applied 7997 place count 12011 transition count 26005
Ensure Unique test removed 1999 transitions
Reduce isomorphic transitions removed 1999 transitions.
Iterating post reduction 1 with 1999 rules applied. Total rules applied 9996 place count 12011 transition count 24006
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9997 place count 12011 transition count 24005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9998 place count 12010 transition count 24005
Applied a total of 9998 rules in 1328 ms. Remains 12010 /16009 variables (removed 3999) and now considering 24005/32002 (removed 7997) transitions.
Finished structural reductions, in 1 iterations. Remains : 12010/16009 places, 24005/32002 transitions.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA AirplaneLD-PT-4000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-4000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-4000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16017 stabilizing places and 32008 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16017 transition count 32008
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 16017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 16014 transition count 32008
Applied a total of 3 rules in 76 ms. Remains 16014 /16017 variables (removed 3) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:03:38] [INFO ] Computed 1 place invariants in 23619 ms
[2022-05-16 00:03:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:03:39] [INFO ] Implicit Places using invariants in 25245 ms returned []
Implicit Place search using SMT only with invariants took 25246 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:04:02] [INFO ] Computed 1 place invariants in 22517 ms
[2022-05-16 00:04:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:04:03] [INFO ] Dead Transitions using invariants and state equation in 24074 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16014/16017 places, 32008/32008 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16017 places, 32008/32008 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-4000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ 8000 s4001)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 16 ms.
FORMULA AirplaneLD-PT-4000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-4000-LTLCardinality-00 finished in 49794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4002 out of 16017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 16014 transition count 32008
Applied a total of 3 rules in 58 ms. Remains 16014 /16017 variables (removed 3) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:04:27] [INFO ] Computed 1 place invariants in 23753 ms
[2022-05-16 00:04:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:04:29] [INFO ] Implicit Places using invariants in 25382 ms returned []
Implicit Place search using SMT only with invariants took 25383 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:04:52] [INFO ] Computed 1 place invariants in 22465 ms
[2022-05-16 00:04:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:04:53] [INFO ] Dead Transitions using invariants and state equation in 24300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16014/16017 places, 32008/32008 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16017 places, 32008/32008 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-4000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ s16011 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 2210 steps with 1105 reset in 10024 ms.
Product exploration timeout after 2190 steps with 1095 reset in 10002 ms.
Computed a total of 16014 stabilizing places and 32008 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16014 transition count 32008
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-4000-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-4000-LTLCardinality-05 finished in 101965 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!F(G(p0))) U (G(p2)&&p1)))'
Support contains 12003 out of 16017 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Graph (complete) has 42023 edges and 16017 vertex of which 16015 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.46 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 3998 places :
Symmetric choice reduction at 0 with 3998 rule applications. Total rules 3999 place count 12017 transition count 28010
Iterating global reduction 0 with 3998 rules applied. Total rules applied 7997 place count 12017 transition count 28010
Ensure Unique test removed 3998 transitions
Reduce isomorphic transitions removed 3998 transitions.
Iterating post reduction 0 with 3998 rules applied. Total rules applied 11995 place count 12017 transition count 24012
Applied a total of 11995 rules in 904 ms. Remains 12017 /16017 variables (removed 4000) and now considering 24012/32008 (removed 7996) transitions.
// Phase 1: matrix 24012 rows 12017 cols
[2022-05-16 00:05:57] [INFO ] Computed 2 place invariants in 10824 ms
[2022-05-16 00:05:58] [INFO ] Implicit Places using invariants in 11805 ms returned []
Implicit Place search using SMT only with invariants took 11818 ms to find 0 implicit places.
// Phase 1: matrix 24012 rows 12017 cols
[2022-05-16 00:06:09] [INFO ] Computed 2 place invariants in 10631 ms
[2022-05-16 00:06:10] [INFO ] Dead Transitions using invariants and state equation in 11779 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12017/16017 places, 24012/32008 transitions.
Finished structural reductions, in 1 iterations. Remains : 12017/16017 places, 24012/32008 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p1)), p0, p0, (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-4000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ 3 (ADD s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s4023 s4024 s4025 s4026 s4...], 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 7 steps with 0 reset in 25 ms.
FORMULA AirplaneLD-PT-4000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-4000-LTLCardinality-07 finished in 24830 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(X(F(p0))))||X(F(p1))))'
Support contains 2 out of 16017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 16015 transition count 32008
Applied a total of 2 rules in 77 ms. Remains 16015 /16017 variables (removed 2) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16015 cols
[2022-05-16 00:06:14] [INFO ] Computed 2 place invariants in 3677 ms
[2022-05-16 00:06:15] [INFO ] Implicit Places using invariants in 4849 ms returned []
Implicit Place search using SMT only with invariants took 4863 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16015 cols
[2022-05-16 00:06:19] [INFO ] Computed 2 place invariants in 3702 ms
[2022-05-16 00:06:20] [INFO ] Dead Transitions using invariants and state equation in 4871 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16015/16017 places, 32008/32008 transitions.
Finished structural reductions, in 1 iterations. Remains : 16015/16017 places, 32008/32008 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-4000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ 1 s16003) (LEQ s16003 s16010)), p0:(LEQ s16003 s16010)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 3480 steps with 601 reset in 10022 ms.
Product exploration timeout after 3360 steps with 575 reset in 10010 ms.
Computed a total of 16015 stabilizing places and 32008 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16015 transition count 32008
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-4000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-4000-LTLCardinality-08 finished in 59362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 16017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 16014 transition count 32008
Applied a total of 3 rules in 67 ms. Remains 16014 /16017 variables (removed 3) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:07:33] [INFO ] Computed 1 place invariants in 22694 ms
[2022-05-16 00:07:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:07:34] [INFO ] Implicit Places using invariants in 24372 ms returned []
Implicit Place search using SMT only with invariants took 24374 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:07:58] [INFO ] Computed 1 place invariants in 23301 ms
[2022-05-16 00:07:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:07:59] [INFO ] Dead Transitions using invariants and state equation in 24961 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16014/16017 places, 32008/32008 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16017 places, 32008/32008 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-PT-4000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s16010 s5511)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 2410 steps with 602 reset in 10004 ms.
Product exploration timeout after 2490 steps with 622 reset in 10020 ms.
Computed a total of 16014 stabilizing places and 32008 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16014 transition count 32008
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 17 steps, including 1 resets, run visited all 1 properties in 36 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 16014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16014/16014 places, 32008/32008 transitions.
Applied a total of 0 rules in 119 ms. Remains 16014 /16014 variables (removed 0) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:09:04] [INFO ] Computed 1 place invariants in 22773 ms
[2022-05-16 00:09:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:09:06] [INFO ] Implicit Places using invariants in 24146 ms returned []
Implicit Place search using SMT only with invariants took 24147 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:09:29] [INFO ] Computed 1 place invariants in 22969 ms
[2022-05-16 00:09:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:09:30] [INFO ] Dead Transitions using invariants and state equation in 24302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16014 places, 32008/32008 transitions.
Computed a total of 16014 stabilizing places and 32008 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16014 transition count 32008
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 124 steps, including 15 resets, run visited all 1 properties in 371 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration timeout after 2310 steps with 577 reset in 10029 ms.
Product exploration timeout after 2480 steps with 620 reset in 10041 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 16014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16014/16014 places, 32008/32008 transitions.
Applied a total of 0 rules in 155 ms. Remains 16014 /16014 variables (removed 0) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:10:34] [INFO ] Computed 1 place invariants in 22810 ms
[2022-05-16 00:10:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:10:35] [INFO ] Dead Transitions using invariants and state equation in 24355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16014 places, 32008/32008 transitions.
Product exploration timeout after 2870 steps with 717 reset in 10018 ms.
Product exploration timeout after 2920 steps with 730 reset in 10019 ms.
Built C files in :
/tmp/ltsmin11272094756110856867
[2022-05-16 00:10:56] [INFO ] Built C files in 296ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11272094756110856867
Running compilation step : cd /tmp/ltsmin11272094756110856867;'/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/ltsmin11272094756110856867;'/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/ltsmin11272094756110856867;'/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 16014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16014/16014 places, 32008/32008 transitions.
Applied a total of 0 rules in 66 ms. Remains 16014 /16014 variables (removed 0) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:11:22] [INFO ] Computed 1 place invariants in 23080 ms
[2022-05-16 00:11:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:11:24] [INFO ] Implicit Places using invariants in 24640 ms returned []
Implicit Place search using SMT only with invariants took 24661 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:11:46] [INFO ] Computed 1 place invariants in 22797 ms
[2022-05-16 00:11:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:11:48] [INFO ] Dead Transitions using invariants and state equation in 24461 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16014 places, 32008/32008 transitions.
Built C files in :
/tmp/ltsmin16148279062060933629
[2022-05-16 00:11:48] [INFO ] Built C files in 334ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16148279062060933629
Running compilation step : cd /tmp/ltsmin16148279062060933629;'/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/ltsmin16148279062060933629;'/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/ltsmin16148279062060933629;'/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-16 00:11:53] [INFO ] Flatten gal took : 939 ms
[2022-05-16 00:11:54] [INFO ] Flatten gal took : 646 ms
[2022-05-16 00:11:54] [INFO ] Time to serialize gal into /tmp/LTL3258575868940679366.gal : 136 ms
[2022-05-16 00:11:54] [INFO ] Time to serialize properties into /tmp/LTL5563044048712166693.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/LTL3258575868940679366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5563044048712166693.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/LTL3258575...266
Read 1 LTL properties
Checking formula 0 : !((X(X(X("(P4<=Speed_Right_Wheel_1510)")))))
Formula 0 simplified : !XXX"(P4<=Speed_Right_Wheel_1510)"
Detected timeout of ITS tools.
[2022-05-16 00:12:10] [INFO ] Flatten gal took : 1023 ms
[2022-05-16 00:12:10] [INFO ] Applying decomposition
[2022-05-16 00:12:11] [INFO ] Flatten gal took : 887 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/graph13410824450819819627.txt' '-o' '/tmp/graph13410824450819819627.bin' '-w' '/tmp/graph13410824450819819627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13410824450819819627.bin' '-l' '-1' '-v' '-w' '/tmp/graph13410824450819819627.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:12:14] [INFO ] Decomposing Gal with order
[2022-05-16 00:12:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:13:17] [INFO ] Removed a total of 15997 redundant transitions.
[2022-05-16 00:13:19] [INFO ] Flatten gal took : 62755 ms
[2022-05-16 00:13:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 15999 labels/synchronizations in 2362 ms.
[2022-05-16 00:13:23] [INFO ] Time to serialize gal into /tmp/LTL5177985657913305459.gal : 84 ms
[2022-05-16 00:13:23] [INFO ] Time to serialize properties into /tmp/LTL13485805696509790845.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/LTL5177985657913305459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13485805696509790845.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/LTL5177985...267
Read 1 LTL properties
Checking formula 0 : !((X(X(X("(gu2.P4<=gu2.Speed_Right_Wheel_1510)")))))
Formula 0 simplified : !XXX"(gu2.P4<=gu2.Speed_Right_Wheel_1510)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18445841705137215310
[2022-05-16 00:13:39] [INFO ] Built C files in 416ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18445841705137215310
Running compilation step : cd /tmp/ltsmin18445841705137215310;'/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/ltsmin18445841705137215310;'/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/ltsmin18445841705137215310;'/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 AirplaneLD-PT-4000-LTLCardinality-09 finished in 392090 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(p0)))))'
Support contains 2 out of 16017 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Graph (complete) has 42023 edges and 16017 vertex of which 16014 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.67 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 287 ms. Remains 16014 /16017 variables (removed 3) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:14:04] [INFO ] Computed 1 place invariants in 22078 ms
[2022-05-16 00:14:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:14:05] [INFO ] Implicit Places using invariants in 23130 ms returned []
Implicit Place search using SMT only with invariants took 23131 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:14:27] [INFO ] Computed 1 place invariants in 21915 ms
[2022-05-16 00:14:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:14:28] [INFO ] Dead Transitions using invariants and state equation in 23026 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16014/16017 places, 32008/32008 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16017 places, 32008/32008 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-4000-LTLCardinality-10 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 s4108 s13588)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 15 ms.
FORMULA AirplaneLD-PT-4000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-4000-LTLCardinality-10 finished in 46577 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(G(p0)))||X(G(p1))||p2))))'
Support contains 4 out of 16017 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16017/16017 places, 32008/32008 transitions.
Graph (complete) has 42023 edges and 16017 vertex of which 16014 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.83 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 298 ms. Remains 16014 /16017 variables (removed 3) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:15:02] [INFO ] Computed 1 place invariants in 33013 ms
[2022-05-16 00:15:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:15:04] [INFO ] Implicit Places using invariants in 34885 ms returned []
Implicit Place search using SMT only with invariants took 34886 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:15:31] [INFO ] Computed 1 place invariants in 27307 ms
[2022-05-16 00:15:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:15:33] [INFO ] Dead Transitions using invariants and state equation in 29452 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16014/16017 places, 32008/32008 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16017 places, 32008/32008 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-4000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s16008), p1:(GT s16009 s8660), p2:(LEQ 1 s16010)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 3310 steps with 416 reset in 10004 ms.
Product exploration timeout after 4350 steps with 548 reset in 10009 ms.
Computed a total of 16014 stabilizing places and 32008 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16014 transition count 32008
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 393 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 21390 ms. (steps per millisecond=0 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:17:00] [INFO ] Computed 1 place invariants in 22847 ms
[2022-05-16 00:17:02] [INFO ] After 2161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 00:17:04] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 00:17:27] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 16014 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16014/16014 places, 32008/32008 transitions.
Graph (complete) has 22012 edges and 16014 vertex of which 12014 are kept as prefixes of interest. Removing 4000 places using SCC suffix rule.24 ms
Discarding 4000 places :
Also discarding 0 output transitions
Drop transitions removed 8000 transitions
Reduce isomorphic transitions removed 8000 transitions.
Iterating post reduction 0 with 8000 rules applied. Total rules applied 8001 place count 12014 transition count 24008
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8001 place count 12014 transition count 24006
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 8005 place count 12012 transition count 24006
Free-agglomeration rule applied 12001 times.
Iterating global reduction 1 with 12001 rules applied. Total rules applied 20006 place count 12012 transition count 12005
Reduce places removed 12001 places and 0 transitions.
Ensure Unique test removed 11997 transitions
Reduce isomorphic transitions removed 11997 transitions.
Iterating post reduction 1 with 23998 rules applied. Total rules applied 44004 place count 11 transition count 8
Applied a total of 44004 rules in 6378 ms. Remains 11 /16014 variables (removed 16003) and now considering 8/32008 (removed 32000) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/16014 places, 8/32008 transitions.
Incomplete random walk after 10000 steps, including 1975 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 958 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1111 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 935 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Probably explored full state space saw : 11 states, properties seen :0
Probabilistic random walk after 23 steps, saw 11 distinct states, run finished after 8 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 11 states, properties seen :0
Exhaustive walk after 23 steps, saw 11 distinct states, run finished after 2 ms. (steps per millisecond=11 ) properties seen :0
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) p2 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p2) p1)), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 14 factoid took 715 ms. Reduced automaton from 1 states, 8 edges and 3 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 16014 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 16014/16014 places, 32008/32008 transitions.
Applied a total of 0 rules in 165 ms. Remains 16014 /16014 variables (removed 0) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:17:59] [INFO ] Computed 1 place invariants in 23838 ms
[2022-05-16 00:18:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:18:00] [INFO ] Implicit Places using invariants in 24981 ms returned []
Implicit Place search using SMT only with invariants took 24982 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:18:23] [INFO ] Computed 1 place invariants in 22989 ms
[2022-05-16 00:18:24] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:18:24] [INFO ] Dead Transitions using invariants and state equation in 24134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16014 places, 32008/32008 transitions.
Computed a total of 16014 stabilizing places and 32008 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16014 transition count 32008
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 1 resets, run visited all 2 properties in 40 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 22 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Product exploration timeout after 4310 steps with 543 reset in 10004 ms.
Product exploration timeout after 4390 steps with 550 reset in 10003 ms.
Built C files in :
/tmp/ltsmin9000574609720102208
[2022-05-16 00:19:15] [INFO ] Too many transitions (32008) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:19:15] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9000574609720102208
Running compilation step : cd /tmp/ltsmin9000574609720102208;'/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/ltsmin9000574609720102208;'/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/ltsmin9000574609720102208;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 16014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16014/16014 places, 32008/32008 transitions.
Applied a total of 0 rules in 261 ms. Remains 16014 /16014 variables (removed 0) and now considering 32008/32008 (removed 0) transitions.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:19:48] [INFO ] Computed 1 place invariants in 29628 ms
[2022-05-16 00:19:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:19:49] [INFO ] Implicit Places using invariants in 31175 ms returned []
Implicit Place search using SMT only with invariants took 31182 ms to find 0 implicit places.
// Phase 1: matrix 32008 rows 16014 cols
[2022-05-16 00:20:20] [INFO ] Computed 1 place invariants in 30516 ms
[2022-05-16 00:20:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 00:20:22] [INFO ] Dead Transitions using invariants and state equation in 32252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16014/16014 places, 32008/32008 transitions.
Built C files in :
/tmp/ltsmin13735476069695145366
[2022-05-16 00:20:22] [INFO ] Too many transitions (32008) to apply POR reductions. Disabling POR matrices.
[2022-05-16 00:20:22] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13735476069695145366
Running compilation step : cd /tmp/ltsmin13735476069695145366;'/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/ltsmin13735476069695145366;'/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/ltsmin13735476069695145366;'/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-16 00:20:27] [INFO ] Flatten gal took : 895 ms
[2022-05-16 00:20:29] [INFO ] Flatten gal took : 1420 ms
[2022-05-16 00:20:29] [INFO ] Time to serialize gal into /tmp/LTL8154155689612965255.gal : 140 ms
[2022-05-16 00:20:29] [INFO ] Time to serialize properties into /tmp/LTL14973406668740346571.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/LTL8154155689612965255.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14973406668740346571.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/LTL8154155...267
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-16 00:20:46] [INFO ] Flatten gal took : 1194 ms
[2022-05-16 00:20:46] [INFO ] Applying decomposition
[2022-05-16 00:20:47] [INFO ] Flatten gal took : 1097 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/graph3098208546741166549.txt' '-o' '/tmp/graph3098208546741166549.bin' '-w' '/tmp/graph3098208546741166549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3098208546741166549.bin' '-l' '-1' '-v' '-w' '/tmp/graph3098208546741166549.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:20:50] [INFO ] Decomposing Gal with order
[2022-05-16 00:20:51] [INFO ] Rewriting arrays to variables to allow decomposition.
BK_STOP 1652660500510
--------------------
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="AirplaneLD-PT-4000"
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 AirplaneLD-PT-4000, 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 r006-tajo-165245689100307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-4000.tgz
mv AirplaneLD-PT-4000 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 '
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 ;