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

About the Execution of ITS-Tools for Philosophers-PT-010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3168998.00 0.00 0.00 ???????FF??F???? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016600364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 170M
-rw-r--r-- 1 mcc users 8.4M Apr 30 01:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 42M Apr 30 01:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1M Apr 29 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 48M Apr 29 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7M May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17M May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5M May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15M May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 970K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 2.6M May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 22M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-010000-LTLFireability-00
FORMULA_NAME Philosophers-PT-010000-LTLFireability-01
FORMULA_NAME Philosophers-PT-010000-LTLFireability-02
FORMULA_NAME Philosophers-PT-010000-LTLFireability-03
FORMULA_NAME Philosophers-PT-010000-LTLFireability-04
FORMULA_NAME Philosophers-PT-010000-LTLFireability-05
FORMULA_NAME Philosophers-PT-010000-LTLFireability-06
FORMULA_NAME Philosophers-PT-010000-LTLFireability-07
FORMULA_NAME Philosophers-PT-010000-LTLFireability-08
FORMULA_NAME Philosophers-PT-010000-LTLFireability-09
FORMULA_NAME Philosophers-PT-010000-LTLFireability-10
FORMULA_NAME Philosophers-PT-010000-LTLFireability-11
FORMULA_NAME Philosophers-PT-010000-LTLFireability-12
FORMULA_NAME Philosophers-PT-010000-LTLFireability-13
FORMULA_NAME Philosophers-PT-010000-LTLFireability-14
FORMULA_NAME Philosophers-PT-010000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652833280367

