Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.7K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 52K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678793167954

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-001000
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-14 11:26:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 11:26:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:26:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 11:26:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 11:26:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 739 ms
[2023-03-14 11:26:10] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 11:26:10] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2023-03-14 11:26:10] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-001000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10019 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 11:26:10] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-14 11:26:10] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:26:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 11:26:10] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Philosophers-COL-001000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 11:26:10] [INFO ] Flatten gal took : 14 ms
[2023-03-14 11:26:10] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 1000) 1000) 1000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 11:26:11] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions 16000 arcs in 68 ms.
[2023-03-14 11:26:11] [INFO ] Unfolded 11 HLPN properties in 6 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 63 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 11:26:11] [INFO ] Computed 2000 place invariants in 46 ms
[2023-03-14 11:26:12] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-03-14 11:26:12] [INFO ] Invariant cache hit.
[2023-03-14 11:26:12] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2023-03-14 11:26:12] [INFO ] Invariant cache hit.
[2023-03-14 11:26:15] [INFO ] Dead Transitions using invariants and state equation in 3256 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4442 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-14 11:26:16] [INFO ] Flatten gal took : 371 ms
[2023-03-14 11:26:16] [INFO ] Flatten gal took : 239 ms
[2023-03-14 11:26:17] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3027 ms. (steps per millisecond=3 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=12 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 977 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 11:26:23] [INFO ] Invariant cache hit.
[2023-03-14 11:26:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 431 ms returned sat
[2023-03-14 11:26:31] [INFO ] After 8107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 11:26:32] [INFO ] [Nat]Absence check using 2000 positive place invariants in 483 ms returned sat
[2023-03-14 11:26:37] [INFO ] After 3445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 11:26:37] [INFO ] After 4131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 339 ms.
[2023-03-14 11:26:38] [INFO ] After 6620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 2 properties in 230 ms. (steps per millisecond=4 )
Parikh walk visited 2 properties in 233 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((F(p1)||G(p2)))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 119 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:26:39] [INFO ] Invariant cache hit.
[2023-03-14 11:26:40] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2023-03-14 11:26:40] [INFO ] Invariant cache hit.
[2023-03-14 11:26:41] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2023-03-14 11:26:41] [INFO ] Invariant cache hit.
[2023-03-14 11:26:44] [INFO ] Dead Transitions using invariants and state equation in 3200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5554 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s40...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-01 finished in 6019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||(F(p1)&&F((G(p2)||G(!p1))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 254 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:26:45] [INFO ] Invariant cache hit.
[2023-03-14 11:26:46] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2023-03-14 11:26:46] [INFO ] Invariant cache hit.
[2023-03-14 11:26:47] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
[2023-03-14 11:26:48] [INFO ] Redundant transitions in 361 ms returned []
[2023-03-14 11:26:48] [INFO ] Invariant cache hit.
[2023-03-14 11:26:51] [INFO ] Dead Transitions using invariants and state equation in 3244 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6253 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 80810 steps with 0 reset in 10001 ms.
Product exploration timeout after 67390 steps with 1 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2562 ms. (steps per millisecond=3 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 974 ms. (steps per millisecond=10 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 992 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 11:27:17] [INFO ] Invariant cache hit.
[2023-03-14 11:27:18] [INFO ] [Real]Absence check using 2000 positive place invariants in 480 ms returned sat
[2023-03-14 11:27:21] [INFO ] After 2981ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 11:27:22] [INFO ] After 3345ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-14 11:27:22] [INFO ] After 5266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 195 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 198 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F p1), (F (AND p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 375 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-14 11:27:23] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 63 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:27:38] [INFO ] Invariant cache hit.
[2023-03-14 11:27:39] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2023-03-14 11:27:39] [INFO ] Invariant cache hit.
[2023-03-14 11:27:41] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
[2023-03-14 11:27:41] [INFO ] Invariant cache hit.
[2023-03-14 11:27:44] [INFO ] Dead Transitions using invariants and state equation in 3334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5743 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2287 ms. (steps per millisecond=4 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1012 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 11:27:48] [INFO ] Invariant cache hit.
[2023-03-14 11:27:49] [INFO ] [Real]Absence check using 2000 positive place invariants in 466 ms returned sat
[2023-03-14 11:27:53] [INFO ] After 3048ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 11:27:53] [INFO ] After 3420ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-14 11:27:53] [INFO ] After 5287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 187 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 189 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F p1), (F (AND p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-14 11:27:55] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Product exploration timeout after 72690 steps with 1 reset in 10001 ms.
Product exploration timeout after 67430 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 212 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:28:31] [INFO ] Redundant transitions in 351 ms returned []
[2023-03-14 11:28:31] [INFO ] Invariant cache hit.
[2023-03-14 11:28:34] [INFO ] Dead Transitions using invariants and state equation in 3064 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3673 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin4825598921043153541
[2023-03-14 11:28:34] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4825598921043153541
Running compilation step : cd /tmp/ltsmin4825598921043153541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4825598921043153541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4825598921043153541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 109 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:28:37] [INFO ] Invariant cache hit.
[2023-03-14 11:28:38] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2023-03-14 11:28:38] [INFO ] Invariant cache hit.
[2023-03-14 11:28:39] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 2366 ms to find 0 implicit places.
[2023-03-14 11:28:39] [INFO ] Invariant cache hit.
[2023-03-14 11:28:43] [INFO ] Dead Transitions using invariants and state equation in 3300 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5777 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin16922393119250051428
[2023-03-14 11:28:43] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16922393119250051428
Running compilation step : cd /tmp/ltsmin16922393119250051428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16922393119250051428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16922393119250051428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 11:28:46] [INFO ] Flatten gal took : 159 ms
[2023-03-14 11:28:46] [INFO ] Flatten gal took : 167 ms
[2023-03-14 11:28:47] [INFO ] Time to serialize gal into /tmp/LTL4639742684861169827.gal : 66 ms
[2023-03-14 11:28:47] [INFO ] Time to serialize properties into /tmp/LTL11991863497446837974.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4639742684861169827.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12674452200251362504.hoa' '-atoms' '/tmp/LTL11991863497446837974.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11991863497446837974.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12674452200251362504.hoa
Detected timeout of ITS tools.
[2023-03-14 11:29:02] [INFO ] Flatten gal took : 131 ms
[2023-03-14 11:29:02] [INFO ] Flatten gal took : 150 ms
[2023-03-14 11:29:02] [INFO ] Time to serialize gal into /tmp/LTL1514820075963283204.gal : 20 ms
[2023-03-14 11:29:02] [INFO ] Time to serialize properties into /tmp/LTL13568327684302388029.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1514820075963283204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13568327684302388029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))...83307
Formula 0 simplified : F(!"(((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+(...83291
Detected timeout of ITS tools.
[2023-03-14 11:29:17] [INFO ] Flatten gal took : 120 ms
[2023-03-14 11:29:17] [INFO ] Applying decomposition
[2023-03-14 11:29:17] [INFO ] Flatten gal took : 134 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8465155133626419144.txt' '-o' '/tmp/graph8465155133626419144.bin' '-w' '/tmp/graph8465155133626419144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8465155133626419144.bin' '-l' '-1' '-v' '-w' '/tmp/graph8465155133626419144.weights' '-q' '0' '-e' '0.001'
[2023-03-14 11:29:30] [INFO ] Decomposing Gal with order
[2023-03-14 11:29:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 11:29:42] [INFO ] Flatten gal took : 12072 ms
[2023-03-14 11:29:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2023-03-14 11:29:43] [INFO ] Time to serialize gal into /tmp/LTL2988669834364645858.gal : 45 ms
[2023-03-14 11:29:43] [INFO ] Time to serialize properties into /tmp/LTL17556624309404821693.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2988669834364645858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17556624309404821693.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("(((((((((((gu0.Think_0+gu0.Think_1)+(gu0.Think_2+gu0.Think_3))+((gu0.Think_4+gu0.Think_5)+(gu0.Think_6+gu0.Think_7)))+(((gu0.T...111307
Formula 0 simplified : F(!"(((((((((((gu0.Think_0+gu0.Think_1)+(gu0.Think_2+gu0.Think_3))+((gu0.Think_4+gu0.Think_5)+(gu0.Think_6+gu0.Think_7)))+(((gu0.Thi...111291
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9568207213504735695
[2023-03-14 11:29:58] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9568207213504735695
Running compilation step : cd /tmp/ltsmin9568207213504735695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9568207213504735695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9568207213504735695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-COL-001000-LTLCardinality-03 finished in 196661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 679 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:30:02] [INFO ] Invariant cache hit.
[2023-03-14 11:30:04] [INFO ] Implicit Places using invariants in 2345 ms returned []
[2023-03-14 11:30:04] [INFO ] Invariant cache hit.
[2023-03-14 11:30:07] [INFO ] Implicit Places using invariants and state equation in 2372 ms returned []
Implicit Place search using SMT with State Equation took 4739 ms to find 0 implicit places.
[2023-03-14 11:30:07] [INFO ] Redundant transitions in 217 ms returned []
[2023-03-14 11:30:07] [INFO ] Invariant cache hit.
[2023-03-14 11:30:10] [INFO ] Dead Transitions using invariants and state equation in 3105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8764 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 5365 ms.
Stack based approach found an accepted trace after 10719 steps with 0 reset with depth 10720 and stack size 2359 in 1094 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-05 finished in 15315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(!p2))))))'
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 58 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:30:17] [INFO ] Invariant cache hit.
[2023-03-14 11:30:17] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-14 11:30:17] [INFO ] Invariant cache hit.
[2023-03-14 11:30:18] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
[2023-03-14 11:30:18] [INFO ] Redundant transitions in 210 ms returned []
[2023-03-14 11:30:18] [INFO ] Invariant cache hit.
[2023-03-14 11:30:21] [INFO ] Dead Transitions using invariants and state equation in 3191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4543 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 32550 steps with 0 reset in 10002 ms.
Product exploration timeout after 30710 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2966 ms. (steps per millisecond=3 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1844 ms. (steps per millisecond=5 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2335 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 11:30:50] [INFO ] Invariant cache hit.
[2023-03-14 11:30:52] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 11:30:53] [INFO ] [Nat]Absence check using 2000 positive place invariants in 499 ms returned sat
[2023-03-14 11:30:58] [INFO ] After 4452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 11:30:59] [INFO ] After 5205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-14 11:30:59] [INFO ] After 7637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 156 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 534 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 30 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:31:01] [INFO ] Invariant cache hit.
[2023-03-14 11:31:01] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-14 11:31:01] [INFO ] Invariant cache hit.
[2023-03-14 11:31:02] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2023-03-14 11:31:02] [INFO ] Redundant transitions in 213 ms returned []
[2023-03-14 11:31:02] [INFO ] Invariant cache hit.
[2023-03-14 11:31:05] [INFO ] Dead Transitions using invariants and state equation in 3001 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4237 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3688 ms. (steps per millisecond=2 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1873 ms. (steps per millisecond=5 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2369 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 791 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 11:31:15] [INFO ] Invariant cache hit.
[2023-03-14 11:31:17] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 11:31:18] [INFO ] [Nat]Absence check using 2000 positive place invariants in 469 ms returned sat
[2023-03-14 11:31:23] [INFO ] After 4115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 11:31:23] [INFO ] After 4959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-03-14 11:31:24] [INFO ] After 7239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 161 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 481 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Product exploration timeout after 28070 steps with 0 reset in 10001 ms.
Product exploration timeout after 27560 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin15374974754387349478
[2023-03-14 11:31:45] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 11:31:45] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15374974754387349478
Running compilation step : cd /tmp/ltsmin15374974754387349478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15374974754387349478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin15374974754387349478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 56 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:31:48] [INFO ] Invariant cache hit.
[2023-03-14 11:31:49] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-14 11:31:49] [INFO ] Invariant cache hit.
[2023-03-14 11:31:49] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2023-03-14 11:31:50] [INFO ] Redundant transitions in 213 ms returned []
[2023-03-14 11:31:50] [INFO ] Invariant cache hit.
[2023-03-14 11:31:53] [INFO ] Dead Transitions using invariants and state equation in 3087 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4380 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin7097377331790829321
[2023-03-14 11:31:53] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 11:31:53] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7097377331790829321
Running compilation step : cd /tmp/ltsmin7097377331790829321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7097377331790829321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7097377331790829321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 11:31:56] [INFO ] Flatten gal took : 181 ms
[2023-03-14 11:31:56] [INFO ] Flatten gal took : 141 ms
[2023-03-14 11:31:57] [INFO ] Time to serialize gal into /tmp/LTL16203573250503117962.gal : 21 ms
[2023-03-14 11:31:57] [INFO ] Time to serialize properties into /tmp/LTL18349272076589568724.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16203573250503117962.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5740311735496911768.hoa' '-atoms' '/tmp/LTL18349272076589568724.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18349272076589568724.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5740311735496911768.hoa
Detected timeout of ITS tools.
[2023-03-14 11:32:12] [INFO ] Flatten gal took : 128 ms
[2023-03-14 11:32:12] [INFO ] Flatten gal took : 126 ms
[2023-03-14 11:32:12] [INFO ] Time to serialize gal into /tmp/LTL12919338131082931440.gal : 21 ms
[2023-03-14 11:32:12] [INFO ] Time to serialize properties into /tmp/LTL754699819944909001.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12919338131082931440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL754699819944909001.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((((((Eat_0+Eat_1)+(Eat_2+Eat_3))+((Eat_4+Eat_5)+(Eat_6+Eat_7)))+(((Eat_8+Eat_9)+(Eat_10+Eat_11))+((Eat_12+Eat_13)+(Eat_1...80288
Formula 0 simplified : F!"((((((((((((Eat_0+Eat_1)+(Eat_2+Eat_3))+((Eat_4+Eat_5)+(Eat_6+Eat_7)))+(((Eat_8+Eat_9)+(Eat_10+Eat_11))+((Eat_12+Eat_13)+(Eat_14+...80274
Detected timeout of ITS tools.
[2023-03-14 11:32:27] [INFO ] Flatten gal took : 160 ms
[2023-03-14 11:32:27] [INFO ] Applying decomposition
[2023-03-14 11:32:27] [INFO ] Flatten gal took : 140 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14893660949037766925.txt' '-o' '/tmp/graph14893660949037766925.bin' '-w' '/tmp/graph14893660949037766925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14893660949037766925.bin' '-l' '-1' '-v' '-w' '/tmp/graph14893660949037766925.weights' '-q' '0' '-e' '0.001'
[2023-03-14 11:32:41] [INFO ] Decomposing Gal with order
[2023-03-14 11:32:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 11:32:53] [INFO ] Removed a total of 4000 redundant transitions.
[2023-03-14 11:32:53] [INFO ] Flatten gal took : 12184 ms
[2023-03-14 11:32:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 58 ms.
[2023-03-14 11:32:56] [INFO ] Time to serialize gal into /tmp/LTL6772970449763031044.gal : 71 ms
[2023-03-14 11:32:56] [INFO ] Time to serialize properties into /tmp/LTL8057084001483499592.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6772970449763031044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8057084001483499592.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((((((gi1.gu3.Eat_0+gi1.gu3.Eat_1)+(gi1.gu3.Eat_2+gi1.gu3.Eat_3))+((gi1.gu3.Eat_4+gi1.gu3.Eat_5)+(gi1.gu3.Eat_6+gi1.gu3.E...136288
Formula 0 simplified : F!"((((((((((((gi1.gu3.Eat_0+gi1.gu3.Eat_1)+(gi1.gu3.Eat_2+gi1.gu3.Eat_3))+((gi1.gu3.Eat_4+gi1.gu3.Eat_5)+(gi1.gu3.Eat_6+gi1.gu3.Eat...136274
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10218732328658330797
[2023-03-14 11:33:11] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10218732328658330797
Running compilation step : cd /tmp/ltsmin10218732328658330797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10218732328658330797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin10218732328658330797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-COL-001000-LTLCardinality-06 finished in 177305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 209 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:33:14] [INFO ] Invariant cache hit.
[2023-03-14 11:33:17] [INFO ] Implicit Places using invariants in 2780 ms returned []
[2023-03-14 11:33:17] [INFO ] Invariant cache hit.
[2023-03-14 11:33:20] [INFO ] Implicit Places using invariants and state equation in 2920 ms returned []
Implicit Place search using SMT with State Equation took 5702 ms to find 0 implicit places.
[2023-03-14 11:33:20] [INFO ] Invariant cache hit.
[2023-03-14 11:33:23] [INFO ] Dead Transitions using invariants and state equation in 3017 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8931 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-07 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 s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s...], 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 2 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-07 finished in 9067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(!p2)))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 53 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:33:23] [INFO ] Invariant cache hit.
[2023-03-14 11:33:24] [INFO ] Implicit Places using invariants in 1088 ms returned []
[2023-03-14 11:33:24] [INFO ] Invariant cache hit.
[2023-03-14 11:33:25] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2023-03-14 11:33:25] [INFO ] Redundant transitions in 212 ms returned []
[2023-03-14 11:33:25] [INFO ] Invariant cache hit.
[2023-03-14 11:33:28] [INFO ] Dead Transitions using invariants and state equation in 3239 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5607 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), p2, (AND (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(LEQ (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 46 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-08 finished in 5822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 79 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:33:29] [INFO ] Invariant cache hit.
[2023-03-14 11:33:30] [INFO ] Implicit Places using invariants in 1199 ms returned []
[2023-03-14 11:33:30] [INFO ] Invariant cache hit.
[2023-03-14 11:33:31] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
[2023-03-14 11:33:31] [INFO ] Redundant transitions in 214 ms returned []
[2023-03-14 11:33:31] [INFO ] Invariant cache hit.
[2023-03-14 11:33:35] [INFO ] Dead Transitions using invariants and state equation in 3273 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5943 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s40...], 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]]
Product exploration timeout after 42550 steps with 29 reset in 10003 ms.
Product exploration timeout after 40630 steps with 28 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 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1831 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Finished Best-First random walk after 4000 steps, including 0 resets, run visited all 1 properties in 291 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 11:33:59] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 74 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:34:14] [INFO ] Invariant cache hit.
[2023-03-14 11:34:15] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2023-03-14 11:34:15] [INFO ] Invariant cache hit.
[2023-03-14 11:34:17] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 2414 ms to find 0 implicit places.
[2023-03-14 11:34:17] [INFO ] Redundant transitions in 215 ms returned []
[2023-03-14 11:34:17] [INFO ] Invariant cache hit.
[2023-03-14 11:34:20] [INFO ] Dead Transitions using invariants and state equation in 3322 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6030 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1756 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Finished Best-First random walk after 4000 steps, including 0 resets, run visited all 1 properties in 296 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 11:34:24] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 41440 steps with 29 reset in 10003 ms.
Product exploration timeout after 40680 steps with 28 reset in 10002 ms.
Built C files in :
/tmp/ltsmin939470764986722407
[2023-03-14 11:34:59] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 11:34:59] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin939470764986722407
Running compilation step : cd /tmp/ltsmin939470764986722407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin939470764986722407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin939470764986722407;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 78 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:35:03] [INFO ] Invariant cache hit.
[2023-03-14 11:35:04] [INFO ] Implicit Places using invariants in 1162 ms returned []
[2023-03-14 11:35:04] [INFO ] Invariant cache hit.
[2023-03-14 11:35:05] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
[2023-03-14 11:35:05] [INFO ] Redundant transitions in 227 ms returned []
[2023-03-14 11:35:05] [INFO ] Invariant cache hit.
[2023-03-14 11:35:08] [INFO ] Dead Transitions using invariants and state equation in 3090 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5721 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin12390666532878066582
[2023-03-14 11:35:08] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 11:35:08] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12390666532878066582
Running compilation step : cd /tmp/ltsmin12390666532878066582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12390666532878066582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12390666532878066582;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 11:35:12] [INFO ] Flatten gal took : 125 ms
[2023-03-14 11:35:12] [INFO ] Flatten gal took : 112 ms
[2023-03-14 11:35:12] [INFO ] Time to serialize gal into /tmp/LTL9259889499823816040.gal : 23 ms
[2023-03-14 11:35:12] [INFO ] Time to serialize properties into /tmp/LTL547703158965249714.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9259889499823816040.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11853705778604128635.hoa' '-atoms' '/tmp/LTL547703158965249714.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL547703158965249714.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11853705778604128635.hoa
Detected timeout of ITS tools.
[2023-03-14 11:35:27] [INFO ] Flatten gal took : 115 ms
[2023-03-14 11:35:27] [INFO ] Flatten gal took : 147 ms
[2023-03-14 11:35:27] [INFO ] Time to serialize gal into /tmp/LTL4332948649631805099.gal : 32 ms
[2023-03-14 11:35:27] [INFO ] Time to serialize properties into /tmp/LTL16864264098781807128.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4332948649631805099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16864264098781807128.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((Eat_0+Eat_1)+(Eat_2+Eat_3))+((Eat_4+Eat_5)+(Eat_6+Eat_7)))+(((Eat_8+Eat_9)+(Eat_10+Eat_11))+((Eat_12+Eat_13)+(Eat_...47601
Formula 0 simplified : F(G!"(((((((((((Eat_0+Eat_1)+(Eat_2+Eat_3))+((Eat_4+Eat_5)+(Eat_6+Eat_7)))+(((Eat_8+Eat_9)+(Eat_10+Eat_11))+((Eat_12+Eat_13)+(Eat_14...47593
Detected timeout of ITS tools.
[2023-03-14 11:35:42] [INFO ] Flatten gal took : 127 ms
[2023-03-14 11:35:42] [INFO ] Applying decomposition
[2023-03-14 11:35:43] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2306601848968773245.txt' '-o' '/tmp/graph2306601848968773245.bin' '-w' '/tmp/graph2306601848968773245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2306601848968773245.bin' '-l' '-1' '-v' '-w' '/tmp/graph2306601848968773245.weights' '-q' '0' '-e' '0.001'
[2023-03-14 11:35:52] [INFO ] Decomposing Gal with order
[2023-03-14 11:35:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 11:36:00] [INFO ] Flatten gal took : 8165 ms
[2023-03-14 11:36:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-14 11:36:01] [INFO ] Time to serialize gal into /tmp/LTL132437004205677408.gal : 30 ms
[2023-03-14 11:36:01] [INFO ] Time to serialize properties into /tmp/LTL13501296177738497980.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL132437004205677408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13501296177738497980.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((gu1.Eat_0+gu1.Eat_1)+(gu1.Eat_2+gu1.Eat_3))+((gu1.Eat_4+gu1.Eat_5)+(gu1.Eat_6+gu1.Eat_7)))+(((gu1.Eat_8+gu1.Eat_9)...63601
Formula 0 simplified : F(G!"(((((((((((gu1.Eat_0+gu1.Eat_1)+(gu1.Eat_2+gu1.Eat_3))+((gu1.Eat_4+gu1.Eat_5)+(gu1.Eat_6+gu1.Eat_7)))+(((gu1.Eat_8+gu1.Eat_9)+(...63593
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin144488600980926577
[2023-03-14 11:36:16] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin144488600980926577
Running compilation step : cd /tmp/ltsmin144488600980926577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin144488600980926577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin144488600980926577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-COL-001000-LTLCardinality-11 finished in 170091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&F(p1))))||F((!p1&&X(p2)))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 54 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:36:19] [INFO ] Invariant cache hit.
[2023-03-14 11:36:20] [INFO ] Implicit Places using invariants in 1547 ms returned []
[2023-03-14 11:36:20] [INFO ] Invariant cache hit.
[2023-03-14 11:36:22] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 3206 ms to find 0 implicit places.
[2023-03-14 11:36:22] [INFO ] Invariant cache hit.
[2023-03-14 11:36:25] [INFO ] Dead Transitions using invariants and state equation in 3122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6388 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 3 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 38710 steps with 25 reset in 10003 ms.
Product exploration timeout after 37410 steps with 24 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 392 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2102 ms. (steps per millisecond=4 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1529 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 780 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 11:36:51] [INFO ] Invariant cache hit.
[2023-03-14 11:36:53] [INFO ] [Real]Absence check using 2000 positive place invariants in 466 ms returned sat
[2023-03-14 11:36:53] [INFO ] After 1176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 11:36:55] [INFO ] [Nat]Absence check using 2000 positive place invariants in 487 ms returned sat
[2023-03-14 11:36:58] [INFO ] After 3240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 11:36:59] [INFO ] After 3881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-14 11:36:59] [INFO ] After 5558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 721 steps, including 0 resets, run visited all 2 properties in 123 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 128 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 713 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 66 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:37:00] [INFO ] Invariant cache hit.
[2023-03-14 11:37:02] [INFO ] Implicit Places using invariants in 1594 ms returned []
[2023-03-14 11:37:02] [INFO ] Invariant cache hit.
[2023-03-14 11:37:04] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 3224 ms to find 0 implicit places.
[2023-03-14 11:37:04] [INFO ] Invariant cache hit.
[2023-03-14 11:37:07] [INFO ] Dead Transitions using invariants and state equation in 3140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6430 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2651 ms. (steps per millisecond=3 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1515 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 755 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 11:37:13] [INFO ] Invariant cache hit.
[2023-03-14 11:37:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 456 ms returned sat
[2023-03-14 11:37:15] [INFO ] After 1503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 11:37:16] [INFO ] [Nat]Absence check using 2000 positive place invariants in 458 ms returned sat
[2023-03-14 11:37:19] [INFO ] After 3059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 11:37:20] [INFO ] After 3755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-14 11:37:20] [INFO ] After 5339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 730 steps, including 0 resets, run visited all 2 properties in 185 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 185 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p2) p0 p1))), (F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 5 factoid took 477 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration timeout after 29350 steps with 19 reset in 10004 ms.
Stack based approach found an accepted trace after 26057 steps with 17 reset with depth 1156 and stack size 1156 in 9282 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-12 finished in 82299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 201 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:37:41] [INFO ] Invariant cache hit.
[2023-03-14 11:37:43] [INFO ] Implicit Places using invariants in 2151 ms returned []
[2023-03-14 11:37:43] [INFO ] Invariant cache hit.
[2023-03-14 11:37:46] [INFO ] Implicit Places using invariants and state equation in 2300 ms returned []
Implicit Place search using SMT with State Equation took 4477 ms to find 0 implicit places.
[2023-03-14 11:37:46] [INFO ] Redundant transitions in 232 ms returned []
[2023-03-14 11:37:46] [INFO ] Invariant cache hit.
[2023-03-14 11:37:49] [INFO ] Dead Transitions using invariants and state equation in 3145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8063 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-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:(AND (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 53500 steps with 0 reset in 10002 ms.
Product exploration timeout after 51550 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-14 11:38:12] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 203 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:38:27] [INFO ] Invariant cache hit.
[2023-03-14 11:38:29] [INFO ] Implicit Places using invariants in 2105 ms returned []
[2023-03-14 11:38:29] [INFO ] Invariant cache hit.
[2023-03-14 11:38:31] [INFO ] Implicit Places using invariants and state equation in 2012 ms returned []
Implicit Place search using SMT with State Equation took 4136 ms to find 0 implicit places.
[2023-03-14 11:38:31] [INFO ] Redundant transitions in 213 ms returned []
[2023-03-14 11:38:31] [INFO ] Invariant cache hit.
[2023-03-14 11:38:35] [INFO ] Dead Transitions using invariants and state equation in 3269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7834 ms. Remains : 5000/5000 places, 5000/5000 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 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 76 steps, including 0 resets, run visited all 1 properties in 29 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-14 11:38:37] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration timeout after 47780 steps with 0 reset in 10001 ms.
Product exploration timeout after 47950 steps with 0 reset in 10002 ms.
Built C files in :
/tmp/ltsmin1447387342063199616
[2023-03-14 11:39:12] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 11:39:12] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1447387342063199616
Running compilation step : cd /tmp/ltsmin1447387342063199616;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1447387342063199616;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1447387342063199616;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 150 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 11:39:15] [INFO ] Invariant cache hit.
[2023-03-14 11:39:18] [INFO ] Implicit Places using invariants in 2154 ms returned []
[2023-03-14 11:39:18] [INFO ] Invariant cache hit.
[2023-03-14 11:39:20] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 4284 ms to find 0 implicit places.
[2023-03-14 11:39:20] [INFO ] Redundant transitions in 224 ms returned []
[2023-03-14 11:39:20] [INFO ] Invariant cache hit.
[2023-03-14 11:39:23] [INFO ] Dead Transitions using invariants and state equation in 3010 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7688 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin18354145298175713791
[2023-03-14 11:39:23] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 11:39:23] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18354145298175713791
Running compilation step : cd /tmp/ltsmin18354145298175713791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18354145298175713791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin18354145298175713791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 11:39:26] [INFO ] Flatten gal took : 112 ms
[2023-03-14 11:39:26] [INFO ] Flatten gal took : 119 ms
[2023-03-14 11:39:26] [INFO ] Time to serialize gal into /tmp/LTL10796285090207265667.gal : 20 ms
[2023-03-14 11:39:26] [INFO ] Time to serialize properties into /tmp/LTL317267447008579843.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10796285090207265667.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4834743641802277448.hoa' '-atoms' '/tmp/LTL317267447008579843.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL317267447008579843.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4834743641802277448.hoa
Detected timeout of ITS tools.
[2023-03-14 11:39:42] [INFO ] Flatten gal took : 117 ms
[2023-03-14 11:39:42] [INFO ] Flatten gal took : 120 ms
[2023-03-14 11:39:42] [INFO ] Time to serialize gal into /tmp/LTL16234327470774282713.gal : 19 ms
[2023-03-14 11:39:42] [INFO ] Time to serialize properties into /tmp/LTL6232877375001358707.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16234327470774282713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6232877375001358707.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11)...31707
Formula 0 simplified : GF!"((((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+...31701
Detected timeout of ITS tools.
[2023-03-14 11:39:57] [INFO ] Flatten gal took : 116 ms
[2023-03-14 11:39:57] [INFO ] Applying decomposition
[2023-03-14 11:39:57] [INFO ] Flatten gal took : 117 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10780725233407097909.txt' '-o' '/tmp/graph10780725233407097909.bin' '-w' '/tmp/graph10780725233407097909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10780725233407097909.bin' '-l' '-1' '-v' '-w' '/tmp/graph10780725233407097909.weights' '-q' '0' '-e' '0.001'
[2023-03-14 11:40:03] [INFO ] Decomposing Gal with order
[2023-03-14 11:40:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 11:40:08] [INFO ] Removed a total of 3515 redundant transitions.
[2023-03-14 11:40:08] [INFO ] Flatten gal took : 4441 ms
[2023-03-14 11:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 77 ms.
[2023-03-14 11:40:08] [INFO ] Time to serialize gal into /tmp/LTL17254573210883793322.gal : 31 ms
[2023-03-14 11:40:08] [INFO ] Time to serialize properties into /tmp/LTL15351155576607683847.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17254573210883793322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15351155576607683847.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((((gu0.Think_0+gu0.Think_1)+(gu0.Think_2+gu0.Think_3))+((gu0.Think_4+gu0.Think_5)+(gu0.Think_6+gu0.Think_7)))+(((gu0....47707
Formula 0 simplified : GF!"((((((((((((gu0.Think_0+gu0.Think_1)+(gu0.Think_2+gu0.Think_3))+((gu0.Think_4+gu0.Think_5)+(gu0.Think_6+gu0.Think_7)))+(((gu0.Th...47701
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3982914015012502399
[2023-03-14 11:40:24] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3982914015012502399
Running compilation step : cd /tmp/ltsmin3982914015012502399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3982914015012502399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3982914015012502399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-COL-001000-LTLCardinality-13 finished in 165490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 1000 Post agglomeration using F-continuation condition.Transition count delta: 1000
Deduced a syphon composed of 1000 places in 1 ms
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 4000 transition count 4000
Applied a total of 2000 rules in 512 ms. Remains 4000 /5000 variables (removed 1000) and now considering 4000/5000 (removed 1000) transitions.
// Phase 1: matrix 4000 rows 4000 cols
[2023-03-14 11:40:27] [INFO ] Computed 2000 place invariants in 15 ms
[2023-03-14 11:40:29] [INFO ] Implicit Places using invariants in 2005 ms returned []
[2023-03-14 11:40:29] [INFO ] Invariant cache hit.
[2023-03-14 11:40:32] [INFO ] Implicit Places using invariants and state equation in 2927 ms returned []
Implicit Place search using SMT with State Equation took 4933 ms to find 0 implicit places.
[2023-03-14 11:40:32] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-14 11:40:32] [INFO ] Invariant cache hit.
[2023-03-14 11:40:34] [INFO ] Dead Transitions using invariants and state equation in 2198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4000/5000 places, 4000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7800 ms. Remains : 4000/5000 places, 4000/5000 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 40050 steps with 5667 reset in 10001 ms.
Stack based approach found an accepted trace after 434 steps with 61 reset with depth 3 and stack size 3 in 112 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-15 finished in 17978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||(F(p1)&&F((G(p2)||G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(!p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-14 11:40:45] [INFO ] Flatten gal took : 127 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13493263404579461096
[2023-03-14 11:40:45] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 11:40:45] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13493263404579461096
Running compilation step : cd /tmp/ltsmin13493263404579461096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-14 11:40:45] [INFO ] Applying decomposition
[2023-03-14 11:40:45] [INFO ] Flatten gal took : 130 ms
Compilation finished in 20629 ms.
Running link step : cd /tmp/ltsmin13493263404579461096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin13493263404579461096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](((LTLAPp0==true)&&<>((LTLAPp1==true))))||(<>((LTLAPp1==true))&&<>(([]((LTLAPp2==true))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
[2023-03-14 11:41:09] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15985800408752347831.txt' '-o' '/tmp/graph15985800408752347831.bin' '-w' '/tmp/graph15985800408752347831.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:815)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 11:41:10] [INFO ] Flatten gal took : 345 ms
[2023-03-14 11:41:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality5387860396380617801.gal : 39 ms
[2023-03-14 11:41:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality8952547080100054165.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5387860396380617801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8952547080100054165.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 4 LTL properties
Checking formula 0 : !(((G(("(((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))...83307
Formula 0 simplified : F(!"(((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+(...83291
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13493263404579461096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](((LTLAPp0==true)&&<>((LTLAPp1==true))))||(<>((LTLAPp1==true))&&<>(([]((LTLAPp2==true))||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13493263404579461096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp3==true))||[]((<>((LTLAPp4==true))&&<>([](!(LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2023-03-14 12:06:03] [INFO ] Applying decomposition
[2023-03-14 12:06:03] [INFO ] Flatten gal took : 309 ms
[2023-03-14 12:06:03] [INFO ] Decomposing Gal with order
[2023-03-14 12:06:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 12:06:05] [INFO ] Removed a total of 1000 redundant transitions.
[2023-03-14 12:06:05] [INFO ] Flatten gal took : 643 ms
[2023-03-14 12:06:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 1140 ms.
[2023-03-14 12:06:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality2897927167367141866.gal : 56 ms
[2023-03-14 12:06:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality8522654023566134697.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2897927167367141866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8522654023566134697.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 4 LTL properties
Checking formula 0 : !(((G(("(((((((((((gPhilo0.Think_0+gPhilo1.Think_1)+(gPhilo2.Think_2+gPhilo3.Think_3))+((gPhilo4.Think_4+gPhilo5.Think_5)+(gPhilo6.Thi...152537
Formula 0 simplified : F(!"(((((((((((gPhilo0.Think_0+gPhilo1.Think_1)+(gPhilo2.Think_2+gPhilo3.Think_3))+((gPhilo4.Think_4+gPhilo5.Think_5)+(gPhilo6.Think...152521
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13493263404579461096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp3==true))||[]((<>((LTLAPp4==true))&&<>([](!(LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13493263404579461096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp5==true))&&<>((LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin13493263404579461096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp5==true))&&<>((LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13493263404579461096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp7==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 194448 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15930348 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-001000"
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-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-001000, 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 r293-tall-167873945000139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-001000.tgz
mv Philosophers-COL-001000 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 ;