Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 28M
-rw-r--r-- 1 mcc users 710K Feb 25 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 25 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 646K Feb 25 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.1M Feb 25 13:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 681K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 307K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 359K Feb 25 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 25 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.2M Feb 25 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 95K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 261K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679471282426

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-001000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:48:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:48:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:48:04] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2023-03-22 07:48:05] [INFO ] Transformed 5000 places.
[2023-03-22 07:48:05] [INFO ] Transformed 5000 transitions.
[2023-03-22 07:48:05] [INFO ] Parsed PT model containing 5000 places and 5000 transitions and 16000 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 77 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-001000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 52 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:48:05] [INFO ] Computed 2000 place invariants in 57 ms
[2023-03-22 07:48:06] [INFO ] Implicit Places using invariants in 968 ms returned []
[2023-03-22 07:48:06] [INFO ] Invariant cache hit.
[2023-03-22 07:48:07] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2023-03-22 07:48:07] [INFO ] Invariant cache hit.
[2023-03-22 07:48:11] [INFO ] Dead Transitions using invariants and state equation in 4031 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5723 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-22 07:48:12] [INFO ] Flatten gal took : 384 ms
[2023-03-22 07:48:13] [INFO ] Flatten gal took : 329 ms
[2023-03-22 07:48:14] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1620 ms. (steps per millisecond=6 ) properties (out of 23) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2304 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3562 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2256 ms. (steps per millisecond=4 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2509 ms. (steps per millisecond=3 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 07:48:26] [INFO ] Invariant cache hit.
[2023-03-22 07:48:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 574 ms returned sat
[2023-03-22 07:48:34] [INFO ] After 2520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 07:48:36] [INFO ] [Nat]Absence check using 2000 positive place invariants in 509 ms returned sat
[2023-03-22 07:48:49] [INFO ] After 10014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 07:48:55] [INFO ] After 15610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4628 ms.
[2023-03-22 07:48:59] [INFO ] After 24778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 980 steps, including 0 resets, run visited all 1 properties in 139 ms. (steps per millisecond=7 )
Parikh walk visited 5 properties in 526 ms.
FORMULA Philosophers-PT-001000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Philosophers-PT-001000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((F(p1)&&X(G(!p2))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 107 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:49:00] [INFO ] Invariant cache hit.
[2023-03-22 07:49:02] [INFO ] Implicit Places using invariants in 1368 ms returned []
[2023-03-22 07:49:02] [INFO ] Invariant cache hit.
[2023-03-22 07:49:03] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
[2023-03-22 07:49:03] [INFO ] Invariant cache hit.
[2023-03-22 07:49:07] [INFO ] Dead Transitions using invariants and state equation in 3807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6527 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 445 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), p2, true, p2, p2]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 3}, { cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4616 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4746 1) (GEQ s3885 1) (GEQ s4957 1) (GEQ s4437 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA Philosophers-PT-001000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-01 finished in 7089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0&&G(F(p1))) U p2)))'
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 95 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:49:07] [INFO ] Invariant cache hit.
[2023-03-22 07:49:08] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-22 07:49:08] [INFO ] Invariant cache hit.
[2023-03-22 07:49:09] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2023-03-22 07:49:09] [INFO ] Redundant transitions in 443 ms returned []
[2023-03-22 07:49:09] [INFO ] Invariant cache hit.
[2023-03-22 07:49:13] [INFO ] Dead Transitions using invariants and state equation in 3827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5596 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s169 1) (GEQ s1227 1)) (AND (GEQ s239 1) (GEQ s1184 1)) (AND (GEQ s59 1) (GEQ s1132 1)) (AND (GEQ s349 1) (GEQ s1279 1)) (AND (GEQ s354 1...], 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 0 reset in 6746 ms.
Product exploration explored 100000 steps with 0 reset in 6575 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR p2 (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1597 ms. (steps per millisecond=6 ) properties (out of 5) seen :1
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5207 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5158 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6002 steps, including 1 resets, run timeout after 5320 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5329 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 4 properties.
[2023-03-22 07:49:50] [INFO ] Invariant cache hit.
[2023-03-22 07:50:10] [INFO ] [Real]Absence check using 2000 positive place invariants in 535 ms returned sat
[2023-03-22 07:50:12] [INFO ] After 6830ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-22 07:50:14] [INFO ] [Nat]Absence check using 2000 positive place invariants in 519 ms returned sat
[2023-03-22 07:50:37] [INFO ] After 12325ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-22 07:50:37] [INFO ] After 12332ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 07:50:37] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 220 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1386 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 7003 steps, including 1 resets, run timeout after 5711 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 9003 steps, including 2 resets, run timeout after 5569 ms. (steps per millisecond=1 ) properties seen 0
Probabilistic random walk after 133743 steps, saw 133663 distinct states, run finished after 36100 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:51:26] [INFO ] Invariant cache hit.
[2023-03-22 07:51:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 528 ms returned sat
[2023-03-22 07:51:37] [INFO ] After 4001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:51:40] [INFO ] [Nat]Absence check using 2000 positive place invariants in 501 ms returned sat
[2023-03-22 07:52:02] [INFO ] After 12510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:52:02] [INFO ] After 12519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 07:52:02] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 48 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 39 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:52:02] [INFO ] Invariant cache hit.
[2023-03-22 07:52:03] [INFO ] Implicit Places using invariants in 620 ms returned []
[2023-03-22 07:52:03] [INFO ] Invariant cache hit.
[2023-03-22 07:52:04] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
[2023-03-22 07:52:04] [INFO ] Redundant transitions in 217 ms returned []
[2023-03-22 07:52:04] [INFO ] Invariant cache hit.
[2023-03-22 07:52:08] [INFO ] Dead Transitions using invariants and state equation in 3991 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5466 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR p2 (NOT p0))), (G (OR (NOT p0) p2)), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 405 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 43 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:52:09] [INFO ] Invariant cache hit.
[2023-03-22 07:52:09] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-22 07:52:09] [INFO ] Invariant cache hit.
[2023-03-22 07:52:10] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2023-03-22 07:52:10] [INFO ] Redundant transitions in 349 ms returned []
[2023-03-22 07:52:10] [INFO ] Invariant cache hit.
[2023-03-22 07:52:14] [INFO ] Dead Transitions using invariants and state equation in 3807 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5410 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1466 ms. (steps per millisecond=6 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5556 ms. (steps per millisecond=1 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3585 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:52:26] [INFO ] Invariant cache hit.
[2023-03-22 07:52:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 491 ms returned sat
[2023-03-22 07:52:36] [INFO ] After 4036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:52:38] [INFO ] [Nat]Absence check using 2000 positive place invariants in 519 ms returned sat
[2023-03-22 07:52:45] [INFO ] After 5535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:52:47] [INFO ] After 7438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1424 ms.
[2023-03-22 07:52:48] [INFO ] After 12661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 970 steps, including 0 resets, run visited all 2 properties in 190 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 192 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p1), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1 reset in 5821 ms.
Product exploration explored 100000 steps with 0 reset in 6217 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 66 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:53:01] [INFO ] Invariant cache hit.
[2023-03-22 07:53:02] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-22 07:53:02] [INFO ] Invariant cache hit.
[2023-03-22 07:53:02] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2023-03-22 07:53:03] [INFO ] Redundant transitions in 221 ms returned []
[2023-03-22 07:53:03] [INFO ] Invariant cache hit.
[2023-03-22 07:53:07] [INFO ] Dead Transitions using invariants and state equation in 3853 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5330 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLFireability-03 finished in 239898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(((!p1 U (p2||G(!p1)))||p0)))))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 225 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:53:07] [INFO ] Invariant cache hit.
[2023-03-22 07:53:09] [INFO ] Implicit Places using invariants in 1979 ms returned []
[2023-03-22 07:53:09] [INFO ] Invariant cache hit.
[2023-03-22 07:53:11] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 3922 ms to find 0 implicit places.
[2023-03-22 07:53:11] [INFO ] Invariant cache hit.
[2023-03-22 07:53:15] [INFO ] Dead Transitions using invariants and state equation in 3810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7975 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p2:(AND (NOT (OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4616 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4746 1) (GEQ s3885 1) (GEQ s4957 1) (GEQ s4437 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 40965 steps with 0 reset in 2294 ms.
FORMULA Philosophers-PT-001000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-05 finished in 10568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 996
Deduced a syphon composed of 996 places in 0 ms
Reduce places removed 996 places and 0 transitions.
Iterating global reduction 0 with 1992 rules applied. Total rules applied 1992 place count 4004 transition count 4004
Applied a total of 1992 rules in 1125 ms. Remains 4004 /5000 variables (removed 996) and now considering 4004/5000 (removed 996) transitions.
// Phase 1: matrix 4004 rows 4004 cols
[2023-03-22 07:53:19] [INFO ] Computed 2000 place invariants in 13 ms
[2023-03-22 07:53:22] [INFO ] Implicit Places using invariants in 2887 ms returned []
[2023-03-22 07:53:22] [INFO ] Invariant cache hit.
[2023-03-22 07:53:26] [INFO ] Implicit Places using invariants and state equation in 4214 ms returned []
Implicit Place search using SMT with State Equation took 7104 ms to find 0 implicit places.
[2023-03-22 07:53:26] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-22 07:53:26] [INFO ] Invariant cache hit.
[2023-03-22 07:53:29] [INFO ] Dead Transitions using invariants and state equation in 2435 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4004/5000 places, 4004/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10817 ms. Remains : 4004/5000 places, 4004/5000 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s56 1) (GEQ s1107 1) (GEQ s1900 1) (GEQ s3599 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 4702 ms.
Stack based approach found an accepted trace after 1329 steps with 0 reset with depth 1330 and stack size 1330 in 315 ms.
FORMULA Philosophers-PT-001000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-09 finished in 15894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1) U p2)))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 253 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:53:34] [INFO ] Computed 2000 place invariants in 19 ms
[2023-03-22 07:53:37] [INFO ] Implicit Places using invariants in 3386 ms returned []
[2023-03-22 07:53:37] [INFO ] Invariant cache hit.
[2023-03-22 07:53:41] [INFO ] Implicit Places using invariants and state equation in 3198 ms returned []
Implicit Place search using SMT with State Equation took 6586 ms to find 0 implicit places.
[2023-03-22 07:53:41] [INFO ] Invariant cache hit.
[2023-03-22 07:53:44] [INFO ] Dead Transitions using invariants and state equation in 3708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10549 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4790 1), p2:(AND (GEQ s682 1) (GEQ s1535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 50660 steps with 11836 reset in 10001 ms.
Product exploration timeout after 49800 steps with 9995 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 133 steps, including 0 resets, run visited all 1 properties in 46 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 322 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:54:05] [INFO ] Invariant cache hit.
[2023-03-22 07:54:09] [INFO ] Implicit Places using invariants in 3477 ms returned []
[2023-03-22 07:54:09] [INFO ] Invariant cache hit.
[2023-03-22 07:54:12] [INFO ] Implicit Places using invariants and state equation in 3419 ms returned []
Implicit Place search using SMT with State Equation took 6897 ms to find 0 implicit places.
[2023-03-22 07:54:12] [INFO ] Invariant cache hit.
[2023-03-22 07:54:16] [INFO ] Dead Transitions using invariants and state equation in 3796 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11019 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 705 steps, including 0 resets, run visited all 1 properties in 186 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 52310 steps with 11933 reset in 10002 ms.
Product exploration timeout after 46410 steps with 12639 reset in 10282 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 997 places in 1 ms
Iterating global reduction 0 with 997 rules applied. Total rules applied 997 place count 5000 transition count 5000
Deduced a syphon composed of 997 places in 1 ms
Applied a total of 997 rules in 1281 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:54:39] [INFO ] Redundant transitions in 218 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:54:39] [INFO ] Computed 2000 place invariants in 17 ms
[2023-03-22 07:54:43] [INFO ] Dead Transitions using invariants and state equation in 3801 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5000/5000 places, 5000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5326 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 234 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:54:43] [INFO ] Computed 2000 place invariants in 16 ms
[2023-03-22 07:54:46] [INFO ] Implicit Places using invariants in 3247 ms returned []
[2023-03-22 07:54:46] [INFO ] Invariant cache hit.
[2023-03-22 07:54:49] [INFO ] Implicit Places using invariants and state equation in 3004 ms returned []
Implicit Place search using SMT with State Equation took 6254 ms to find 0 implicit places.
[2023-03-22 07:54:49] [INFO ] Invariant cache hit.
[2023-03-22 07:54:53] [INFO ] Dead Transitions using invariants and state equation in 3807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10298 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLFireability-10 finished in 79500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&X((F(p2)||G(p1)))))))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 226 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:54:53] [INFO ] Invariant cache hit.
[2023-03-22 07:54:57] [INFO ] Implicit Places using invariants in 3162 ms returned []
[2023-03-22 07:54:57] [INFO ] Invariant cache hit.
[2023-03-22 07:55:00] [INFO ] Implicit Places using invariants and state equation in 3437 ms returned []
Implicit Place search using SMT with State Equation took 6602 ms to find 0 implicit places.
[2023-03-22 07:55:00] [INFO ] Invariant cache hit.
[2023-03-22 07:55:04] [INFO ] Dead Transitions using invariants and state equation in 3865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10695 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1293 1) (LT s2484 1)), p2:(LT s4531 1), p1:(LT s4708 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 44650 steps with 22316 reset in 10002 ms.
Product exploration timeout after 46690 steps with 23339 reset in 10767 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 p2 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1379 ms. (steps per millisecond=7 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 07:55:28] [INFO ] Invariant cache hit.
[2023-03-22 07:55:29] [INFO ] [Real]Absence check using 2000 positive place invariants in 539 ms returned sat
[2023-03-22 07:55:32] [INFO ] After 3271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-22 07:55:32] [INFO ] After 3562ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:55:33] [INFO ] After 4956ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:55:34] [INFO ] [Nat]Absence check using 2000 positive place invariants in 539 ms returned sat
[2023-03-22 07:55:38] [INFO ] After 3623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 07:55:38] [INFO ] After 4429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 474 ms.
[2023-03-22 07:55:39] [INFO ] After 6394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 764 steps, including 0 resets, run visited all 1 properties in 82 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 282 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 252 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:55:40] [INFO ] Invariant cache hit.
[2023-03-22 07:55:43] [INFO ] Implicit Places using invariants in 3390 ms returned []
[2023-03-22 07:55:43] [INFO ] Invariant cache hit.
[2023-03-22 07:55:47] [INFO ] Implicit Places using invariants and state equation in 3404 ms returned []
Implicit Place search using SMT with State Equation took 6800 ms to find 0 implicit places.
[2023-03-22 07:55:47] [INFO ] Invariant cache hit.
[2023-03-22 07:55:51] [INFO ] Dead Transitions using invariants and state equation in 3805 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10858 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1324 ms. (steps per millisecond=7 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 07:55:53] [INFO ] Invariant cache hit.
[2023-03-22 07:55:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 535 ms returned sat
[2023-03-22 07:55:58] [INFO ] After 3164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-22 07:55:58] [INFO ] After 3435ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-22 07:55:58] [INFO ] After 4975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-22 07:55:59] [INFO ] [Nat]Absence check using 2000 positive place invariants in 536 ms returned sat
[2023-03-22 07:56:03] [INFO ] After 3474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 07:56:04] [INFO ] After 4265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 455 ms.
[2023-03-22 07:56:04] [INFO ] After 6179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 316 steps, including 0 resets, run visited all 1 properties in 49 ms. (steps per millisecond=6 )
Parikh walk visited 3 properties in 213 ms.
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration timeout after 44920 steps with 22452 reset in 10001 ms.
Product exploration timeout after 45690 steps with 22837 reset in 10591 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 996 places in 1 ms
Iterating global reduction 0 with 996 rules applied. Total rules applied 996 place count 5000 transition count 5000
Deduced a syphon composed of 996 places in 0 ms
Applied a total of 996 rules in 710 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:56:27] [INFO ] Redundant transitions in 223 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:56:27] [INFO ] Computed 2000 place invariants in 15 ms
[2023-03-22 07:56:31] [INFO ] Dead Transitions using invariants and state equation in 3678 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5000/5000 places, 5000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4620 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 315 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:56:31] [INFO ] Computed 2000 place invariants in 15 ms
[2023-03-22 07:56:35] [INFO ] Implicit Places using invariants in 3486 ms returned []
[2023-03-22 07:56:35] [INFO ] Invariant cache hit.
[2023-03-22 07:56:38] [INFO ] Implicit Places using invariants and state equation in 3415 ms returned []
Implicit Place search using SMT with State Equation took 6903 ms to find 0 implicit places.
[2023-03-22 07:56:38] [INFO ] Invariant cache hit.
[2023-03-22 07:56:42] [INFO ] Dead Transitions using invariants and state equation in 3768 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10986 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLFireability-11 finished in 108870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))||(!X(X(p1)) U p2))))'
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 296 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:56:42] [INFO ] Invariant cache hit.
[2023-03-22 07:56:46] [INFO ] Implicit Places using invariants in 3328 ms returned []
[2023-03-22 07:56:46] [INFO ] Invariant cache hit.
[2023-03-22 07:56:49] [INFO ] Implicit Places using invariants and state equation in 3332 ms returned []
Implicit Place search using SMT with State Equation took 6662 ms to find 0 implicit places.
[2023-03-22 07:56:49] [INFO ] Invariant cache hit.
[2023-03-22 07:56:53] [INFO ] Dead Transitions using invariants and state equation in 3709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10668 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s557 1) (GEQ s1446 1)), p0:(OR (LT s71 1) (LT s1146 1)), p1:(AND (GEQ s1541 1) (GEQ s3785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 41400 steps with 84 reset in 10002 ms.
Product exploration timeout after 68150 steps with 54 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1402 ms. (steps per millisecond=7 ) properties (out of 5) seen :3
Finished Best-First random walk after 2001 steps, including 0 resets, run visited all 2 properties in 62 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F p1), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 249 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 248 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:57:16] [INFO ] Invariant cache hit.
[2023-03-22 07:57:19] [INFO ] Implicit Places using invariants in 3323 ms returned []
[2023-03-22 07:57:19] [INFO ] Invariant cache hit.
[2023-03-22 07:57:23] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 6695 ms to find 0 implicit places.
[2023-03-22 07:57:23] [INFO ] Invariant cache hit.
[2023-03-22 07:57:27] [INFO ] Dead Transitions using invariants and state equation in 3828 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10773 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1258 ms. (steps per millisecond=7 ) properties (out of 5) seen :4
Finished Best-First random walk after 2001 steps, including 0 resets, run visited all 1 properties in 60 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p1), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Product exploration timeout after 60560 steps with 56 reset in 10002 ms.
Product exploration timeout after 58300 steps with 63 reset in 10002 ms.
Applying partial POR strategy [false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 994 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 994 places in 0 ms
Iterating global reduction 0 with 994 rules applied. Total rules applied 994 place count 5000 transition count 5000
Deduced a syphon composed of 994 places in 0 ms
Applied a total of 994 rules in 645 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:57:51] [INFO ] Redundant transitions in 215 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:57:51] [INFO ] Computed 2000 place invariants in 16 ms
[2023-03-22 07:57:54] [INFO ] Dead Transitions using invariants and state equation in 3692 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5000/5000 places, 5000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4558 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 250 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:57:55] [INFO ] Computed 2000 place invariants in 15 ms
[2023-03-22 07:57:58] [INFO ] Implicit Places using invariants in 3319 ms returned []
[2023-03-22 07:57:58] [INFO ] Invariant cache hit.
[2023-03-22 07:58:01] [INFO ] Implicit Places using invariants and state equation in 3060 ms returned []
Implicit Place search using SMT with State Equation took 6382 ms to find 0 implicit places.
[2023-03-22 07:58:01] [INFO ] Invariant cache hit.
[2023-03-22 07:58:05] [INFO ] Dead Transitions using invariants and state equation in 3786 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10420 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLFireability-12 finished in 82972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 259 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:58:05] [INFO ] Invariant cache hit.
[2023-03-22 07:58:08] [INFO ] Implicit Places using invariants in 3131 ms returned []
[2023-03-22 07:58:08] [INFO ] Invariant cache hit.
[2023-03-22 07:58:12] [INFO ] Implicit Places using invariants and state equation in 3226 ms returned []
Implicit Place search using SMT with State Equation took 6357 ms to find 0 implicit places.
[2023-03-22 07:58:12] [INFO ] Invariant cache hit.
[2023-03-22 07:58:15] [INFO ] Dead Transitions using invariants and state equation in 3670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10287 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4844 1) (GEQ s3902 1)), p0:(GEQ s3902 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15 reset in 8335 ms.
Stack based approach found an accepted trace after 20303 steps with 1 reset with depth 11406 and stack size 11180 in 1586 ms.
FORMULA Philosophers-PT-001000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-13 finished in 20333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 1 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 0 with 1994 rules applied. Total rules applied 1994 place count 4003 transition count 4003
Applied a total of 1994 rules in 624 ms. Remains 4003 /5000 variables (removed 997) and now considering 4003/5000 (removed 997) transitions.
// Phase 1: matrix 4003 rows 4003 cols
[2023-03-22 07:58:26] [INFO ] Computed 2000 place invariants in 16 ms
[2023-03-22 07:58:29] [INFO ] Implicit Places using invariants in 2786 ms returned []
[2023-03-22 07:58:29] [INFO ] Invariant cache hit.
[2023-03-22 07:58:33] [INFO ] Implicit Places using invariants and state equation in 3848 ms returned []
Implicit Place search using SMT with State Equation took 6640 ms to find 0 implicit places.
[2023-03-22 07:58:33] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-22 07:58:33] [INFO ] Invariant cache hit.
[2023-03-22 07:58:35] [INFO ] Dead Transitions using invariants and state equation in 2562 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4003/5000 places, 4003/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9990 ms. Remains : 4003/5000 places, 4003/5000 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s4002 1) (NOT (AND (GEQ s1680 1) (GEQ s3632 1)))), p0:(LT s4002 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 85760 steps with 18 reset in 10001 ms.
Stack based approach found an accepted trace after 81895 steps with 3 reset with depth 6698 and stack size 6682 in 5416 ms.
FORMULA Philosophers-PT-001000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-14 finished in 25488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0&&G(F(p1))) U p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1) U p2)))))'
Found a Shortening insensitive property : Philosophers-PT-001000-LTLFireability-10
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 995 Post agglomeration using F-continuation condition.Transition count delta: 995
Deduced a syphon composed of 995 places in 0 ms
Reduce places removed 995 places and 0 transitions.
Iterating global reduction 0 with 1990 rules applied. Total rules applied 1990 place count 4005 transition count 4005
Applied a total of 1990 rules in 598 ms. Remains 4005 /5000 variables (removed 995) and now considering 4005/5000 (removed 995) transitions.
// Phase 1: matrix 4005 rows 4005 cols
[2023-03-22 07:58:52] [INFO ] Computed 2000 place invariants in 11 ms
[2023-03-22 07:58:55] [INFO ] Implicit Places using invariants in 2880 ms returned []
[2023-03-22 07:58:55] [INFO ] Invariant cache hit.
[2023-03-22 07:58:59] [INFO ] Implicit Places using invariants and state equation in 4093 ms returned []
Implicit Place search using SMT with State Equation took 6974 ms to find 0 implicit places.
[2023-03-22 07:58:59] [INFO ] Invariant cache hit.
[2023-03-22 07:59:01] [INFO ] Dead Transitions using invariants and state equation in 2542 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4005/5000 places, 4005/5000 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10114 ms. Remains : 4005/5000 places, 4005/5000 transitions.
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4004 1), p2:(AND (GEQ s682 1) (GEQ s1535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 54020 steps with 9585 reset in 10280 ms.
Stack based approach found an accepted trace after 9380 steps with 4102 reset with depth 322 and stack size 322 in 2126 ms.
Treatment of property Philosophers-PT-001000-LTLFireability-10 finished in 22691 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&X((F(p2)||G(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))||(!X(X(p1)) U p2))))'
[2023-03-22 07:59:14] [INFO ] Flatten gal took : 201 ms
[2023-03-22 07:59:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2023-03-22 07:59:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 5000 transitions and 16000 arcs took 21 ms.
Total runtime 669950 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1769/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 8087768 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16046600 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1769/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1769/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1769/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Philosophers-PT-001000-LTLFireability-03
Could not compute solution for formula : Philosophers-PT-001000-LTLFireability-10
Could not compute solution for formula : Philosophers-PT-001000-LTLFireability-11
Could not compute solution for formula : Philosophers-PT-001000-LTLFireability-12

BK_STOP 1679472858307

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Philosophers-PT-001000-LTLFireability-03
ltl formula formula --ltl=/tmp/1769/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1769/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1769/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1769/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.630 real 0.310 user 0.260 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1769/ltl_0_
Killing (15) : 1775 1776 1777 1778 1779
Killing (9) : 1775 1776 1777 1778 1779
ltl formula name Philosophers-PT-001000-LTLFireability-10
ltl formula formula --ltl=/tmp/1769/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.170 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1769/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1769/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1769/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1769/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Philosophers-PT-001000-LTLFireability-11
ltl formula formula --ltl=/tmp/1769/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.150 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1769/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1769/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1769/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1769/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Philosophers-PT-001000-LTLFireability-12
ltl formula formula --ltl=/tmp/1769/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1769/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1769/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1769/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.170 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1769/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-PT-001000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950200244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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