Running Version 202205111006
[2022-05-18 00:21:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 00:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:21:23] [INFO ] Load time of PNML (sax parser for PT used): 1216 ms
[2022-05-18 00:21:23] [INFO ] Transformed 50000 places.
[2022-05-18 00:21:23] [INFO ] Transformed 50000 transitions.
[2022-05-18 00:21:23] [INFO ] Parsed PT model containing 50000 places and 50000 transitions in 1584 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 498 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-010000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 197 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:21:47] [INFO ] Computed 20000 place invariants in 310 ms
[2022-05-18 00:21:51] [INFO ] Implicit Places using invariants in 4734 ms returned []
Implicit Place search using SMT only with invariants took 4764 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:21:52] [INFO ] Computed 20000 place invariants in 226 ms
[2022-05-18 00:21:56] [INFO ] Dead Transitions using invariants and state equation in 4497 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Support contains 50000 out of 50000 places after structural reductions.
[2022-05-18 00:22:01] [INFO ] Flatten gal took : 2901 ms
[2022-05-18 00:22:16] [INFO ] Flatten gal took : 3545 ms
[2022-05-18 00:22:32] [INFO ] Input system was already deterministic with 50000 transitions.
Interrupted random walk after 8267 steps, including 2 resets, run timeout after 30005 ms. (steps per millisecond=0 ) properties seen 8
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5581 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5335 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3328 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 3180 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2790 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2570 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2535 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2812 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2663 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2424 ms. (steps per millisecond=4 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2470 ms. (steps per millisecond=4 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2637 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2535 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:23:45] [INFO ] Computed 20000 place invariants in 141 ms
[2022-05-18 00:24:10] [INFO ] [Real]Absence check using 20000 positive place invariants in 6220 ms returned unknown
[2022-05-18 00:24:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 00:24:10] [INFO ] After 25130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 20010 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 700 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Interrupted random walk after 7914 steps, including 2 resets, run timeout after 30003 ms. (steps per millisecond=0 ) properties seen 5
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6060 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5829 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2737 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2897 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2628 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2709 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2675 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:25:07] [INFO ] Computed 20000 place invariants in 147 ms
[2022-05-18 00:25:32] [INFO ] [Real]Absence check using 20000 positive place invariants in 9014 ms returned unknown
[2022-05-18 00:25:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 00:25:32] [INFO ] After 25142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20006 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 414 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
FORMULA Philosophers-PT-010000-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Philosophers-PT-010000-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G((p0 U p1))) U X((!p0 U G(X(p0)))))))'
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 195 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:25:55] [INFO ] Computed 20000 place invariants in 146 ms
[2022-05-18 00:25:59] [INFO ] Implicit Places using invariants in 4450 ms returned []
Implicit Place search using SMT only with invariants took 4452 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:25:59] [INFO ] Computed 20000 place invariants in 161 ms
[2022-05-18 00:26:04] [INFO ] Dead Transitions using invariants and state equation in 4447 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Stuttering acceptance computed with spot in 479 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-010000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s12253 1) (GEQ s31940 1)) (AND (GEQ s18234 1) (GEQ s39316 1)) (AND (GEQ s12723 1) (GEQ s34869 1)) (AND (GEQ s16060 1) (GEQ s33426 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 1410 steps with 270 reset in 10104 ms.
Product exploration timeout after 1480 steps with 295 reset in 10031 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0))]
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 8 states, 17 edges and 2 AP to 8 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Finished random walk after 3335 steps, including 1 resets, run visited all 5 properties in 13081 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 342 ms. Reduced automaton from 8 states, 17 edges and 2 AP to 8 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
[2022-05-18 00:29:23] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 112 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:29:24] [INFO ] Computed 20000 place invariants in 178 ms
[2022-05-18 00:29:28] [INFO ] Implicit Places using invariants in 4328 ms returned []
Implicit Place search using SMT only with invariants took 4330 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:29:28] [INFO ] Computed 20000 place invariants in 209 ms
[2022-05-18 00:29:32] [INFO ] Dead Transitions using invariants and state equation in 4540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0))]
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 8 states, 17 edges and 2 AP to 8 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Finished random walk after 3335 steps, including 1 resets, run visited all 5 properties in 14441 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 336 ms. Reduced automaton from 8 states, 17 edges and 2 AP to 8 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 357 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
[2022-05-18 00:32:56] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Product exploration timeout after 1610 steps with 330 reset in 10016 ms.
Product exploration timeout after 1430 steps with 280 reset in 10061 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1), (NOT p1)]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 543 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:33:18] [INFO ] Computed 20000 place invariants in 155 ms
[2022-05-18 00:33:22] [INFO ] Dead Transitions using invariants and state equation in 4320 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Product exploration timeout after 1210 steps with 244 reset in 10006 ms.
Product exploration timeout after 1240 steps with 253 reset in 10039 ms.
Built C files in :
/tmp/ltsmin8592524327343705057
[2022-05-18 00:33:43] [INFO ] Built C files in 538ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8592524327343705057
Running compilation step : cd /tmp/ltsmin8592524327343705057;'/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/ltsmin8592524327343705057;'/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/ltsmin8592524327343705057;'/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 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 190 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:33:46] [INFO ] Computed 20000 place invariants in 181 ms
[2022-05-18 00:33:50] [INFO ] Implicit Places using invariants in 4424 ms returned []
Implicit Place search using SMT only with invariants took 4426 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 00:33:50] [INFO ] Computed 20000 place invariants in 127 ms
[2022-05-18 00:33:54] [INFO ] Dead Transitions using invariants and state equation in 3934 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Built C files in :
/tmp/ltsmin11413317220165792568
[2022-05-18 00:33:55] [INFO ] Built C files in 447ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11413317220165792568
Running compilation step : cd /tmp/ltsmin11413317220165792568;'/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/ltsmin11413317220165792568;'/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/ltsmin11413317220165792568;'/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 00:34:05] [INFO ] Flatten gal took : 1958 ms
[2022-05-18 00:34:06] [INFO ] Flatten gal took : 1871 ms
[2022-05-18 00:34:07] [INFO ] Time to serialize gal into /tmp/LTL7406294251400800558.gal : 331 ms
[2022-05-18 00:34:07] [INFO ] Time to serialize properties into /tmp/LTL5086868989945395465.ltl : 177 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/LTL7406294251400800558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5086868989945395465.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/LTL7406294...266
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-18 00:34:25] [INFO ] Flatten gal took : 2054 ms
[2022-05-18 00:34:25] [INFO ] Applying decomposition
[2022-05-18 00:34:27] [INFO ] Flatten gal took : 1980 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/graph2587407605331457388.txt' '-o' '/tmp/graph2587407605331457388.bin' '-w' '/tmp/graph2587407605331457388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2587407605331457388.bin' '-l' '-1' '-v' '-w' '/tmp/graph2587407605331457388.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:34:33] [INFO ] Decomposing Gal with order
[2022-05-18 00:34:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:51:20] [INFO ] Removed a total of 9908 redundant transitions.
[2022-05-18 00:51:22] [INFO ] Flatten gal took : 3328 ms
[2022-05-18 01:08:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 33364 labels/synchronizations in 996 ms.
[2022-05-18 01:08:38] [INFO ] Time to serialize gal into /tmp/LTL9315710700542923962.gal : 366 ms
[2022-05-18 01:08:39] [INFO ] Time to serialize properties into /tmp/LTL15611031484698898328.ltl : 291 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/LTL9315710700542923962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15611031484698898328.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9315710...246
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14647069659421352511
[2022-05-18 01:08:54] [INFO ] Built C files in 475ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14647069659421352511
Running compilation step : cd /tmp/ltsmin14647069659421352511;'/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/ltsmin14647069659421352511;'/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/ltsmin14647069659421352511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-PT-010000-LTLFireability-00 finished in 2582998 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0)||p1))||G(p0))))'
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 132 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 01:08:58] [INFO ] Computed 20000 place invariants in 123 ms
[2022-05-18 01:09:02] [INFO ] Implicit Places using invariants in 4412 ms returned []
Implicit Place search using SMT only with invariants took 4425 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 01:09:02] [INFO ] Computed 20000 place invariants in 120 ms
[2022-05-18 01:09:06] [INFO ] Dead Transitions using invariants and state equation in 4392 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-010000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s12253 1) (LT s31940 1)) (OR (LT s18234 1) (LT s39316 1)) (OR (LT s12723 1) (LT s34869 1)) (OR (LT s16060 1) (LT s33426 1)) (OR (LT s11702...], 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 2660 steps with 15 reset in 10032 ms.
Product exploration timeout after 2620 steps with 0 reset in 10012 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 32 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 132 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 01:09:47] [INFO ] Computed 20000 place invariants in 155 ms
[2022-05-18 01:09:51] [INFO ] Implicit Places using invariants in 4399 ms returned []
Implicit Place search using SMT only with invariants took 4400 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 01:09:51] [INFO ] Computed 20000 place invariants in 160 ms
[2022-05-18 01:09:55] [INFO ] Dead Transitions using invariants and state equation in 4444 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 27 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 573 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 2540 steps with 4 reset in 10013 ms.
Product exploration timeout after 2650 steps with 2 reset in 10028 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 366 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 01:10:35] [INFO ] Computed 20000 place invariants in 141 ms
[2022-05-18 01:10:39] [INFO ] Dead Transitions using invariants and state equation in 3851 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Product exploration timeout after 2690 steps with 0 reset in 10010 ms.
Product exploration timeout after 2670 steps with 5 reset in 10023 ms.
Built C files in :
/tmp/ltsmin3345386467759839699
[2022-05-18 01:10:59] [INFO ] Built C files in 363ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3345386467759839699
Running compilation step : cd /tmp/ltsmin3345386467759839699;'/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/ltsmin3345386467759839699;'/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/ltsmin3345386467759839699;'/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 30000 out of 50000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Applied a total of 0 rules in 91 ms. Remains 50000 /50000 variables (removed 0) and now considering 50000/50000 (removed 0) transitions.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 01:11:03] [INFO ] Computed 20000 place invariants in 169 ms
[2022-05-18 01:11:07] [INFO ] Implicit Places using invariants in 4347 ms returned []
Implicit Place search using SMT only with invariants took 4356 ms to find 0 implicit places.
// Phase 1: matrix 50000 rows 50000 cols
[2022-05-18 01:11:07] [INFO ] Computed 20000 place invariants in 176 ms
[2022-05-18 01:11:11] [INFO ] Dead Transitions using invariants and state equation in 4316 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50000/50000 places, 50000/50000 transitions.
Built C files in :
/tmp/ltsmin1488460060796754743
[2022-05-18 01:11:12] [INFO ] Built C files in 305ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1488460060796754743
Running compilation step : cd /tmp/ltsmin1488460060796754743;'/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/ltsmin1488460060796754743;'/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/ltsmin1488460060796754743;'/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 01:11:20] [INFO ] Flatten gal took : 1969 ms
[2022-05-18 01:11:23] [INFO ] Flatten gal took : 2430 ms
[2022-05-18 01:11:23] [INFO ] Time to serialize gal into /tmp/LTL6529780588908696153.gal : 193 ms
[2022-05-18 01:11:23] [INFO ] Time to serialize properties into /tmp/LTL16613779609793133230.ltl : 82 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/LTL6529780588908696153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16613779609793133230.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/LTL6529780...267
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-18 01:11:41] [INFO ] Flatten gal took : 1997 ms
[2022-05-18 01:11:41] [INFO ] Applying decomposition
[2022-05-18 01:11:43] [INFO ] Flatten gal took : 2106 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/graph17962519777332209057.txt' '-o' '/tmp/graph17962519777332209057.bin' '-w' '/tmp/graph17962519777332209057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17962519777332209057.bin' '-l' '-1' '-v' '-w' '/tmp/graph17962519777332209057.weights' '-q' '0' '-e' '0.001'
[2022-05-18 01:11:49] [INFO ] Decomposing Gal with order
[2022-05-18 01:12:41] [INFO ] Rewriting arrays to variables to allow decomposition.

BK_STOP 1652836449365

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-010000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-010000, examination is LTLFireability"
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-165277016600364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-010000.tgz
mv Philosophers-PT-010000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;