fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016700427
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PhilosophersDyn-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16213.264 3293779.00 9818726.00 65300.10 TTFFTFTTFTFTFFFF 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-165277016700427.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 PhilosophersDyn-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016700427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 136K Apr 30 08:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 529K Apr 30 08:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 30 08:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.7M Apr 30 08:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M 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 PhilosophersDyn-PT-20-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652844668858

Running Version 202205111006
[2022-05-18 03:31:10] [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-18 03:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 03:31:10] [INFO ] Load time of PNML (sax parser for PT used): 720 ms
[2022-05-18 03:31:10] [INFO ] Transformed 540 places.
[2022-05-18 03:31:11] [INFO ] Transformed 17220 transitions.
[2022-05-18 03:31:11] [INFO ] Parsed PT model containing 540 places and 17220 transitions in 977 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 524 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 166 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2022-05-18 03:31:11] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2022-05-18 03:31:12] [INFO ] Computed 79 place invariants in 1262 ms
[2022-05-18 03:31:21] [INFO ] Dead Transitions using invariants and state equation in 9878 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:31:23] [INFO ] Computed 79 place invariants in 1990 ms
[2022-05-18 03:31:23] [INFO ] Implicit Places using invariants in 2148 ms returned []
Implicit Place search using SMT only with invariants took 2149 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 76 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/17030 transitions.
Support contains 524 out of 540 places after structural reductions.
[2022-05-18 03:31:24] [INFO ] Flatten gal took : 1065 ms
[2022-05-18 03:31:25] [INFO ] Flatten gal took : 869 ms
[2022-05-18 03:31:27] [INFO ] Input system was already deterministic with 15470 transitions.
Incomplete random walk after 10000 steps, including 1148 resets, run finished after 974 ms. (steps per millisecond=10 ) properties (out of 23) seen :18
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:31:30] [INFO ] Computed 79 place invariants in 1897 ms
[2022-05-18 03:31:30] [INFO ] [Real]Absence check using 27 positive place invariants in 16 ms returned sat
[2022-05-18 03:31:31] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 45 ms returned sat
[2022-05-18 03:31:46] [INFO ] After 15012ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2
[2022-05-18 03:31:46] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2022-05-18 03:31:55] [INFO ] After 9464ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :3 sat :0
[2022-05-18 03:31:55] [INFO ] After 25049ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 93 ms.
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3810 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:32:01] [INFO ] Computed 79 place invariants in 1841 ms
[2022-05-18 03:32:09] [INFO ] Dead Transitions using invariants and state equation in 9747 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1143 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 20758 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 20758 steps, saw 6047 distinct states, run finished after 3002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:32:15] [INFO ] Computed 79 place invariants in 1842 ms
[2022-05-18 03:32:15] [INFO ] [Real]Absence check using 27 positive place invariants in 25 ms returned sat
[2022-05-18 03:32:15] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 123 ms returned sat
[2022-05-18 03:32:23] [INFO ] After 8481ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-18 03:32:24] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2022-05-18 03:32:40] [INFO ] After 16091ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2022-05-18 03:32:40] [INFO ] After 25048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3500 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3284 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:32:49] [INFO ] Computed 79 place invariants in 2016 ms
[2022-05-18 03:32:50] [INFO ] Implicit Places using invariants in 3755 ms returned []
Implicit Place search using SMT only with invariants took 3757 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:32:52] [INFO ] Computed 79 place invariants in 1895 ms
[2022-05-18 03:33:00] [INFO ] Dead Transitions using invariants and state equation in 9660 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1137 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:33:03] [INFO ] Computed 79 place invariants in 1847 ms
[2022-05-18 03:33:03] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned sat
[2022-05-18 03:33:03] [INFO ] [Real]Absence check using 27 positive and 52 generalized place invariants in 45 ms returned sat
[2022-05-18 03:33:12] [INFO ] After 9003ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-18 03:33:13] [INFO ] After 10022ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 598 ms.
[2022-05-18 03:33:14] [INFO ] After 10771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
FORMULA PhilosophersDyn-PT-20-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)||F(X(p1))))))'
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 217 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:33:16] [INFO ] Computed 79 place invariants in 1865 ms
[2022-05-18 03:33:24] [INFO ] Dead Transitions using invariants and state equation in 9557 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:33:26] [INFO ] Computed 79 place invariants in 1792 ms
[2022-05-18 03:33:28] [INFO ] Implicit Places using invariants in 4363 ms returned []
Implicit Place search using SMT only with invariants took 4377 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:33:30] [INFO ] Computed 79 place invariants in 1783 ms
[2022-05-18 03:33:38] [INFO ] Dead Transitions using invariants and state equation in 9209 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 (ADD s33 s58 s94 s119 s121 s160 s173 s177 s258 s268 s291 s323 s379 s429 s439 s451 s464 s475 s489 s497)), p1:(LEQ (ADD s35 s51 s64 s113 s151 s182 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 78670 steps with 39335 reset in 10001 ms.
Product exploration timeout after 80690 steps with 40345 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-01 finished in 43955 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((G(F(G(p0)))&&F(X(p1)))))))'
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 223 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:34:00] [INFO ] Computed 79 place invariants in 1896 ms
[2022-05-18 03:34:08] [INFO ] Dead Transitions using invariants and state equation in 9452 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:34:10] [INFO ] Computed 79 place invariants in 1780 ms
[2022-05-18 03:34:13] [INFO ] Implicit Places using invariants in 4801 ms returned []
Implicit Place search using SMT only with invariants took 4806 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:34:15] [INFO ] Computed 79 place invariants in 1781 ms
[2022-05-18 03:34:22] [INFO ] Dead Transitions using invariants and state equation in 9337 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 3 (ADD s4 s46 s76 s97 s150 s159 s170 s184 s218 s261 s275 s308 s319 s325 s353 s362 s394 s462 s520 s523)), p0:(GT (ADD s0 s25 s44 s57 s87 s102 s129 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-02 finished in 24147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 6332 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:34:31] [INFO ] Computed 79 place invariants in 1811 ms
[2022-05-18 03:34:38] [INFO ] Dead Transitions using invariants and state equation in 9609 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:34:40] [INFO ] Computed 79 place invariants in 1877 ms
[2022-05-18 03:34:43] [INFO ] Implicit Places using invariants in 4400 ms returned []
Implicit Place search using SMT only with invariants took 4401 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:34:45] [INFO ] Computed 79 place invariants in 1814 ms
[2022-05-18 03:34:52] [INFO ] Dead Transitions using invariants and state equation in 9310 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 (ADD s0 s25 s44 s57 s87 s102 s129 s137 s187 s250 s295 s339 s340 s356 s390 s447 s461 s477 s482 s496)), p0:(LEQ (ADD s31 s47 s56 s71 s126 s138 s140...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-03 finished in 29799 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((G(!G(!p0))&&p1))) U p2))'
Support contains 80 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 5115 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:34:59] [INFO ] Computed 79 place invariants in 1877 ms
[2022-05-18 03:35:06] [INFO ] Dead Transitions using invariants and state equation in 9028 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:35:08] [INFO ] Computed 79 place invariants in 1795 ms
[2022-05-18 03:35:10] [INFO ] Implicit Places using invariants in 3554 ms returned []
Implicit Place search using SMT only with invariants took 3556 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:35:12] [INFO ] Computed 79 place invariants in 1824 ms
[2022-05-18 03:35:19] [INFO ] Dead Transitions using invariants and state equation in 9065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ (ADD s42 s72 s154 s156 s192 s212 s214 s263 s286 s304 s307 s348 s371 s372 s373 s403 s427 s443 s505 s508) (ADD s4 s46 s76 s97 s150 s159 s170 s184 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-05 finished in 26976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 66 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:35:21] [INFO ] Computed 79 place invariants in 1759 ms
[2022-05-18 03:35:29] [INFO ] Dead Transitions using invariants and state equation in 9337 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:35:30] [INFO ] Computed 79 place invariants in 1878 ms
[2022-05-18 03:35:32] [INFO ] Implicit Places using invariants in 3341 ms returned []
Implicit Place search using SMT only with invariants took 3342 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:35:34] [INFO ] Computed 79 place invariants in 1805 ms
[2022-05-18 03:35:42] [INFO ] Dead Transitions using invariants and state equation in 9596 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-06 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:(LEQ 1 (ADD s1 s2 s3 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s26 s27 s28 s30 s32 s36 s37 s38 s39 s40 s41 s43 s45 s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11447 reset in 5962 ms.
Product exploration explored 100000 steps with 11444 reset in 5958 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 : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:35:57] [INFO ] Computed 79 place invariants in 1858 ms
Could not prove EG (NOT p0)
Support contains 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 94 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:36:14] [INFO ] Computed 79 place invariants in 1862 ms
[2022-05-18 03:36:22] [INFO ] Dead Transitions using invariants and state equation in 9067 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:36:23] [INFO ] Computed 79 place invariants in 1825 ms
[2022-05-18 03:36:25] [INFO ] Implicit Places using invariants in 3300 ms returned []
Implicit Place search using SMT only with invariants took 3319 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:36:27] [INFO ] Computed 79 place invariants in 1797 ms
[2022-05-18 03:36:34] [INFO ] Dead Transitions using invariants and state equation in 9137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 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 : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:36:38] [INFO ] Computed 79 place invariants in 1893 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11452 reset in 5721 ms.
Product exploration explored 100000 steps with 11450 reset in 5699 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Support contains 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 4616 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:37:11] [INFO ] Computed 79 place invariants in 1817 ms
[2022-05-18 03:37:19] [INFO ] Dead Transitions using invariants and state equation in 9737 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:37:21] [INFO ] Computed 79 place invariants in 1796 ms
[2022-05-18 03:37:28] [INFO ] Dead Transitions using invariants and state equation in 9324 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Product exploration timeout after 99780 steps with 11417 reset in 10001 ms.
Product exploration explored 100000 steps with 11432 reset in 9965 ms.
Built C files in :
/tmp/ltsmin7361047176485780563
[2022-05-18 03:37:49] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7361047176485780563
Running compilation step : cd /tmp/ltsmin7361047176485780563;'/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/ltsmin7361047176485780563;'/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/ltsmin7361047176485780563;'/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 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 71 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:37:53] [INFO ] Computed 79 place invariants in 1827 ms
[2022-05-18 03:38:01] [INFO ] Dead Transitions using invariants and state equation in 9490 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:38:03] [INFO ] Computed 79 place invariants in 1858 ms
[2022-05-18 03:38:05] [INFO ] Implicit Places using invariants in 3430 ms returned []
Implicit Place search using SMT only with invariants took 3432 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:38:06] [INFO ] Computed 79 place invariants in 1928 ms
[2022-05-18 03:38:14] [INFO ] Dead Transitions using invariants and state equation in 9527 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Built C files in :
/tmp/ltsmin2396788472205919037
[2022-05-18 03:38:14] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2396788472205919037
Running compilation step : cd /tmp/ltsmin2396788472205919037;'/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/ltsmin2396788472205919037;'/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/ltsmin2396788472205919037;'/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-18 03:38:19] [INFO ] Flatten gal took : 836 ms
[2022-05-18 03:38:20] [INFO ] Flatten gal took : 895 ms
[2022-05-18 03:38:20] [INFO ] Time to serialize gal into /tmp/LTL8074775890601605699.gal : 171 ms
[2022-05-18 03:38:20] [INFO ] Time to serialize properties into /tmp/LTL16989230991856012565.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8074775890601605699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16989230991856012565.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/LTL8074775...267
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((Neighbourhood_14_4+Neighbourhood_1_11)+(Neighbourhood_17_5+Neighbourhood_8_13))+((Neighbourhood_12_7+Neighbourhood_1...8476
Formula 0 simplified : !XG"((((((((((Neighbourhood_14_4+Neighbourhood_1_11)+(Neighbourhood_17_5+Neighbourhood_8_13))+((Neighbourhood_12_7+Neighbourhood_14_...8470
Detected timeout of ITS tools.
[2022-05-18 03:38:36] [INFO ] Flatten gal took : 735 ms
[2022-05-18 03:38:36] [INFO ] Applying decomposition
[2022-05-18 03:38:37] [INFO ] Flatten gal took : 748 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8725151636641588422.txt' '-o' '/tmp/graph8725151636641588422.bin' '-w' '/tmp/graph8725151636641588422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8725151636641588422.bin' '-l' '-1' '-v' '-w' '/tmp/graph8725151636641588422.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:38:39] [INFO ] Decomposing Gal with order
[2022-05-18 03:38:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:40:53] [INFO ] Removed a total of 34440 redundant transitions.
[2022-05-18 03:40:58] [INFO ] Flatten gal took : 137916 ms
[2022-05-18 03:41:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 14060 labels/synchronizations in 4548 ms.
[2022-05-18 03:41:07] [INFO ] Time to serialize gal into /tmp/LTL2170402578213156704.gal : 79 ms
[2022-05-18 03:41:07] [INFO ] Time to serialize properties into /tmp/LTL18237743582675248308.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2170402578213156704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18237743582675248308.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/LTL2170402...267
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((gu27.Neighbourhood_14_4+gu27.Neighbourhood_1_11)+(gu27.Neighbourhood_17_5+gu27.Neighbourhood_8_13))+((gu27.Neighbour...10476
Formula 0 simplified : !XG"((((((((((gu27.Neighbourhood_14_4+gu27.Neighbourhood_1_11)+(gu27.Neighbourhood_17_5+gu27.Neighbourhood_8_13))+((gu27.Neighbourho...10470
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13581757435941048370
[2022-05-18 03:41:22] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13581757435941048370
Running compilation step : cd /tmp/ltsmin13581757435941048370;'/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/ltsmin13581757435941048370;'/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/ltsmin13581757435941048370;'/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 PhilosophersDyn-PT-20-LTLCardinality-06 finished in 366073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 80 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 218 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:41:28] [INFO ] Computed 79 place invariants in 2643 ms
[2022-05-18 03:41:36] [INFO ] Dead Transitions using invariants and state equation in 11006 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:41:39] [INFO ] Computed 79 place invariants in 2434 ms
[2022-05-18 03:41:41] [INFO ] Implicit Places using invariants in 4431 ms returned []
Implicit Place search using SMT only with invariants took 4445 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:41:43] [INFO ] Computed 79 place invariants in 1840 ms
[2022-05-18 03:41:51] [INFO ] Dead Transitions using invariants and state equation in 9968 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ (ADD s42 s72 s154 s156 s192 s212 s214 s263 s286 s304 s307 s348 s371 s372 s373 s403 s427 s443 s505 s508) (ADD s31 s47 s56 s71 s126 s138 s140 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 69940 steps with 34970 reset in 10001 ms.
Product exploration timeout after 58200 steps with 29100 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-07 finished in 46022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 222 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:42:14] [INFO ] Computed 79 place invariants in 2480 ms
[2022-05-18 03:42:22] [INFO ] Dead Transitions using invariants and state equation in 10504 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:42:24] [INFO ] Computed 79 place invariants in 2476 ms
[2022-05-18 03:42:28] [INFO ] Implicit Places using invariants in 5836 ms returned []
Implicit Place search using SMT only with invariants took 5840 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:42:30] [INFO ] Computed 79 place invariants in 2028 ms
[2022-05-18 03:42:38] [INFO ] Dead Transitions using invariants and state equation in 10083 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s423)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 74230 steps with 37115 reset in 10001 ms.
Product exploration timeout after 76440 steps with 38220 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-09 finished in 47043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(p1)&&p2))))'
Support contains 6 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 4842 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:43:06] [INFO ] Computed 79 place invariants in 2408 ms
[2022-05-18 03:43:14] [INFO ] Dead Transitions using invariants and state equation in 10773 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:43:16] [INFO ] Computed 79 place invariants in 2108 ms
[2022-05-18 03:43:19] [INFO ] Implicit Places using invariants in 5369 ms returned []
Implicit Place search using SMT only with invariants took 5371 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:43:21] [INFO ] Computed 79 place invariants in 2125 ms
[2022-05-18 03:43:30] [INFO ] Dead Transitions using invariants and state equation in 10214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s286 s308), p2:(LEQ s427 s62), p1:(LEQ s220 s273)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 2 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-10 finished in 31448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(false U p0) U (F(p1)||X(!F(p0)))))'
Support contains 4 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 226 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:43:32] [INFO ] Computed 79 place invariants in 2122 ms
[2022-05-18 03:43:40] [INFO ] Dead Transitions using invariants and state equation in 9650 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:43:42] [INFO ] Computed 79 place invariants in 1813 ms
[2022-05-18 03:43:45] [INFO ] Implicit Places using invariants in 4934 ms returned []
Implicit Place search using SMT only with invariants took 4937 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:43:46] [INFO ] Computed 79 place invariants in 1805 ms
[2022-05-18 03:43:54] [INFO ] Dead Transitions using invariants and state equation in 9492 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ s214 s412), p0:(LEQ s348 s185)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-12 finished in 24477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(X(X(p0))))))'
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3573 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:44:00] [INFO ] Computed 79 place invariants in 1803 ms
[2022-05-18 03:44:07] [INFO ] Dead Transitions using invariants and state equation in 9318 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:44:09] [INFO ] Computed 79 place invariants in 1888 ms
[2022-05-18 03:44:12] [INFO ] Implicit Places using invariants in 5001 ms returned []
Implicit Place search using SMT only with invariants took 5002 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:44:14] [INFO ] Computed 79 place invariants in 1847 ms
[2022-05-18 03:44:21] [INFO ] Dead Transitions using invariants and state equation in 9304 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s89 s379)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-13 finished in 27302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 216 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:44:24] [INFO ] Computed 79 place invariants in 1905 ms
[2022-05-18 03:44:32] [INFO ] Dead Transitions using invariants and state equation in 9783 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:44:33] [INFO ] Computed 79 place invariants in 1852 ms
[2022-05-18 03:44:37] [INFO ] Implicit Places using invariants in 4952 ms returned []
Implicit Place search using SMT only with invariants took 4955 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:44:38] [INFO ] Computed 79 place invariants in 1814 ms
[2022-05-18 03:44:46] [INFO ] Dead Transitions using invariants and state equation in 9567 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-14 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 s295 s100)], 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 1 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-20-LTLCardinality-14 finished in 24652 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : PhilosophersDyn-PT-20-LTLCardinality-06
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Support contains 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 183 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:44:48] [INFO ] Computed 79 place invariants in 1839 ms
[2022-05-18 03:44:56] [INFO ] Dead Transitions using invariants and state equation in 9626 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:44:58] [INFO ] Computed 79 place invariants in 1826 ms
[2022-05-18 03:45:00] [INFO ] Implicit Places using invariants in 3349 ms returned []
Implicit Place search using SMT only with invariants took 3361 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:45:01] [INFO ] Computed 79 place invariants in 1788 ms
[2022-05-18 03:45:09] [INFO ] Dead Transitions using invariants and state equation in 9025 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Running random walk in product with property : PhilosophersDyn-PT-20-LTLCardinality-06 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:(LEQ 1 (ADD s1 s2 s3 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s26 s27 s28 s30 s32 s36 s37 s38 s39 s40 s41 s43 s45 s48...], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11462 reset in 5695 ms.
Product exploration explored 100000 steps with 11448 reset in 5717 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 : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:45:24] [INFO ] Computed 79 place invariants in 2251 ms
Could not prove EG (NOT p0)
Support contains 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 64 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:45:41] [INFO ] Computed 79 place invariants in 2055 ms
[2022-05-18 03:45:48] [INFO ] Dead Transitions using invariants and state equation in 9573 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:45:50] [INFO ] Computed 79 place invariants in 1886 ms
[2022-05-18 03:45:52] [INFO ] Implicit Places using invariants in 3428 ms returned []
Implicit Place search using SMT only with invariants took 3442 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:45:54] [INFO ] Computed 79 place invariants in 1868 ms
[2022-05-18 03:46:01] [INFO ] Dead Transitions using invariants and state equation in 9308 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 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 : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:46:05] [INFO ] Computed 79 place invariants in 2353 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11473 reset in 5925 ms.
Product exploration explored 100000 steps with 11445 reset in 5669 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 4736 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:46:39] [INFO ] Computed 79 place invariants in 1903 ms
[2022-05-18 03:46:46] [INFO ] Dead Transitions using invariants and state equation in 9261 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:46:48] [INFO ] Computed 79 place invariants in 1838 ms
[2022-05-18 03:46:55] [INFO ] Dead Transitions using invariants and state equation in 9272 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Product exploration explored 100000 steps with 11465 reset in 9693 ms.
Product exploration explored 100000 steps with 11437 reset in 9781 ms.
Built C files in :
/tmp/ltsmin16453433060124689320
[2022-05-18 03:47:15] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16453433060124689320
Running compilation step : cd /tmp/ltsmin16453433060124689320;'/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/ltsmin16453433060124689320;'/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/ltsmin16453433060124689320;'/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 400 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 122 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:47:20] [INFO ] Computed 79 place invariants in 1941 ms
[2022-05-18 03:47:34] [INFO ] Dead Transitions using invariants and state equation in 15608 ms found 0 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:47:36] [INFO ] Computed 79 place invariants in 1865 ms
[2022-05-18 03:47:38] [INFO ] Implicit Places using invariants in 4007 ms returned []
Implicit Place search using SMT only with invariants took 4022 ms to find 0 implicit places.
// Phase 1: matrix 15470 rows 540 cols
[2022-05-18 03:47:40] [INFO ] Computed 79 place invariants in 1930 ms
[2022-05-18 03:47:57] [INFO ] Dead Transitions using invariants and state equation in 19043 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 15470/15470 transitions.
Built C files in :
/tmp/ltsmin9349101112545808043
[2022-05-18 03:47:57] [INFO ] Built C files in 228ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9349101112545808043
Running compilation step : cd /tmp/ltsmin9349101112545808043;'/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/ltsmin9349101112545808043;'/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/ltsmin9349101112545808043;'/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-18 03:48:01] [INFO ] Flatten gal took : 829 ms
[2022-05-18 03:48:03] [INFO ] Flatten gal took : 1139 ms
[2022-05-18 03:48:03] [INFO ] Time to serialize gal into /tmp/LTL681891879608870422.gal : 78 ms
[2022-05-18 03:48:03] [INFO ] Time to serialize properties into /tmp/LTL4760201797854623645.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL681891879608870422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4760201797854623645.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/LTL6818918...265
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((Neighbourhood_14_4+Neighbourhood_1_11)+(Neighbourhood_17_5+Neighbourhood_8_13))+((Neighbourhood_12_7+Neighbourhood_1...8476
Formula 0 simplified : !XG"((((((((((Neighbourhood_14_4+Neighbourhood_1_11)+(Neighbourhood_17_5+Neighbourhood_8_13))+((Neighbourhood_12_7+Neighbourhood_14_...8470
Detected timeout of ITS tools.
[2022-05-18 03:48:19] [INFO ] Flatten gal took : 891 ms
[2022-05-18 03:48:19] [INFO ] Applying decomposition
[2022-05-18 03:48:19] [INFO ] Flatten gal took : 784 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4066298706786126405.txt' '-o' '/tmp/graph4066298706786126405.bin' '-w' '/tmp/graph4066298706786126405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4066298706786126405.bin' '-l' '-1' '-v' '-w' '/tmp/graph4066298706786126405.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:48:22] [INFO ] Decomposing Gal with order
[2022-05-18 03:48:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 03:50:49] [INFO ] Removed a total of 34440 redundant transitions.
[2022-05-18 03:50:51] [INFO ] Flatten gal took : 149144 ms
[2022-05-18 03:50:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 14060 labels/synchronizations in 5214 ms.
[2022-05-18 03:50:59] [INFO ] Time to serialize gal into /tmp/LTL12628393055243403745.gal : 64 ms
[2022-05-18 03:50:59] [INFO ] Time to serialize properties into /tmp/LTL2337874218117796149.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12628393055243403745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2337874218117796149.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/LTL1262839...267
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((gu1.Neighbourhood_14_4+gu1.Neighbourhood_1_11)+(gu1.Neighbourhood_17_5+gu1.Neighbourhood_8_13))+((gu1.Neighbourhood_...10076
Formula 0 simplified : !XG"((((((((((gu1.Neighbourhood_14_4+gu1.Neighbourhood_1_11)+(gu1.Neighbourhood_17_5+gu1.Neighbourhood_8_13))+((gu1.Neighbourhood_12...10070
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2081863653278648280
[2022-05-18 03:51:14] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2081863653278648280
Running compilation step : cd /tmp/ltsmin2081863653278648280;'/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/ltsmin2081863653278648280;'/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/ltsmin2081863653278648280;'/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 PhilosophersDyn-PT-20-LTLCardinality-06 finished in 390932 ms.
[2022-05-18 03:51:18] [INFO ] Flatten gal took : 748 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1566235769597347853
[2022-05-18 03:51:18] [INFO ] Too many transitions (15470) to apply POR reductions. Disabling POR matrices.
[2022-05-18 03:51:19] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1566235769597347853
Running compilation step : cd /tmp/ltsmin1566235769597347853;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 03:51:19] [INFO ] Applying decomposition
[2022-05-18 03:51:20] [INFO ] Flatten gal took : 791 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15746909982424443767.txt' '-o' '/tmp/graph15746909982424443767.bin' '-w' '/tmp/graph15746909982424443767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15746909982424443767.bin' '-l' '-1' '-v' '-w' '/tmp/graph15746909982424443767.weights' '-q' '0' '-e' '0.001'
[2022-05-18 03:51:22] [INFO ] Decomposing Gal with order
[2022-05-18 03:51:22] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 133288 ms.
Running link step : cd /tmp/ltsmin1566235769597347853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 151 ms.
Running LTSmin : cd /tmp/ltsmin1566235769597347853;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
[2022-05-18 03:54:20] [INFO ] Removed a total of 34480 redundant transitions.
[2022-05-18 03:54:26] [INFO ] Flatten gal took : 183614 ms
[2022-05-18 03:54:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 14060 labels/synchronizations in 21867 ms.
[2022-05-18 03:54:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality15180251768490554728.gal : 137 ms
[2022-05-18 03:54:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality12422766908814894997.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15180251768490554728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12422766908814894997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((gu15.Neighbourhood_14_4+gu15.Neighbourhood_1_11)+(gu15.Neighbourhood_17_5+gu15.Neighbourhood_8_13))+((gu15.Neighbour...10476
Formula 0 simplified : !XG"((((((((((gu15.Neighbourhood_14_4+gu15.Neighbourhood_1_11)+(gu15.Neighbourhood_17_5+gu15.Neighbourhood_8_13))+((gu15.Neighbourho...10470
Detected timeout of ITS tools.
[2022-05-18 04:21:53] [INFO ] Flatten gal took : 8626 ms
[2022-05-18 04:21:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality16252775748333727024.gal : 467 ms
[2022-05-18 04:21:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality14610807867660260720.ltl : 7 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/LTLCardinality16252775748333727024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14610807867660260720.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((X(G("((((((((((Neighbourhood_14_4+Neighbourhood_1_11)+(Neighbourhood_17_5+Neighbourhood_8_13))+((Neighbourhood_12_7+Neighbourhood_1...8476
Formula 0 simplified : !XG"((((((((((Neighbourhood_14_4+Neighbourhood_1_11)+(Neighbourhood_17_5+Neighbourhood_8_13))+((Neighbourhood_12_7+Neighbourhood_14_...8470
LTSmin run took 1949344 ms.
FORMULA PhilosophersDyn-PT-20-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 3291984 ms.

BK_STOP 1652847962637

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

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

Sequence of Actions to be Executed by the VM

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

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

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

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