Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422300262.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Philosophers-COL-000200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422300262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 6.1K Apr 13 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 13 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 13 10:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 13 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18K May 18 16:43 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-000200-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716943787950

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000200
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-29 00:49:50] [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]
[2024-05-29 00:49:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:49:51] [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.
[2024-05-29 00:49:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 00:49:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 905 ms
[2024-05-29 00:49:51] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-29 00:49:52] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 7 ms.
[2024-05-29 00:49:52] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-COL-000200-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10110 steps, including 49 resets, run finished after 42 ms. (steps per millisecond=240 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 5 cols
[2024-05-29 00:49:52] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 00:49:52] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 00:49:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:49:52] [INFO ] After 38ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-29 00:49:52] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-29 00:49:52] [INFO ] Flatten gal took : 29 ms
FORMULA Philosophers-COL-000200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 00:49:52] [INFO ] Flatten gal took : 4 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 200) 200) 200)]] contains successor/predecessor on variables of sort Philo
[2024-05-29 00:49:52] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions 3200 arcs in 77 ms.
[2024-05-29 00:49:52] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 34 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2024-05-29 00:49:53] [INFO ] Computed 400 invariants in 45 ms
[2024-05-29 00:49:53] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-29 00:49:53] [INFO ] Invariant cache hit.
[2024-05-29 00:49:54] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2024-05-29 00:49:54] [INFO ] Invariant cache hit.
[2024-05-29 00:49:56] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3105 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2024-05-29 00:49:56] [INFO ] Flatten gal took : 120 ms
[2024-05-29 00:49:56] [INFO ] Flatten gal took : 108 ms
[2024-05-29 00:49:56] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1060 ms. (steps per millisecond=9 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 00:49:58] [INFO ] Invariant cache hit.
[2024-05-29 00:49:59] [INFO ] [Real]Absence check using 400 positive place invariants in 174 ms returned sat
[2024-05-29 00:50:00] [INFO ] After 883ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 00:50:00] [INFO ] [Nat]Absence check using 400 positive place invariants in 160 ms returned sat
[2024-05-29 00:50:07] [INFO ] After 6371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 00:50:10] [INFO ] After 9168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3238 ms.
[2024-05-29 00:50:13] [INFO ] After 13171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 200 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 87 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-13 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&F(p2))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 156 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:50:13] [INFO ] Invariant cache hit.
[2024-05-29 00:50:14] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-29 00:50:14] [INFO ] Invariant cache hit.
[2024-05-29 00:50:15] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
[2024-05-29 00:50:16] [INFO ] Redundant transitions in 114 ms returned []
[2024-05-29 00:50:16] [INFO ] Invariant cache hit.
[2024-05-29 00:50:17] [INFO ] Dead Transitions using invariants and state equation in 1672 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3902 ms. Remains : 1000/1000 places, 1000/1000 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 381 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 15956 steps with 0 reset in 663 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-00 finished in 5067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 42 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:50:18] [INFO ] Invariant cache hit.
[2024-05-29 00:50:19] [INFO ] Implicit Places using invariants in 739 ms returned []
[2024-05-29 00:50:19] [INFO ] Invariant cache hit.
[2024-05-29 00:50:21] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 2362 ms to find 0 implicit places.
[2024-05-29 00:50:21] [INFO ] Invariant cache hit.
[2024-05-29 00:50:22] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3902 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33175 reset in 5280 ms.
Product exploration explored 100000 steps with 33256 reset in 5235 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) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 329 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
[2024-05-29 00:50:36] [INFO ] Invariant cache hit.
[2024-05-29 00:50:48] [INFO ] [Real]Absence check using 400 positive place invariants in 8143 ms returned unknown
Could not prove EG (NOT p1)
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 800 transition count 800
Applied a total of 400 rules in 182 ms. Remains 800 /1000 variables (removed 200) and now considering 800/1000 (removed 200) transitions.
// Phase 1: matrix 800 rows 800 cols
[2024-05-29 00:50:49] [INFO ] Computed 400 invariants in 4 ms
[2024-05-29 00:50:49] [INFO ] Implicit Places using invariants in 744 ms returned []
[2024-05-29 00:50:49] [INFO ] Invariant cache hit.
[2024-05-29 00:50:51] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
[2024-05-29 00:50:51] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 00:50:51] [INFO ] Invariant cache hit.
[2024-05-29 00:50:52] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/1000 places, 800/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3550 ms. Remains : 800/1000 places, 800/1000 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 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
[2024-05-29 00:50:54] [INFO ] Invariant cache hit.
[2024-05-29 00:51:03] [INFO ] [Real]Absence check using 400 positive place invariants in 6776 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 1 factoid took 299 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000200-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000200-LTLCardinality-01 finished in 45313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X(p1)))||X(p2))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2024-05-29 00:51:04] [INFO ] Computed 400 invariants in 7 ms
[2024-05-29 00:51:04] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-29 00:51:04] [INFO ] Invariant cache hit.
[2024-05-29 00:51:06] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2024-05-29 00:51:06] [INFO ] Invariant cache hit.
[2024-05-29 00:51:07] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3559 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s600 s601 s602 s603 s604 s605 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627 s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 37 reset in 6590 ms.
Product exploration explored 100000 steps with 40 reset in 6766 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 272 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1009 ms. (steps per millisecond=9 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 00:51:25] [INFO ] Invariant cache hit.
[2024-05-29 00:51:25] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND p0 p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 484 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
[2024-05-29 00:51:26] [INFO ] Invariant cache hit.
[2024-05-29 00:51:31] [INFO ] [Real]Absence check using 400 positive place invariants in 646 ms returned sat
[2024-05-29 00:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:51:33] [INFO ] [Real]Absence check using state equation in 2754 ms returned sat
[2024-05-29 00:51:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:51:38] [INFO ] [Nat]Absence check using 400 positive place invariants in 790 ms returned sat
[2024-05-29 00:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:51:41] [INFO ] [Nat]Absence check using state equation in 2720 ms returned sat
[2024-05-29 00:51:41] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 92 ms.
[2024-05-29 00:51:43] [INFO ] Added : 58 causal constraints over 12 iterations in 1687 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:51:43] [INFO ] Invariant cache hit.
[2024-05-29 00:51:44] [INFO ] Implicit Places using invariants in 948 ms returned []
[2024-05-29 00:51:44] [INFO ] Invariant cache hit.
[2024-05-29 00:51:45] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 2486 ms to find 0 implicit places.
[2024-05-29 00:51:45] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 00:51:45] [INFO ] Invariant cache hit.
[2024-05-29 00:51:47] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3930 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 292 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Finished random walk after 2353 steps, including 0 resets, run visited all 3 properties in 92 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 476 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
[2024-05-29 00:51:52] [INFO ] Invariant cache hit.
[2024-05-29 00:51:56] [INFO ] [Real]Absence check using 400 positive place invariants in 595 ms returned sat
[2024-05-29 00:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:51:58] [INFO ] [Real]Absence check using state equation in 2321 ms returned sat
[2024-05-29 00:51:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:52:01] [INFO ] [Nat]Absence check using 400 positive place invariants in 708 ms returned sat
[2024-05-29 00:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:52:04] [INFO ] [Nat]Absence check using state equation in 2719 ms returned sat
[2024-05-29 00:52:04] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 62 ms.
[2024-05-29 00:52:06] [INFO ] Added : 58 causal constraints over 12 iterations in 1386 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Product exploration explored 100000 steps with 38 reset in 5421 ms.
Product exploration explored 100000 steps with 35 reset in 5280 ms.
Built C files in :
/tmp/ltsmin17962879532597511234
[2024-05-29 00:52:17] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 00:52:17] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:52:17] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 00:52:17] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:52:17] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 00:52:17] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:52:17] [INFO ] Built C files in 422ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17962879532597511234
Running compilation step : cd /tmp/ltsmin17962879532597511234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17962879532597511234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17962879532597511234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:52:20] [INFO ] Invariant cache hit.
[2024-05-29 00:52:21] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-29 00:52:21] [INFO ] Invariant cache hit.
[2024-05-29 00:52:22] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2117 ms to find 0 implicit places.
[2024-05-29 00:52:22] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 00:52:22] [INFO ] Invariant cache hit.
[2024-05-29 00:52:24] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3715 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin5553944116391073586
[2024-05-29 00:52:24] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 00:52:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:52:24] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 00:52:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:52:24] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 00:52:24] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:52:24] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5553944116391073586
Running compilation step : cd /tmp/ltsmin5553944116391073586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5553944116391073586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5553944116391073586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-29 00:52:27] [INFO ] Flatten gal took : 67 ms
[2024-05-29 00:52:27] [INFO ] Flatten gal took : 62 ms
[2024-05-29 00:52:27] [INFO ] Time to serialize gal into /tmp/LTL16964806770589369344.gal : 11 ms
[2024-05-29 00:52:27] [INFO ] Time to serialize properties into /tmp/LTL17932606171987816292.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16964806770589369344.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4485629276875435393.hoa' '-atoms' '/tmp/LTL17932606171987816292.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17932606171987816292.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4485629276875435393.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:52:42] [INFO ] Flatten gal took : 51 ms
[2024-05-29 00:52:42] [INFO ] Flatten gal took : 49 ms
[2024-05-29 00:52:43] [INFO ] Time to serialize gal into /tmp/LTL575729435336262327.gal : 7 ms
[2024-05-29 00:52:43] [INFO ] Time to serialize properties into /tmp/LTL17750753470776239810.ltl : 8 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL575729435336262327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17750753470776239810.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((((((((Catch2_0+Catch2_1)+(Catch2_2+Catch2_3))+((Catch2_4+Catch2_5)+(Catch2_6+Catch2_7)))+(((Catch2_8+Catch2_9)+(Catch2_10...12997
Formula 0 simplified : G(F(!"(((((((((Catch2_0+Catch2_1)+(Catch2_2+Catch2_3))+((Catch2_4+Catch2_5)+(Catch2_6+Catch2_7)))+(((Catch2_8+Catch2_9)+(Catch2_10+C...12987
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:52:58] [INFO ] Flatten gal took : 54 ms
[2024-05-29 00:52:58] [INFO ] Applying decomposition
[2024-05-29 00:52:58] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17870326718551048647.txt' '-o' '/tmp/graph17870326718551048647.bin' '-w' '/tmp/graph17870326718551048647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17870326718551048647.bin' '-l' '-1' '-v' '-w' '/tmp/graph17870326718551048647.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:52:59] [INFO ] Decomposing Gal with order
[2024-05-29 00:52:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:53:00] [INFO ] Removed a total of 594 redundant transitions.
[2024-05-29 00:53:00] [INFO ] Flatten gal took : 1200 ms
[2024-05-29 00:53:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-29 00:53:00] [INFO ] Time to serialize gal into /tmp/LTL9996273141271588438.gal : 31 ms
[2024-05-29 00:53:00] [INFO ] Time to serialize properties into /tmp/LTL277030089773728210.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9996273141271588438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL277030089773728210.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((((((((gu199.Catch2_0+gu199.Catch2_1)+(gu199.Catch2_2+gu199.Catch2_3))+((gu199.Catch2_4+gu199.Catch2_5)+(gu199.Catch2_6+gu...19797
Formula 0 simplified : G(F(!"(((((((((gu199.Catch2_0+gu199.Catch2_1)+(gu199.Catch2_2+gu199.Catch2_3))+((gu199.Catch2_4+gu199.Catch2_5)+(gu199.Catch2_6+gu19...19787
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1094880876237568608
[2024-05-29 00:53:16] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1094880876237568608
Running compilation step : cd /tmp/ltsmin1094880876237568608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1094880876237568608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1094880876237568608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-000200-LTLCardinality-02 finished in 134971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:53:19] [INFO ] Invariant cache hit.
[2024-05-29 00:53:20] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-05-29 00:53:20] [INFO ] Invariant cache hit.
[2024-05-29 00:53:21] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2473 ms to find 0 implicit places.
[2024-05-29 00:53:21] [INFO ] Invariant cache hit.
[2024-05-29 00:53:22] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3896 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-04 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:(AND (LEQ 3 (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-04 finished in 4006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0) U p1))||G(p2))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:53:23] [INFO ] Invariant cache hit.
[2024-05-29 00:53:23] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-29 00:53:23] [INFO ] Invariant cache hit.
[2024-05-29 00:53:24] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
[2024-05-29 00:53:24] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 00:53:24] [INFO ] Invariant cache hit.
[2024-05-29 00:53:26] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2979 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(GT (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s2...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10 reset in 6392 ms.
Stack based approach found an accepted trace after 10790 steps with 4 reset with depth 10007 and stack size 9873 in 654 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-06 finished in 10203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X(F(!p0)))))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:53:33] [INFO ] Invariant cache hit.
[2024-05-29 00:53:34] [INFO ] Implicit Places using invariants in 1094 ms returned []
[2024-05-29 00:53:34] [INFO ] Invariant cache hit.
[2024-05-29 00:53:36] [INFO ] Implicit Places using invariants and state equation in 1977 ms returned []
Implicit Place search using SMT with State Equation took 3073 ms to find 0 implicit places.
[2024-05-29 00:53:36] [INFO ] Invariant cache hit.
[2024-05-29 00:53:38] [INFO ] Dead Transitions using invariants and state equation in 1804 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4889 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 123 ms :[p0, p0, p0, true]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 2 (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427...], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 31919 steps with 4 reset in 522 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-07 finished in 5552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:53:38] [INFO ] Invariant cache hit.
[2024-05-29 00:53:39] [INFO ] Implicit Places using invariants in 781 ms returned []
[2024-05-29 00:53:39] [INFO ] Invariant cache hit.
[2024-05-29 00:53:41] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 2399 ms to find 0 implicit places.
[2024-05-29 00:53:41] [INFO ] Invariant cache hit.
[2024-05-29 00:53:43] [INFO ] Dead Transitions using invariants and state equation in 1868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4277 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26 reset in 2985 ms.
Stack based approach found an accepted trace after 581 steps with 0 reset with depth 582 and stack size 582 in 22 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-08 finished in 7473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1)&&F(p2))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:53:46] [INFO ] Invariant cache hit.
[2024-05-29 00:53:47] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-29 00:53:47] [INFO ] Invariant cache hit.
[2024-05-29 00:53:48] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
[2024-05-29 00:53:48] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 00:53:48] [INFO ] Invariant cache hit.
[2024-05-29 00:53:50] [INFO ] Dead Transitions using invariants and state equation in 1343 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3760 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 14123 reset in 6528 ms.
Product exploration explored 100000 steps with 14113 reset in 6723 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 00:54:11] [INFO ] Invariant cache hit.
[2024-05-29 00:54:11] [INFO ] [Real]Absence check using 400 positive place invariants in 115 ms returned sat
[2024-05-29 00:54:11] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-29 00:54:12] [INFO ] [Nat]Absence check using 400 positive place invariants in 179 ms returned sat
[2024-05-29 00:54:18] [INFO ] After 6200ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-29 00:54:25] [INFO ] After 13384ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1024 ms.
[2024-05-29 00:54:26] [INFO ] After 14876ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 200 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 14 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 10 factoid took 221 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), false]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), false]
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 38 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:54:27] [INFO ] Invariant cache hit.
[2024-05-29 00:54:28] [INFO ] Implicit Places using invariants in 858 ms returned []
[2024-05-29 00:54:28] [INFO ] Invariant cache hit.
[2024-05-29 00:54:29] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2024-05-29 00:54:29] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 00:54:29] [INFO ] Invariant cache hit.
[2024-05-29 00:54:31] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3732 ms. Remains : 1000/1000 places, 1000/1000 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 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p0 p2))), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 00:54:39] [INFO ] Invariant cache hit.
[2024-05-29 00:54:39] [INFO ] [Real]Absence check using 400 positive place invariants in 103 ms returned sat
[2024-05-29 00:54:40] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-29 00:54:40] [INFO ] [Nat]Absence check using 400 positive place invariants in 130 ms returned sat
[2024-05-29 00:54:43] [INFO ] After 3333ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-29 00:54:47] [INFO ] After 7023ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1001 ms.
[2024-05-29 00:54:48] [INFO ] After 8398ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 200 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p0 p2))), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (G (NOT (AND p2 (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (AND p2 p0))]
Knowledge based reduction with 10 factoid took 239 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), false]
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), false]
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), false]
Product exploration explored 100000 steps with 14072 reset in 6597 ms.
Product exploration explored 100000 steps with 14088 reset in 6553 ms.
Built C files in :
/tmp/ltsmin3661232352509610531
[2024-05-29 00:55:02] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 00:55:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:55:02] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 00:55:02] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:55:02] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 00:55:02] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:55:02] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3661232352509610531
Running compilation step : cd /tmp/ltsmin3661232352509610531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3661232352509610531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3661232352509610531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:55:05] [INFO ] Invariant cache hit.
[2024-05-29 00:55:06] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-29 00:55:06] [INFO ] Invariant cache hit.
[2024-05-29 00:55:07] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
[2024-05-29 00:55:07] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 00:55:07] [INFO ] Invariant cache hit.
[2024-05-29 00:55:09] [INFO ] Dead Transitions using invariants and state equation in 1393 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3580 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin743663985160460790
[2024-05-29 00:55:09] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 00:55:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:55:09] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 00:55:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:55:09] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 00:55:09] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:55:09] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin743663985160460790
Running compilation step : cd /tmp/ltsmin743663985160460790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin743663985160460790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin743663985160460790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-29 00:55:12] [INFO ] Flatten gal took : 69 ms
[2024-05-29 00:55:12] [INFO ] Flatten gal took : 69 ms
[2024-05-29 00:55:12] [INFO ] Time to serialize gal into /tmp/LTL17663707431939428773.gal : 11 ms
[2024-05-29 00:55:12] [INFO ] Time to serialize properties into /tmp/LTL15453288795343054641.prop : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17663707431939428773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10950498795789322679.hoa' '-atoms' '/tmp/LTL15453288795343054641.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15453288795343054641.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10950498795789322679.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:55:27] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:55:28] [INFO ] Flatten gal took : 38 ms
[2024-05-29 00:55:28] [INFO ] Time to serialize gal into /tmp/LTL7755462870343625828.gal : 7 ms
[2024-05-29 00:55:28] [INFO ] Time to serialize properties into /tmp/LTL9402021956476385192.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7755462870343625828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9402021956476385192.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(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))...9628
Formula 0 simplified : FG!"((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+((...9616
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:55:43] [INFO ] Flatten gal took : 33 ms
[2024-05-29 00:55:43] [INFO ] Applying decomposition
[2024-05-29 00:55:43] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5421663918318676202.txt' '-o' '/tmp/graph5421663918318676202.bin' '-w' '/tmp/graph5421663918318676202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5421663918318676202.bin' '-l' '-1' '-v' '-w' '/tmp/graph5421663918318676202.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:55:43] [INFO ] Decomposing Gal with order
[2024-05-29 00:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:55:44] [INFO ] Removed a total of 378 redundant transitions.
[2024-05-29 00:55:44] [INFO ] Flatten gal took : 710 ms
[2024-05-29 00:55:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 30 ms.
[2024-05-29 00:55:45] [INFO ] Time to serialize gal into /tmp/LTL5881431257567071231.gal : 34 ms
[2024-05-29 00:55:45] [INFO ] Time to serialize properties into /tmp/LTL10619296065730160785.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5881431257567071231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10619296065730160785.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(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.T...13228
Formula 0 simplified : FG!"((((((((((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.Thin...13216
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1990549919996025203
[2024-05-29 00:56:00] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1990549919996025203
Running compilation step : cd /tmp/ltsmin1990549919996025203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1990549919996025203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1990549919996025203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-000200-LTLCardinality-10 finished in 136918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 53 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:56:03] [INFO ] Invariant cache hit.
[2024-05-29 00:56:04] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-29 00:56:04] [INFO ] Invariant cache hit.
[2024-05-29 00:56:05] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2535 ms to find 0 implicit places.
[2024-05-29 00:56:05] [INFO ] Invariant cache hit.
[2024-05-29 00:56:07] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3964 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3754 ms.
Product exploration explored 100000 steps with 50000 reset in 4077 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000200-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000200-LTLCardinality-11 finished in 14526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:56:17] [INFO ] Invariant cache hit.
[2024-05-29 00:56:18] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-29 00:56:18] [INFO ] Invariant cache hit.
[2024-05-29 00:56:19] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
[2024-05-29 00:56:19] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-29 00:56:19] [INFO ] Invariant cache hit.
[2024-05-29 00:56:20] [INFO ] Dead Transitions using invariants and state equation in 1366 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3172 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 543 reset in 5554 ms.
Stack based approach found an accepted trace after 14888 steps with 79 reset with depth 177 and stack size 177 in 825 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-12 finished in 9643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(p1)&&p0))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:56:27] [INFO ] Invariant cache hit.
[2024-05-29 00:56:28] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-29 00:56:28] [INFO ] Invariant cache hit.
[2024-05-29 00:56:29] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
[2024-05-29 00:56:29] [INFO ] Invariant cache hit.
[2024-05-29 00:56:30] [INFO ] Dead Transitions using invariants and state equation in 1286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3535 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (LEQ 3 (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426...], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-14 finished in 3769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1))) U G(p2)))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:56:31] [INFO ] Invariant cache hit.
[2024-05-29 00:56:31] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-05-29 00:56:31] [INFO ] Invariant cache hit.
[2024-05-29 00:56:32] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2024-05-29 00:56:32] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 00:56:32] [INFO ] Invariant cache hit.
[2024-05-29 00:56:34] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3047 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ (ADD s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 35 reset in 5225 ms.
Stack based approach found an accepted trace after 2054 steps with 1 reset with depth 1766 and stack size 1766 in 125 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-15 finished in 8506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X(p1)))||X(p2))))'
Found a Shortening insensitive property : Philosophers-COL-000200-LTLCardinality-02
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:56:39] [INFO ] Invariant cache hit.
[2024-05-29 00:56:40] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-05-29 00:56:40] [INFO ] Invariant cache hit.
[2024-05-29 00:56:42] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
[2024-05-29 00:56:42] [INFO ] Invariant cache hit.
[2024-05-29 00:56:43] [INFO ] Dead Transitions using invariants and state equation in 1250 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3467 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s600 s601 s602 s603 s604 s605 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627 s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 38 reset in 6468 ms.
Product exploration explored 100000 steps with 33 reset in 6662 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1)]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 00:57:00] [INFO ] Invariant cache hit.
[2024-05-29 00:57:01] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND p0 p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 592 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
[2024-05-29 00:57:02] [INFO ] Invariant cache hit.
[2024-05-29 00:57:07] [INFO ] [Real]Absence check using 400 positive place invariants in 907 ms returned sat
[2024-05-29 00:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:57:09] [INFO ] [Real]Absence check using state equation in 2318 ms returned sat
[2024-05-29 00:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:57:14] [INFO ] [Nat]Absence check using 400 positive place invariants in 1034 ms returned sat
[2024-05-29 00:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:57:17] [INFO ] [Nat]Absence check using state equation in 2943 ms returned sat
[2024-05-29 00:57:17] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 63 ms.
[2024-05-29 00:57:19] [INFO ] Added : 58 causal constraints over 12 iterations in 1347 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:57:19] [INFO ] Invariant cache hit.
[2024-05-29 00:57:20] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-05-29 00:57:20] [INFO ] Invariant cache hit.
[2024-05-29 00:57:21] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2024-05-29 00:57:21] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 00:57:21] [INFO ] Invariant cache hit.
[2024-05-29 00:57:23] [INFO ] Dead Transitions using invariants and state equation in 1783 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4150 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 361 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Finished random walk after 2728 steps, including 0 resets, run visited all 3 properties in 158 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 539 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
[2024-05-29 00:57:29] [INFO ] Invariant cache hit.
[2024-05-29 00:57:34] [INFO ] [Real]Absence check using 400 positive place invariants in 605 ms returned sat
[2024-05-29 00:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:57:36] [INFO ] [Real]Absence check using state equation in 2211 ms returned sat
[2024-05-29 00:57:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:57:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 948 ms returned sat
[2024-05-29 00:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:57:44] [INFO ] [Nat]Absence check using state equation in 2924 ms returned sat
[2024-05-29 00:57:44] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 63 ms.
[2024-05-29 00:57:45] [INFO ] Added : 58 causal constraints over 12 iterations in 1328 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), false]
Product exploration explored 100000 steps with 37 reset in 5474 ms.
Product exploration explored 100000 steps with 33 reset in 5454 ms.
Built C files in :
/tmp/ltsmin1540864541530713035
[2024-05-29 00:57:56] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 00:57:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:57:56] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 00:57:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:57:56] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 00:57:56] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:57:56] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1540864541530713035
Running compilation step : cd /tmp/ltsmin1540864541530713035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1540864541530713035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1540864541530713035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-29 00:57:59] [INFO ] Invariant cache hit.
[2024-05-29 00:58:00] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-29 00:58:00] [INFO ] Invariant cache hit.
[2024-05-29 00:58:01] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2024-05-29 00:58:01] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 00:58:01] [INFO ] Invariant cache hit.
[2024-05-29 00:58:03] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3330 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin14737652709058393623
[2024-05-29 00:58:03] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 00:58:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:58:03] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 00:58:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:58:03] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 00:58:03] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:58:03] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14737652709058393623
Running compilation step : cd /tmp/ltsmin14737652709058393623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14737652709058393623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14737652709058393623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-29 00:58:06] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:58:06] [INFO ] Flatten gal took : 29 ms
[2024-05-29 00:58:06] [INFO ] Time to serialize gal into /tmp/LTL5505704831248671105.gal : 7 ms
[2024-05-29 00:58:06] [INFO ] Time to serialize properties into /tmp/LTL5471124191414953850.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5505704831248671105.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13133409362947508212.hoa' '-atoms' '/tmp/LTL5471124191414953850.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5471124191414953850.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13133409362947508212.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:58:21] [INFO ] Flatten gal took : 44 ms
[2024-05-29 00:58:21] [INFO ] Flatten gal took : 44 ms
[2024-05-29 00:58:21] [INFO ] Time to serialize gal into /tmp/LTL10826634605882113917.gal : 11 ms
[2024-05-29 00:58:21] [INFO ] Time to serialize properties into /tmp/LTL7327951972322020191.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10826634605882113917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7327951972322020191.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((((((((Catch2_0+Catch2_1)+(Catch2_2+Catch2_3))+((Catch2_4+Catch2_5)+(Catch2_6+Catch2_7)))+(((Catch2_8+Catch2_9)+(Catch2_10...12997
Formula 0 simplified : G(F(!"(((((((((Catch2_0+Catch2_1)+(Catch2_2+Catch2_3))+((Catch2_4+Catch2_5)+(Catch2_6+Catch2_7)))+(((Catch2_8+Catch2_9)+(Catch2_10+C...12987
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:58:36] [INFO ] Flatten gal took : 28 ms
[2024-05-29 00:58:36] [INFO ] Applying decomposition
[2024-05-29 00:58:36] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4865655280693894434.txt' '-o' '/tmp/graph4865655280693894434.bin' '-w' '/tmp/graph4865655280693894434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4865655280693894434.bin' '-l' '-1' '-v' '-w' '/tmp/graph4865655280693894434.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:58:37] [INFO ] Decomposing Gal with order
[2024-05-29 00:58:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:58:38] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 00:58:38] [INFO ] Flatten gal took : 667 ms
[2024-05-29 00:58:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 00:58:38] [INFO ] Time to serialize gal into /tmp/LTL5543365894697367530.gal : 12 ms
[2024-05-29 00:58:38] [INFO ] Time to serialize properties into /tmp/LTL1703074091650635215.ltl : 1 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5543365894697367530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1703074091650635215.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((((((((gu201.Catch2_0+gu201.Catch2_1)+(gu201.Catch2_2+gu201.Catch2_3))+((gu201.Catch2_4+gu201.Catch2_5)+(gu201.Catch2_6+gu...20197
Formula 0 simplified : G(F(!"(((((((((gu201.Catch2_0+gu201.Catch2_1)+(gu201.Catch2_2+gu201.Catch2_3))+((gu201.Catch2_4+gu201.Catch2_5)+(gu201.Catch2_6+gu20...20187
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18020624608437270153
[2024-05-29 00:58:53] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18020624608437270153
Running compilation step : cd /tmp/ltsmin18020624608437270153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin18020624608437270153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin18020624608437270153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-000200-LTLCardinality-02 finished in 136699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1)&&F(p2))))'
[2024-05-29 00:58:56] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11275610782664844504
[2024-05-29 00:58:56] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-29 00:58:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:58:56] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-29 00:58:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:58:56] [INFO ] Applying decomposition
[2024-05-29 00:58:56] [INFO ] Flatten gal took : 27 ms
[2024-05-29 00:58:56] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-29 00:58:56] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:58:56] [INFO ] Built C files in 318ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11275610782664844504
Running compilation step : cd /tmp/ltsmin11275610782664844504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1264221159598792829.txt' '-o' '/tmp/graph1264221159598792829.bin' '-w' '/tmp/graph1264221159598792829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1264221159598792829.bin' '-l' '-1' '-v' '-w' '/tmp/graph1264221159598792829.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:58:57] [INFO ] Decomposing Gal with order
[2024-05-29 00:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:58:58] [INFO ] Removed a total of 789 redundant transitions.
[2024-05-29 00:58:58] [INFO ] Flatten gal took : 765 ms
[2024-05-29 00:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 00:58:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality11510943697400929678.gal : 14 ms
[2024-05-29 00:58:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality6462067859795146269.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11510943697400929678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6462067859795146269.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F((G(("(((((((((gi2.gu2.Catch2_0+gi2.gu2.Catch2_1)+(gi2.gu2.Catch2_2+gi2.gu2.Catch2_3))+((gi2.gu2.Catch2_4+gi2.gu2.Catch2_5)+(gi2.g...20997
Formula 0 simplified : G(F(!"(((((((((gi2.gu2.Catch2_0+gi2.gu2.Catch2_1)+(gi2.gu2.Catch2_2+gi2.gu2.Catch2_3))+((gi2.gu2.Catch2_4+gi2.gu2.Catch2_5)+(gi2.gu2...20987
Compilation finished in 5106 ms.
Running link step : cd /tmp/ltsmin11275610782664844504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin11275610782664844504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](((LTLAPp0==true)&&X((LTLAPp1==true))))||X((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
LTSmin run took 25731 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11275610782664844504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp3==true)))||(<>((LTLAPp4==true))&&<>((LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 01:21:59] [INFO ] Applying decomposition
[2024-05-29 01:21:59] [INFO ] Flatten gal took : 101 ms
[2024-05-29 01:22:00] [INFO ] Decomposing Gal with order
[2024-05-29 01:22:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 01:22:00] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-29 01:22:00] [INFO ] Flatten gal took : 101 ms
[2024-05-29 01:22:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 61 ms.
[2024-05-29 01:22:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality2701121172358492305.gal : 35 ms
[2024-05-29 01:22:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality15891629551893942045.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2701121172358492305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15891629551893942045.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((((((gPhilo0.Think_0+gPhilo1.Think_1)+(gPhilo2.Think_2+gPhilo3.Think_3))+((gPhilo4.Think_4+gPhilo5.Think_5)+(gPhilo6.Thi...17188
Formula 0 simplified : FG!"((((((((((gPhilo0.Think_0+gPhilo1.Think_1)+(gPhilo2.Think_2+gPhilo3.Think_3))+((gPhilo4.Think_4+gPhilo5.Think_5)+(gPhilo6.Think_...17176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.207: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.218: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.262: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.275: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.283: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.284: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.285: Initializing POR dependencies: labels 1006, guards 1000
pins2lts-mc-linux64( 7/ 8), 0.294: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 45.946: LTL layer: formula: ([](<>((LTLAPp3==true)))||(<>((LTLAPp4==true))&&<>((LTLAPp5==true))))
pins2lts-mc-linux64( 3/ 8), 45.947: "([](<>((LTLAPp3==true)))||(<>((LTLAPp4==true))&&<>((LTLAPp5==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 45.947: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 47.159: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 47.667: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 47.816: There are 1008 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 47.816: State length is 1001, there are 1010 groups
pins2lts-mc-linux64( 0/ 8), 47.816: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 47.816: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 47.816: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 47.816: Visible groups: 0 / 1010, labels: 3 / 1008
pins2lts-mc-linux64( 0/ 8), 47.816: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 47.816: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 72.416: [Blue] ~69 levels ~960 states ~201936 transitions
pins2lts-mc-linux64( 0/ 8), 93.750: [Blue] ~137 levels ~1920 states ~380416 transitions
pins2lts-mc-linux64( 5/ 8), 129.357: [Blue] ~220 levels ~3840 states ~583064 transitions
pins2lts-mc-linux64( 5/ 8), 191.270: [Blue] ~382 levels ~7680 states ~944464 transitions
pins2lts-mc-linux64( 0/ 8), 285.497: [Blue] ~804 levels ~15360 states ~1752272 transitions
pins2lts-mc-linux64( 0/ 8), 446.244: [Blue] ~1619 levels ~30720 states ~3219632 transitions
pins2lts-mc-linux64( 0/ 8), 742.531: [Blue] ~4272 levels ~61440 states ~7745352 transitions
pins2lts-mc-linux64( 0/ 8), 1306.860: [Blue] ~10875 levels ~122880 states ~18702744 transitions
pins2lts-mc-linux64( 4/ 8), 1466.920: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1476.403:
pins2lts-mc-linux64( 0/ 8), 1476.403: Explored 118198 states 19122721 transitions, fanout: 161.785
pins2lts-mc-linux64( 0/ 8), 1476.403: Total exploration time 1428.560 sec (1419.090 sec minimum, 1423.710 sec on average)
pins2lts-mc-linux64( 0/ 8), 1476.403: States per second: 83, Transitions per second: 13386
pins2lts-mc-linux64( 0/ 8), 1476.403:
pins2lts-mc-linux64( 0/ 8), 1476.403: State space has 18637867 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1476.403: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1476.403: blue states: 118198 (0.63%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1476.403: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1476.403: all-red states: 35972 (0.19%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1476.403:
pins2lts-mc-linux64( 0/ 8), 1476.403: Total memory used for local state coloring: 1.3MB
pins2lts-mc-linux64( 0/ 8), 1476.403:
pins2lts-mc-linux64( 0/ 8), 1476.403: Queue width: 8B, total height: 82226, memory: 0.63MB
pins2lts-mc-linux64( 0/ 8), 1476.403: Tree memory: 398.2MB, 22.4 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1476.403: Tree fill ratio (roots/leafs): 13.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 1476.403: Stored 1011 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1476.403: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1476.403: Est. total memory use: 398.8MB (~1024.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11275610782664844504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp3==true)))||(<>((LTLAPp4==true))&&<>((LTLAPp5==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11275610782664844504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp3==true)))||(<>((LTLAPp4==true))&&<>((LTLAPp5==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 01:45:02] [INFO ] Flatten gal took : 29 ms
[2024-05-29 01:45:02] [INFO ] Input system was already deterministic with 1000 transitions.
[2024-05-29 01:45:02] [INFO ] Transformed 1000 places.
[2024-05-29 01:45:02] [INFO ] Transformed 1000 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 01:45:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality3665038868492689909.gal : 6 ms
[2024-05-29 01:45:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality13091594577864067544.ltl : 22 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3665038868492689909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13091594577864067544.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(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))...9628
Formula 0 simplified : FG!"((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+((...9616
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12375120 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15994020 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-000200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-COL-000200, 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 r285-smll-171654422300262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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