About the Execution of ITS-Tools for Philosophers-COL-002000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10045.623 | 891141.00 | 1524541.00 | 4326.20 | FTFT?TT?T?F?T??? | normal |
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.r168-tall-165277016400243.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 Philosophers-COL-002000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016400243
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 96K 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 Philosophers-COL-002000-LTLCardinality-00
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-01
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-02
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-03
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-04
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-05
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-06
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-07
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-08
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-09
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-10
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-11
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-12
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-13
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-14
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652808933791
Running Version 202205111006
[2022-05-17 17:35:34] [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 17:35:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 17:35:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 17:35:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 17:35:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 613 ms
[2022-05-17 17:35:35] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 10000 PT places and 10000.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 17:35:35] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 9 ms.
[2022-05-17 17:35:35] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-COL-002000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10009 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 19) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 17:35:36] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-17 17:35:36] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-05-17 17:35:36] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 17:35:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 17:35:36] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-17 17:35:36] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 17:35:36] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2003 steps, including 0 resets, run visited all 2 properties in 27 ms. (steps per millisecond=74 )
Parikh walk visited 2 properties in 28 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Philosophers-COL-002000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 17:35:36] [INFO ] Flatten gal took : 15 ms
[2022-05-17 17:35:36] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 2000) 2000) 2000)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 17:35:36] [INFO ] Unfolded HLPN to a Petri net with 10000 places and 10000 transitions 32000 arcs in 127 ms.
[2022-05-17 17:35:36] [INFO ] Unfolded 10 HLPN properties in 11 ms.
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 96 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:35:37] [INFO ] Computed 4000 place invariants in 69 ms
[2022-05-17 17:35:38] [INFO ] Implicit Places using invariants in 1166 ms returned []
Implicit Place search using SMT only with invariants took 1169 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:35:38] [INFO ] Computed 4000 place invariants in 30 ms
[2022-05-17 17:35:39] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 10000 out of 10000 places after structural reductions.
[2022-05-17 17:35:40] [INFO ] Flatten gal took : 612 ms
[2022-05-17 17:35:41] [INFO ] Flatten gal took : 413 ms
[2022-05-17 17:35:42] [INFO ] Input system was already deterministic with 10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10280 ms. (steps per millisecond=0 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2545 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3888 ms. (steps per millisecond=2 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1537 ms. (steps per millisecond=6 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1737 ms. (steps per millisecond=5 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1344 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1601 ms. (steps per millisecond=6 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2008 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:36:07] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 17:36:13] [INFO ] After 2040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-17 17:36:16] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1348 ms returned sat
[2022-05-17 17:36:38] [INFO ] After 3759ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2022-05-17 17:36:38] [INFO ] After 3777ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 17:36:38] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 633 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7388 ms. (steps per millisecond=1 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1628 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1809 ms. (steps per millisecond=5 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1424 ms. (steps per millisecond=7 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1595 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1998 ms. (steps per millisecond=5 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 163803 steps, run timeout after 45085 ms. (steps per millisecond=3 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 163803 steps, saw 163713 distinct states, run finished after 45086 ms. (steps per millisecond=3 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:37:40] [INFO ] Computed 4000 place invariants in 57 ms
[2022-05-17 17:37:43] [INFO ] [Real]Absence check using 4000 positive place invariants in 1289 ms returned sat
[2022-05-17 17:37:46] [INFO ] After 5548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 17:37:49] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1351 ms returned sat
[2022-05-17 17:38:03] [INFO ] After 11485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 17:38:05] [INFO ] After 13934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1048 ms.
[2022-05-17 17:38:06] [INFO ] After 20017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 3 properties in 1053 ms. (steps per millisecond=1 )
Parikh walk visited 3 properties in 1059 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
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' '!(X((F(G(p1))&&p0)))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 569 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:38:08] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:38:09] [INFO ] Implicit Places using invariants in 942 ms returned []
Implicit Place search using SMT only with invariants took 944 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:38:09] [INFO ] Computed 4000 place invariants in 27 ms
[2022-05-17 17:38:10] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GT (ADD s8000 s8001 s8002 s8003 s8004 s8005 s8006 s8007 s8008 s8009 s8010 s8011 s8012 s8013 s8014 s8015 s8016 s8017 s8018 s8019 s8020 s8021 s8022...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 8 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-00 finished in 2757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 666 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:38:11] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 17:38:12] [INFO ] Implicit Places using invariants in 936 ms returned []
Implicit Place search using SMT only with invariants took 938 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:38:12] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:38:13] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s402...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-02 finished in 2631 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(p0)) U p1))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 291 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:38:13] [INFO ] Computed 4000 place invariants in 28 ms
[2022-05-17 17:38:14] [INFO ] Implicit Places using invariants in 913 ms returned []
Implicit Place search using SMT only with invariants took 919 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:38:14] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:38:15] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 (ADD s0 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 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 68990 steps with 0 reset in 10001 ms.
Product exploration timeout after 65850 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 p1 (NOT p0)), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5173 ms. (steps per millisecond=1 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1528 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:38:43] [INFO ] Computed 4000 place invariants in 31 ms
[2022-05-17 17:38:45] [INFO ] [Real]Absence check using 4000 positive place invariants in 1277 ms returned sat
[2022-05-17 17:38:46] [INFO ] After 3370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 17:38:49] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1289 ms returned sat
[2022-05-17 17:39:00] [INFO ] After 9997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 17:39:00] [INFO ] After 10656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 329 ms.
[2022-05-17 17:39:01] [INFO ] After 14318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 1 properties in 683 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 686 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 294 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:39:02] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 17:39:03] [INFO ] Implicit Places using invariants in 886 ms returned []
Implicit Place search using SMT only with invariants took 887 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:39:03] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 17:39:04] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 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 p1 (NOT p0)), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5125 ms. (steps per millisecond=1 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1552 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:39:11] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 17:39:14] [INFO ] [Real]Absence check using 4000 positive place invariants in 1291 ms returned sat
[2022-05-17 17:39:15] [INFO ] After 3387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 17:39:17] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1292 ms returned sat
[2022-05-17 17:39:29] [INFO ] After 10409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 17:39:29] [INFO ] After 11105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 372 ms.
[2022-05-17 17:39:30] [INFO ] After 14749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 1 properties in 692 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 695 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Product exploration timeout after 69580 steps with 0 reset in 10001 ms.
Product exploration timeout after 60880 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 544 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:39:52] [INFO ] Computed 4000 place invariants in 16 ms
[2022-05-17 17:39:53] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Product exploration timeout after 69690 steps with 0 reset in 10001 ms.
Product exploration timeout after 61940 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin17834378544087487659
[2022-05-17 17:40:13] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17834378544087487659
Running compilation step : cd /tmp/ltsmin17834378544087487659;'/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/ltsmin17834378544087487659;'/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/ltsmin17834378544087487659;'/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 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 292 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:40:16] [INFO ] Computed 4000 place invariants in 26 ms
[2022-05-17 17:40:17] [INFO ] Implicit Places using invariants in 932 ms returned []
Implicit Place search using SMT only with invariants took 937 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:40:17] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 17:40:18] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin7337060679209424972
[2022-05-17 17:40:18] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7337060679209424972
Running compilation step : cd /tmp/ltsmin7337060679209424972;'/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/ltsmin7337060679209424972;'/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/ltsmin7337060679209424972;'/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 17:40:23] [INFO ] Flatten gal took : 331 ms
[2022-05-17 17:40:23] [INFO ] Flatten gal took : 357 ms
[2022-05-17 17:40:24] [INFO ] Time to serialize gal into /tmp/LTL10076198522390018954.gal : 123 ms
[2022-05-17 17:40:24] [INFO ] Time to serialize properties into /tmp/LTL5589485689338753530.ltl : 53 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/LTL10076198522390018954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5589485689338753530.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/LTL1007619...267
Read 1 LTL properties
Checking formula 0 : !((G(X((X(X("(((((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Thi...93613
Formula 0 simplified : !GX(XX"(((((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_1...93603
Detected timeout of ITS tools.
[2022-05-17 17:40:39] [INFO ] Flatten gal took : 341 ms
[2022-05-17 17:40:39] [INFO ] Applying decomposition
[2022-05-17 17:40:39] [INFO ] Flatten gal took : 328 ms
[2022-05-17 17:41:00] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12165357426338320618.txt' '-o' '/tmp/graph12165357426338320618.bin' '-w' '/tmp/graph12165357426338320618.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:654)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 17:41:00] [INFO ] Flatten gal took : 310 ms
[2022-05-17 17:41:01] [INFO ] Time to serialize gal into /tmp/LTL15036240954340673243.gal : 100 ms
[2022-05-17 17:41:01] [INFO ] Time to serialize properties into /tmp/LTL3592317794275708377.ltl : 6 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/LTL15036240954340673243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3592317794275708377.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/LTL1503624...267
Read 1 LTL properties
Checking formula 0 : !((G(X((X(X("(((((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Thi...93613
Formula 0 simplified : !GX(XX"(((((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_1...93603
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14942027823496805151
[2022-05-17 17:41:16] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14942027823496805151
Running compilation step : cd /tmp/ltsmin14942027823496805151;'/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/ltsmin14942027823496805151;'/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/ltsmin14942027823496805151;'/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 Philosophers-COL-002000-LTLCardinality-04 finished in 185772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(G(p0) U X(p1)))||X(p2)))'
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 96 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:41:19] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 17:41:20] [INFO ] Implicit Places using invariants in 840 ms returned []
Implicit Place search using SMT only with invariants took 841 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:41:20] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 17:41:21] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 482 ms :[true, p1, p0, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, (AND p0 p1)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ 2 (ADD s8000 s8001 s8002 s8003 s8004 s8005 s8006 s8007 s8008 s8009 s8010 s8011 s8012 s8013 s8014 s8015 s8016 s8017 s8018 s8019 s8020 s8021 s8022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 19340 steps with 9670 reset in 10004 ms.
Product exploration timeout after 19220 steps with 9610 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 (NOT p1) p0 p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0)))
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-COL-002000-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-002000-LTLCardinality-05 finished in 23848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||p1)) U p2)))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 266 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:41:43] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 17:41:44] [INFO ] Implicit Places using invariants in 853 ms returned []
Implicit Place search using SMT only with invariants took 854 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:41:44] [INFO ] Computed 4000 place invariants in 15 ms
[2022-05-17 17:41:45] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 2 (ADD s6000 s6001 s6002 s6003 s6004 s6005 s6006 s6007 s6008 s6009 s6010 s6011 s6012 s6013 s6014 s6015 s6016 s6017 s6018 s6019 s6020 s6021 s6022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 38090 steps with 11 reset in 10008 ms.
Product exploration timeout after 36150 steps with 2 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 (NOT p2) p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5411 ms. (steps per millisecond=1 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2393 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3023 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:42:18] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 17:42:20] [INFO ] After 1257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 17:42:23] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1326 ms returned sat
[2022-05-17 17:42:45] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 301 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5063 ms. (steps per millisecond=1 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2342 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2925 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Probabilistic random walk after 120870 steps, saw 120807 distinct states, run finished after 30016 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:43:26] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 17:43:29] [INFO ] After 1316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 17:43:31] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1379 ms returned sat
[2022-05-17 17:43:54] [INFO ] After 17818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 17:43:54] [INFO ] After 17834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 17:43:54] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 370 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 296 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:43:55] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 17:43:56] [INFO ] Implicit Places using invariants in 935 ms returned []
Implicit Place search using SMT only with invariants took 936 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:43:56] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 17:43:57] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:43:58] [INFO ] Computed 4000 place invariants in 19 ms
Could not prove EG (NOT p2)
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 250 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:44:13] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 17:44:14] [INFO ] Implicit Places using invariants in 937 ms returned []
Implicit Place search using SMT only with invariants took 938 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:44:14] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 17:44:15] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 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 p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6774 ms. (steps per millisecond=1 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2877 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3486 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:44:32] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 17:44:34] [INFO ] After 1339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 17:44:37] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1417 ms returned sat
[2022-05-17 17:44:59] [INFO ] After 15460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 17:44:59] [INFO ] After 15463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 17:44:59] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 279 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5965 ms. (steps per millisecond=1 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2938 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3538 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 123865 steps, run timeout after 36111 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 123865 steps, saw 123799 distinct states, run finished after 36112 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:45:48] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 17:45:51] [INFO ] After 1232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 17:45:53] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1305 ms returned sat
[2022-05-17 17:46:16] [INFO ] After 15708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 17:46:16] [INFO ] After 15716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 17:46:16] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 272 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 298 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:46:16] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 17:46:17] [INFO ] Implicit Places using invariants in 978 ms returned []
Implicit Place search using SMT only with invariants took 981 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:46:17] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 17:46:18] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p2)]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:46:20] [INFO ] Computed 4000 place invariants in 22 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Product exploration timeout after 19320 steps with 1 reset in 10002 ms.
Product exploration timeout after 19320 steps with 2 reset in 10002 ms.
Built C files in :
/tmp/ltsmin11236227586506973966
[2022-05-17 17:46:55] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 17:46:55] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11236227586506973966
Running compilation step : cd /tmp/ltsmin11236227586506973966;'/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/ltsmin11236227586506973966;'/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/ltsmin11236227586506973966;'/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 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 263 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:46:58] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 17:46:59] [INFO ] Implicit Places using invariants in 907 ms returned []
Implicit Place search using SMT only with invariants took 908 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:46:59] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 17:47:00] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin1022059792276855184
[2022-05-17 17:47:00] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 17:47:00] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1022059792276855184
Running compilation step : cd /tmp/ltsmin1022059792276855184;'/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/ltsmin1022059792276855184;'/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/ltsmin1022059792276855184;'/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 17:47:04] [INFO ] Flatten gal took : 354 ms
[2022-05-17 17:47:04] [INFO ] Flatten gal took : 322 ms
[2022-05-17 17:47:04] [INFO ] Time to serialize gal into /tmp/LTL10129529693868864667.gal : 37 ms
[2022-05-17 17:47:04] [INFO ] Time to serialize properties into /tmp/LTL7133215578341683485.ltl : 4 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/LTL10129529693868864667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7133215578341683485.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/LTL1012952...267
Read 1 LTL properties
Checking formula 0 : !((G((F((G("((((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think...103614
Formula 0 simplified : !G(F("((((((((((((Catch1_0+Catch1_1)+(Catch1_2+Catch1_3))+((Catch1_4+Catch1_5)+(Catch1_6+Catch1_7)))+(((Catch1_8+Catch1_9)+(Catch1_1...103605
Detected timeout of ITS tools.
[2022-05-17 17:47:20] [INFO ] Flatten gal took : 289 ms
[2022-05-17 17:47:20] [INFO ] Applying decomposition
[2022-05-17 17:47:20] [INFO ] Flatten gal took : 374 ms
[2022-05-17 17:47:40] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1954980747828544724.txt' '-o' '/tmp/graph1954980747828544724.bin' '-w' '/tmp/graph1954980747828544724.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:654)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 17:47:40] [INFO ] Flatten gal took : 289 ms
[2022-05-17 17:47:40] [INFO ] Time to serialize gal into /tmp/LTL16300975224742410096.gal : 34 ms
[2022-05-17 17:47:40] [INFO ] Time to serialize properties into /tmp/LTL18172781928180450984.ltl : 4 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/LTL16300975224742410096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18172781928180450984.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/LTL1630097...268
Read 1 LTL properties
Checking formula 0 : !((G((F((G("((((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think...103614
Formula 0 simplified : !G(F("((((((((((((Catch1_0+Catch1_1)+(Catch1_2+Catch1_3))+((Catch1_4+Catch1_5)+(Catch1_6+Catch1_7)))+(((Catch1_8+Catch1_9)+(Catch1_1...103605
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15469051069905832513
[2022-05-17 17:47:55] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15469051069905832513
Running compilation step : cd /tmp/ltsmin15469051069905832513;'/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/ltsmin15469051069905832513;'/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/ltsmin15469051069905832513;'/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 Philosophers-COL-002000-LTLCardinality-07 finished in 375982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(!G(p0)))) U F((p1&&X(p0)))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 282 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:47:59] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:48:00] [INFO ] Implicit Places using invariants in 795 ms returned []
Implicit Place search using SMT only with invariants took 796 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:48:00] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 17:48:00] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s0 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 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 14670 steps with 0 reset in 10006 ms.
Product exploration timeout after 14340 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 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3146 steps, including 0 resets, run visited all 3 properties in 2418 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:48:30] [INFO ] Computed 4000 place invariants in 26 ms
Could not prove EG (NOT p1)
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 225 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:48:45] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 17:48:46] [INFO ] Implicit Places using invariants in 925 ms returned []
Implicit Place search using SMT only with invariants took 926 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:48:46] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:48:47] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3016 steps, including 0 resets, run visited all 3 properties in 2302 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:48:56] [INFO ] Computed 4000 place invariants in 24 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration timeout after 12210 steps with 0 reset in 10002 ms.
Product exploration timeout after 11910 steps with 0 reset in 10007 ms.
Built C files in :
/tmp/ltsmin1974597951186064403
[2022-05-17 17:49:32] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1974597951186064403
Running compilation step : cd /tmp/ltsmin1974597951186064403;'/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/ltsmin1974597951186064403;'/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/ltsmin1974597951186064403;'/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 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 220 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:49:35] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 17:49:36] [INFO ] Implicit Places using invariants in 1050 ms returned []
Implicit Place search using SMT only with invariants took 1051 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 17:49:36] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 17:49:37] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin2746343713652376759
[2022-05-17 17:49:37] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2746343713652376759
Running compilation step : cd /tmp/ltsmin2746343713652376759;'/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/ltsmin2746343713652376759;'/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/ltsmin2746343713652376759;'/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 17:49:41] [INFO ] Flatten gal took : 272 ms
[2022-05-17 17:49:41] [INFO ] Flatten gal took : 319 ms
[2022-05-17 17:49:41] [INFO ] Time to serialize gal into /tmp/LTL13551879045866465911.gal : 25 ms
[2022-05-17 17:49:41] [INFO ] Time to serialize properties into /tmp/LTL10245760650450155450.ltl : 6 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/LTL13551879045866465911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10245760650450155450.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/LTL1355187...268
Read 1 LTL properties
Checking formula 0 : !(((G(X(X(!(G("((((((((((((Catch2_0+Catch2_1)+(Catch2_2+Catch2_3))+((Catch2_4+Catch2_5)+(Catch2_6+Catch2_7)))+(((Catch2_8+Catch2_9)+(C...147398
Formula 0 simplified : !(GXX!G"((((((((((((Catch2_0+Catch2_1)+(Catch2_2+Catch2_3))+((Catch2_4+Catch2_5)+(Catch2_6+Catch2_7)))+(((Catch2_8+Catch2_9)+(Catch2...147381
Detected timeout of ITS tools.
[2022-05-17 17:49:56] [INFO ] Flatten gal took : 281 ms
[2022-05-17 17:49:56] [INFO ] Applying decomposition
[2022-05-17 17:49:57] [INFO ] Flatten gal took : 283 ms
[2022-05-17 17:50:24] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4620445946979027828.txt' '-o' '/tmp/graph4620445946979027828.bin' '-w' '/tmp/graph4620445946979027828.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:654)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 17:50:24] [INFO ] Flatten gal took : 281 ms
java.io.IOException: Stream Closed
at java.base/java.io.FileOutputStream.writeBytes(Native Method)
at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354)
at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81)
at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142)
at fr.lip6.move.serialization.SerializationUtil.systemToFile(SerializationUtil.java:98)
at fr.lip6.move.gal.application.runner.its.ITSRunner.outputGalFile(ITSRunner.java:406)
at fr.lip6.move.gal.application.runner.its.ITSRunner.configure(ITSRunner.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:660)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 17:50:24] [INFO ] Time to serialize gal into /tmp/LTL6342321763133874419.gal : 31 ms
ITS runner failed with exception No space left on device
java.io.IOException: No space left on device
at java.base/java.io.FileOutputStream.writeBytes(Native Method)
at java.base/java.io.FileOutputStream.write(FileOutputStream.java:341)
at fr.lip6.move.serialization.SerializationUtil.serializePropertiesForITSLTLTools(SerializationUtil.java:227)
at fr.lip6.move.gal.application.runner.its.ITSRunner.outputPropertyFile(ITSRunner.java:345)
at fr.lip6.move.gal.application.runner.its.ITSRunner.configure(ITSRunner.java:97)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:660)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Unable to create temporary folder.
Built C files in :
null
WARNING : LTS min runner thread failed on error :java.lang.NullPointerException
java.lang.NullPointerException
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:86)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-COL-002000-LTLCardinality-09 finished in 145779 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U !(F(p1)||G((!p2 U p3)))))'
Spot run failed in 19 ms. Status :2
Application raised an uncaught exception null
java.lang.NullPointerException
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.reduceForProperty(LTLPropertySolver.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:316)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Total runtime 889882 ms.
BK_STOP 1652809824932
--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="Philosophers-COL-002000"
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 Philosophers-COL-002000, 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 r168-tall-165277016400243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-002000.tgz
mv Philosophers-COL-002000 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 ;