About the Execution of LoLa+red for Philosophers-COL-002000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12835.020 | 970104.00 | 1173043.00 | 5246.40 | FFTFFTFFTTFFFFFF | normal |
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.r295-tall-167873947500147.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 lolaxred
Input is Philosophers-COL-002000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947500147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 14:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:21 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 3.9K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 20:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 96K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-00
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-01
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-02
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-03
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-04
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-05
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-06
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-07
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-08
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-09
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-10
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-11
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-12
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-13
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-14
FORMULA_NAME Philosophers-COL-002000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678787666734
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-002000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 09:54:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:54:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:54:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 09:54:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 09:54:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2023-03-14 09:54:28] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 10000 PT places and 10000.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 09:54:28] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-14 09:54:28] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-002000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-002000-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10009 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 09:54:29] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-14 09:54:29] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:54:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 09:54:29] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 09:54:29] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-14 09:54:29] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2001 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=200 )
Parikh walk visited 1 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Philosophers-COL-002000-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 09:54:29] [INFO ] Flatten gal took : 15 ms
[2023-03-14 09:54:29] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 2000) 2000) 2000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 09:54:29] [INFO ] Unfolded HLPN to a Petri net with 10000 places and 10000 transitions 32000 arcs in 144 ms.
[2023-03-14 09:54:29] [INFO ] Unfolded 12 HLPN properties in 9 ms.
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 72 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 09:54:30] [INFO ] Computed 4000 place invariants in 87 ms
[2023-03-14 09:54:31] [INFO ] Implicit Places using invariants in 1099 ms returned []
Implicit Place search using SMT only with invariants took 1100 ms to find 0 implicit places.
[2023-03-14 09:54:31] [INFO ] Invariant cache hit.
[2023-03-14 09:54:32] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2226 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 10000 out of 10000 places after structural reductions.
[2023-03-14 09:54:33] [INFO ] Flatten gal took : 600 ms
[2023-03-14 09:54:34] [INFO ] Flatten gal took : 385 ms
[2023-03-14 09:54:35] [INFO ] Input system was already deterministic with 10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7624 ms. (steps per millisecond=1 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1651 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1658 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1615 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1684 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 09:54:50] [INFO ] Invariant cache hit.
[2023-03-14 09:54:53] [INFO ] [Real]Absence check using 4000 positive place invariants in 1343 ms returned sat
[2023-03-14 09:54:55] [INFO ] After 4757ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 09:54:58] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1466 ms returned sat
[2023-03-14 09:55:20] [INFO ] After 17260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 09:55:20] [INFO ] After 17285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-14 09:55:20] [INFO ] After 25092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 1808 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Free-agglomeration rule (complex) applied 2000 times.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 10000 transition count 8000
Reduce places removed 2000 places and 0 transitions.
Iterating post reduction 0 with 2000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Applied a total of 4000 rules in 1629 ms. Remains 8000 /10000 variables (removed 2000) and now considering 8000/10000 (removed 2000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1630 ms. Remains : 8000/10000 places, 8000/10000 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(G((p1 U p2))||G(p0)))))'
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 170 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:55:24] [INFO ] Invariant cache hit.
[2023-03-14 09:55:25] [INFO ] Implicit Places using invariants in 1042 ms returned []
Implicit Place search using SMT only with invariants took 1046 ms to find 0 implicit places.
[2023-03-14 09:55:26] [INFO ] Invariant cache hit.
[2023-03-14 09:55:26] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2183 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 11550 steps with 0 reset in 10002 ms.
Product exploration timeout after 11670 steps with 0 reset in 10005 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 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 450 ms. Reduced automaton from 3 states, 14 edges and 3 AP (stutter insensitive) to 3 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4938 ms. (steps per millisecond=2 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3205 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:56:01] [INFO ] Invariant cache hit.
[2023-03-14 09:56:05] [INFO ] [Real]Absence check using 4000 positive place invariants in 1357 ms returned sat
[2023-03-14 09:56:08] [INFO ] After 5620ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 623 ms. Reduced automaton from 3 states, 14 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 207 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:56:09] [INFO ] Invariant cache hit.
[2023-03-14 09:56:10] [INFO ] Implicit Places using invariants in 915 ms returned []
Implicit Place search using SMT only with invariants took 918 ms to find 0 implicit places.
[2023-03-14 09:56:10] [INFO ] Invariant cache hit.
[2023-03-14 09:56:11] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1968 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Finished random walk after 177 steps, including 0 resets, run visited all 6 properties in 201 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) p2) (AND (NOT p2) p1))), (F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 517 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Product exploration timeout after 18840 steps with 0 reset in 10004 ms.
Product exploration timeout after 18650 steps with 0 reset in 10002 ms.
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 133 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:56:36] [INFO ] Invariant cache hit.
[2023-03-14 09:56:37] [INFO ] Implicit Places using invariants in 1045 ms returned []
Implicit Place search using SMT only with invariants took 1046 ms to find 0 implicit places.
[2023-03-14 09:56:37] [INFO ] Invariant cache hit.
[2023-03-14 09:56:38] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2103 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-00 finished in 75249 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)))'
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1124 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:56:41] [INFO ] Invariant cache hit.
[2023-03-14 09:56:42] [INFO ] Implicit Places using invariants in 984 ms returned []
Implicit Place search using SMT only with invariants took 992 ms to find 0 implicit places.
[2023-03-14 09:56:42] [INFO ] Invariant cache hit.
[2023-03-14 09:56:42] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3014 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s8000 s8001 s8002 s8003 s8004 s8005 s8006 s8007 s8008 s8009 s8010 s8011 s8012 s8013 s8014 s8015 s8016 s8017 s8018 s8019 s8020 s8021 s8022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 16150 steps with 108 reset in 10006 ms.
Product exploration timeout after 15700 steps with 109 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 187 steps, including 0 resets, run visited all 1 properties in 128 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2023-03-14 09:57:06] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 769 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:57:22] [INFO ] Invariant cache hit.
[2023-03-14 09:57:23] [INFO ] Implicit Places using invariants in 1047 ms returned []
Implicit Place search using SMT only with invariants took 1049 ms to find 0 implicit places.
[2023-03-14 09:57:23] [INFO ] Invariant cache hit.
[2023-03-14 09:57:24] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2865 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 187 steps, including 0 resets, run visited all 1 properties in 131 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-14 09:57:26] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 15990 steps with 105 reset in 10005 ms.
Product exploration timeout after 15430 steps with 102 reset in 10006 ms.
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 780 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:58:02] [INFO ] Invariant cache hit.
[2023-03-14 09:58:03] [INFO ] Implicit Places using invariants in 1047 ms returned []
Implicit Place search using SMT only with invariants took 1070 ms to find 0 implicit places.
[2023-03-14 09:58:03] [INFO ] Invariant cache hit.
[2023-03-14 09:58:04] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2716 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-01 finished in 85233 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(p1))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 340 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:58:05] [INFO ] Invariant cache hit.
[2023-03-14 09:58:06] [INFO ] Implicit Places using invariants in 936 ms returned []
Implicit Place search using SMT only with invariants took 951 ms to find 0 implicit places.
[2023-03-14 09:58:06] [INFO ] Invariant cache hit.
[2023-03-14 09:58:07] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2156 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ (ADD s6000 s6001 s6002 s6003 s6004 s6005 s6006 s6007 s6008 s6009 s6010 s6011 s6012 s6013 s6014 s6015 s6016 s6017 s6018 s6019 s6020 s6021 s6022 s60...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2620 steps with 0 reset in 2245 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-03 finished in 4541 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(!p0)||(G(p1) U p0))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 538 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:58:10] [INFO ] Invariant cache hit.
[2023-03-14 09:58:11] [INFO ] Implicit Places using invariants in 932 ms returned []
Implicit Place search using SMT only with invariants took 944 ms to find 0 implicit places.
[2023-03-14 09:58:11] [INFO ] Invariant cache hit.
[2023-03-14 09:58:12] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2304 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, false, (AND (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ (ADD s6000 s6001 s6002 s6003 s6004 s6005 s6006 s6007 s6008 s6009 s6010 s6011 s6012 s6013 s6014 s6015 s6016 s6017 s6018 s6019 s6020 s6021 s6022 s60...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2882 steps with 0 reset in 2386 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-04 finished in 5017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 565 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:58:15] [INFO ] Invariant cache hit.
[2023-03-14 09:58:16] [INFO ] Implicit Places using invariants in 880 ms returned []
Implicit Place search using SMT only with invariants took 891 ms to find 0 implicit places.
[2023-03-14 09:58:16] [INFO ] Invariant cache hit.
[2023-03-14 09:58:17] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2306 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 2 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s202...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 25500 steps with 0 reset in 10003 ms.
Product exploration timeout after 24270 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 450 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:58:38] [INFO ] Invariant cache hit.
[2023-03-14 09:58:39] [INFO ] Implicit Places using invariants in 997 ms returned []
Implicit Place search using SMT only with invariants took 1001 ms to find 0 implicit places.
[2023-03-14 09:58:39] [INFO ] Invariant cache hit.
[2023-03-14 09:58:40] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2404 ms. Remains : 10000/10000 places, 10000/10000 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 : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration timeout after 24730 steps with 0 reset in 10002 ms.
Product exploration timeout after 23680 steps with 0 reset in 10003 ms.
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 443 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:59:02] [INFO ] Invariant cache hit.
[2023-03-14 09:59:03] [INFO ] Implicit Places using invariants in 1059 ms returned []
Implicit Place search using SMT only with invariants took 1061 ms to find 0 implicit places.
[2023-03-14 09:59:03] [INFO ] Invariant cache hit.
[2023-03-14 09:59:04] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2532 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-07 finished in 50407 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((p0||G(p1)||F((G(F(p2))||(!p0&&F(p2)))))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 343 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 09:59:05] [INFO ] Invariant cache hit.
[2023-03-14 09:59:06] [INFO ] Implicit Places using invariants in 1038 ms returned []
Implicit Place search using SMT only with invariants took 1039 ms to find 0 implicit places.
[2023-03-14 09:59:06] [INFO ] Invariant cache hit.
[2023-03-14 09:59:07] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2403 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(GT 2 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 20040 steps with 10020 reset in 10002 ms.
Product exploration timeout after 19390 steps with 9695 reset in 10004 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 p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-002000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-002000-LTLCardinality-08 finished in 24018 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)))'
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: 2000
Deduced a syphon composed of 2000 places in 2 ms
Reduce places removed 2000 places and 0 transitions.
Iterating global reduction 0 with 4000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Applied a total of 4000 rules in 1671 ms. Remains 8000 /10000 variables (removed 2000) and now considering 8000/10000 (removed 2000) transitions.
// Phase 1: matrix 8000 rows 8000 cols
[2023-03-14 09:59:30] [INFO ] Computed 4000 place invariants in 29 ms
[2023-03-14 09:59:36] [INFO ] Implicit Places using invariants in 5228 ms returned []
[2023-03-14 09:59:36] [INFO ] Invariant cache hit.
[2023-03-14 09:59:41] [INFO ] Implicit Places using invariants and state equation in 5478 ms returned []
Implicit Place search using SMT with State Equation took 10710 ms to find 0 implicit places.
[2023-03-14 09:59:42] [INFO ] Redundant transitions in 1089 ms returned []
[2023-03-14 09:59:42] [INFO ] Invariant cache hit.
[2023-03-14 09:59:48] [INFO ] Dead Transitions using invariants and state equation in 6184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8000/10000 places, 8000/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19672 ms. Remains : 8000/10000 places, 8000/10000 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 49080 steps with 15 reset in 10002 ms.
Product exploration timeout after 43280 steps with 7 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2023-03-14 10:00:10] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 8000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8000/8000 places, 8000/8000 transitions.
Applied a total of 0 rules in 384 ms. Remains 8000 /8000 variables (removed 0) and now considering 8000/8000 (removed 0) transitions.
[2023-03-14 10:00:26] [INFO ] Invariant cache hit.
[2023-03-14 10:00:31] [INFO ] Implicit Places using invariants in 5328 ms returned []
[2023-03-14 10:00:31] [INFO ] Invariant cache hit.
[2023-03-14 10:00:37] [INFO ] Implicit Places using invariants and state equation in 5274 ms returned []
Implicit Place search using SMT with State Equation took 10607 ms to find 0 implicit places.
[2023-03-14 10:00:38] [INFO ] Redundant transitions in 1060 ms returned []
[2023-03-14 10:00:38] [INFO ] Invariant cache hit.
[2023-03-14 10:00:44] [INFO ] Dead Transitions using invariants and state equation in 6425 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18489 ms. Remains : 8000/8000 places, 8000/8000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2023-03-14 10:00:46] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 48370 steps with 51 reset in 10002 ms.
Product exploration timeout after 44360 steps with 36 reset in 10001 ms.
Support contains 2000 out of 8000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8000/8000 places, 8000/8000 transitions.
Applied a total of 0 rules in 397 ms. Remains 8000 /8000 variables (removed 0) and now considering 8000/8000 (removed 0) transitions.
[2023-03-14 10:01:22] [INFO ] Invariant cache hit.
[2023-03-14 10:01:27] [INFO ] Implicit Places using invariants in 5162 ms returned []
[2023-03-14 10:01:27] [INFO ] Invariant cache hit.
[2023-03-14 10:01:32] [INFO ] Implicit Places using invariants and state equation in 5140 ms returned []
Implicit Place search using SMT with State Equation took 10320 ms to find 0 implicit places.
[2023-03-14 10:01:33] [INFO ] Redundant transitions in 913 ms returned []
[2023-03-14 10:01:33] [INFO ] Invariant cache hit.
[2023-03-14 10:01:39] [INFO ] Dead Transitions using invariants and state equation in 6291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17930 ms. Remains : 8000/8000 places, 8000/8000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-10 finished in 130846 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)))'
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 624 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 10:01:40] [INFO ] Computed 4000 place invariants in 36 ms
[2023-03-14 10:01:41] [INFO ] Implicit Places using invariants in 995 ms returned []
Implicit Place search using SMT only with invariants took 996 ms to find 0 implicit places.
[2023-03-14 10:01:41] [INFO ] Invariant cache hit.
[2023-03-14 10:01:42] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2556 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s8000 s8001 s8002 s8003 s8004 s8005 s8006 s8007 s8008 s8009 s8010 s8011 s8012 s8013 s8014 s8015 s8016 s8017 s8018 s8019 s8020 s8021 s8022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 15970 steps with 106 reset in 10005 ms.
Product exploration timeout after 15420 steps with 106 reset in 10006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 152 steps, including 0 resets, run visited all 1 properties in 96 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-14 10:02:05] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 796 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 10:02:21] [INFO ] Invariant cache hit.
[2023-03-14 10:02:22] [INFO ] Implicit Places using invariants in 826 ms returned []
Implicit Place search using SMT only with invariants took 830 ms to find 0 implicit places.
[2023-03-14 10:02:22] [INFO ] Invariant cache hit.
[2023-03-14 10:02:23] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2649 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 98 steps, including 0 resets, run visited all 1 properties in 63 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-14 10:02:25] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration timeout after 15400 steps with 102 reset in 10002 ms.
Product exploration timeout after 15480 steps with 103 reset in 10004 ms.
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 683 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 10:03:01] [INFO ] Invariant cache hit.
[2023-03-14 10:03:02] [INFO ] Implicit Places using invariants in 1041 ms returned []
Implicit Place search using SMT only with invariants took 1044 ms to find 0 implicit places.
[2023-03-14 10:03:02] [INFO ] Invariant cache hit.
[2023-03-14 10:03:03] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2679 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-11 finished in 83665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||F(p1))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 286 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 10:03:03] [INFO ] Invariant cache hit.
[2023-03-14 10:03:04] [INFO ] Implicit Places using invariants in 934 ms returned []
Implicit Place search using SMT only with invariants took 939 ms to find 0 implicit places.
[2023-03-14 10:03:04] [INFO ] Invariant cache hit.
[2023-03-14 10:03:05] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2088 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT 3 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 74910 steps with 0 reset in 10001 ms.
Product exploration timeout after 67180 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4037 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1566 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Probabilistic random walk after 84920 steps, saw 84877 distinct states, run finished after 15115 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:03:48] [INFO ] Invariant cache hit.
[2023-03-14 10:03:51] [INFO ] [Real]Absence check using 4000 positive place invariants in 1274 ms returned sat
[2023-03-14 10:03:51] [INFO ] After 2672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:03:53] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1305 ms returned sat
[2023-03-14 10:04:05] [INFO ] After 11028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:04:05] [INFO ] After 11655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-14 10:04:06] [INFO ] After 14660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1998 steps, including 0 resets, run visited all 1 properties in 628 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 632 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
[2023-03-14 10:04:09] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 2000 out of 10000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 371 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 10:04:25] [INFO ] Invariant cache hit.
[2023-03-14 10:04:25] [INFO ] Implicit Places using invariants in 826 ms returned []
Implicit Place search using SMT only with invariants took 834 ms to find 0 implicit places.
[2023-03-14 10:04:25] [INFO ] Invariant cache hit.
[2023-03-14 10:04:26] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2131 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4020 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1484 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Probabilistic random walk after 86920 steps, saw 86877 distinct states, run finished after 15139 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 10:04:48] [INFO ] Invariant cache hit.
[2023-03-14 10:04:50] [INFO ] [Real]Absence check using 4000 positive place invariants in 1346 ms returned sat
[2023-03-14 10:04:51] [INFO ] After 2834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:04:53] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1337 ms returned sat
[2023-03-14 10:05:04] [INFO ] After 10834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:05:05] [INFO ] After 11386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-03-14 10:05:05] [INFO ] After 14443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1998 steps, including 0 resets, run visited all 1 properties in 651 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 660 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
[2023-03-14 10:05:08] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Product exploration timeout after 76480 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 11224 steps with 0 reset with depth 11225 and stack size 5218 in 2919 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-12 finished in 153267 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 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: 2000
Deduced a syphon composed of 2000 places in 1 ms
Reduce places removed 2000 places and 0 transitions.
Iterating global reduction 0 with 4000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Applied a total of 4000 rules in 1486 ms. Remains 8000 /10000 variables (removed 2000) and now considering 8000/10000 (removed 2000) transitions.
// Phase 1: matrix 8000 rows 8000 cols
[2023-03-14 10:05:38] [INFO ] Computed 4000 place invariants in 19 ms
[2023-03-14 10:05:43] [INFO ] Implicit Places using invariants in 5419 ms returned []
[2023-03-14 10:05:43] [INFO ] Invariant cache hit.
[2023-03-14 10:05:44] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 6277 ms to find 0 implicit places.
[2023-03-14 10:05:45] [INFO ] Redundant transitions in 962 ms returned []
[2023-03-14 10:05:45] [INFO ] Invariant cache hit.
[2023-03-14 10:05:52] [INFO ] Dead Transitions using invariants and state equation in 6516 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8000/10000 places, 8000/10000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15249 ms. Remains : 8000/10000 places, 8000/10000 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 21230 steps with 7069 reset in 10006 ms.
Product exploration timeout after 20450 steps with 6821 reset in 10005 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-14 10:06:14] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 8000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8000/8000 places, 8000/8000 transitions.
Applied a total of 0 rules in 414 ms. Remains 8000 /8000 variables (removed 0) and now considering 8000/8000 (removed 0) transitions.
[2023-03-14 10:06:29] [INFO ] Invariant cache hit.
[2023-03-14 10:06:30] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-14 10:06:30] [INFO ] Invariant cache hit.
[2023-03-14 10:06:35] [INFO ] Implicit Places using invariants and state equation in 5312 ms returned []
Implicit Place search using SMT with State Equation took 6180 ms to find 0 implicit places.
[2023-03-14 10:06:36] [INFO ] Redundant transitions in 914 ms returned []
[2023-03-14 10:06:36] [INFO ] Invariant cache hit.
[2023-03-14 10:06:37] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8392 ms. Remains : 8000/8000 places, 8000/8000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-14 10:06:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration timeout after 20940 steps with 6979 reset in 10002 ms.
Stack based approach found an accepted trace after 14393 steps with 4772 reset with depth 2 and stack size 2 in 7043 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-13 finished in 94502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&(p1||G(p2))) U (F(p3)&&G(p4))))'
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 60 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2023-03-14 10:07:11] [INFO ] Computed 4000 place invariants in 40 ms
[2023-03-14 10:07:12] [INFO ] Implicit Places using invariants in 919 ms returned []
Implicit Place search using SMT only with invariants took 920 ms to find 0 implicit places.
[2023-03-14 10:07:12] [INFO ] Invariant cache hit.
[2023-03-14 10:07:13] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1967 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p4) (NOT p3)), true, (NOT p2), (NOT p3), (NOT p4), (AND (NOT p2) (NOT p4)), (NOT p4)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p4) (NOT p0) p1) (AND (NOT p4) (NOT p0) p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p4) p0) (AND (NOT p4) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p4), acceptance={} source=0 dest: 3}, { cond=(OR (AND p4 p0) (AND p4 (NOT p1) (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND p4 (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 5}, { cond=(OR (AND p4 (NOT p0) p1) (AND p4 (NOT p0) p2)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 1}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p4) p2), acceptance={} source=5 dest: 2}, { cond=(AND p4 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p4 p2), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p4) (NOT p0) p1) (AND (NOT p4) (NOT p0) p2)), acceptance={0} source=6 dest: 0}, { cond=(OR (AND (NOT p4) p0) (AND (NOT p4) (NOT p1) (NOT p2))), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 2}, { cond=(OR (AND p4 p0) (AND p4 (NOT p1) (NOT p2))), acceptance={} source=6 dest: 4}, { cond=(AND p4 (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(OR (AND p4 (NOT p0) p1) (AND p4 (NOT p0) p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(GT (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s402...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 77 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-14 finished in 2411 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)&&X((p1&&F(p2)&&X(F(p3))))))'
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 186 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 10:07:14] [INFO ] Invariant cache hit.
[2023-03-14 10:07:15] [INFO ] Implicit Places using invariants in 953 ms returned []
Implicit Place search using SMT only with invariants took 955 ms to find 0 implicit places.
[2023-03-14 10:07:15] [INFO ] Invariant cache hit.
[2023-03-14 10:07:16] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2170 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s6000 s6001 s6002 s6003 s6004 s6005 s6006 s6007 s6008 s6009 s6010 s6011 s6012 s6013 s6014 s6015 s6016 s6017 s6018 s6019 s6020 s6021 s6022 s60...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-002000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-002000-LTLCardinality-15 finished in 2457 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&&(G((p1 U p2))||G(p0)))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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)))'
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)))'
Found a Shortening insensitive property : Philosophers-COL-002000-LTLCardinality-11
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 691 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 10:07:17] [INFO ] Invariant cache hit.
[2023-03-14 10:07:18] [INFO ] Implicit Places using invariants in 895 ms returned []
Implicit Place search using SMT only with invariants took 897 ms to find 0 implicit places.
[2023-03-14 10:07:18] [INFO ] Invariant cache hit.
[2023-03-14 10:07:19] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2561 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Running random walk in product with property : Philosophers-COL-002000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s8000 s8001 s8002 s8003 s8004 s8005 s8006 s8007 s8008 s8009 s8010 s8011 s8012 s8013 s8014 s8015 s8016 s8017 s8018 s8019 s8020 s8021 s8022 s...], 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 16030 steps with 100 reset in 10006 ms.
Product exploration timeout after 15820 steps with 102 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 127 steps, including 0 resets, run visited all 1 properties in 81 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-14 10:07:41] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 914 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 10:07:57] [INFO ] Invariant cache hit.
[2023-03-14 10:07:58] [INFO ] Implicit Places using invariants in 1034 ms returned []
Implicit Place search using SMT only with invariants took 1035 ms to find 0 implicit places.
[2023-03-14 10:07:58] [INFO ] Invariant cache hit.
[2023-03-14 10:07:59] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2884 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 168 steps, including 0 resets, run visited all 1 properties in 107 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2023-03-14 10:08:02] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration timeout after 15880 steps with 103 reset in 10001 ms.
Product exploration timeout after 15490 steps with 103 reset in 10001 ms.
Support contains 2000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 718 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
[2023-03-14 10:08:38] [INFO ] Invariant cache hit.
[2023-03-14 10:08:39] [INFO ] Implicit Places using invariants in 949 ms returned []
Implicit Place search using SMT only with invariants took 951 ms to find 0 implicit places.
[2023-03-14 10:08:39] [INFO ] Invariant cache hit.
[2023-03-14 10:08:39] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2508 ms. Remains : 10000/10000 places, 10000/10000 transitions.
Treatment of property Philosophers-COL-002000-LTLCardinality-11 finished in 83763 ms.
[2023-03-14 10:08:40] [INFO ] Flatten gal took : 314 ms
[2023-03-14 10:08:40] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 10 ms.
[2023-03-14 10:08:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10000 places, 10000 transitions and 32000 arcs took 43 ms.
Total runtime 852771 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-COL-002000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality
FORMULA Philosophers-COL-002000-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-COL-002000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-COL-002000-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-COL-002000-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-COL-002000-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678788636838
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-11: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 17 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-11: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 22 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-11: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 27 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-00: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-01: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-07: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-11: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 32 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 5
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-COL-002000-LTLCardinality-00
lola: time limit : 713 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Philosophers-COL-002000-LTLCardinality-00
lola: result : false
lola: markings : 1506
lola: fired transitions : 1506
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 Philosophers-COL-002000-LTLCardinality-11
lola: time limit : 891 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for Philosophers-COL-002000-LTLCardinality-11
lola: result : false
lola: markings : 2692
lola: fired transitions : 2693
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Philosophers-COL-002000-LTLCardinality-01
lola: time limit : 1188 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 3/1188 1/32 Philosophers-COL-002000-LTLCardinality-01 218 m, 43 m/sec, 217 t fired, .
Time elapsed: 37 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 8/1188 1/32 Philosophers-COL-002000-LTLCardinality-01 806 m, 117 m/sec, 805 t fired, .
Time elapsed: 42 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 13/1188 1/32 Philosophers-COL-002000-LTLCardinality-01 1609 m, 160 m/sec, 1608 t fired, .
Time elapsed: 47 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 18/1188 1/32 Philosophers-COL-002000-LTLCardinality-01 2456 m, 169 m/sec, 2456 t fired, .
Time elapsed: 52 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
lola: FINISHED task # 4 (type EXCL) for Philosophers-COL-002000-LTLCardinality-01
lola: result : false
lola: markings : 2693
lola: fired transitions : 2694
lola: time used : 19.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 Philosophers-COL-002000-LTLCardinality-10
lola: time limit : 1773 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 4/1773 1/32 Philosophers-COL-002000-LTLCardinality-10 7384 m, 1476 m/sec, 7383 t fired, .
Time elapsed: 57 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 9/1773 1/32 Philosophers-COL-002000-LTLCardinality-10 17691 m, 2061 m/sec, 17690 t fired, .
Time elapsed: 62 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 14/1773 1/32 Philosophers-COL-002000-LTLCardinality-10 28158 m, 2093 m/sec, 28157 t fired, .
Time elapsed: 67 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 19/1773 2/32 Philosophers-COL-002000-LTLCardinality-10 38843 m, 2137 m/sec, 38843 t fired, .
Time elapsed: 72 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 24/1773 2/32 Philosophers-COL-002000-LTLCardinality-10 49766 m, 2184 m/sec, 49765 t fired, .
Time elapsed: 77 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 29/1773 3/32 Philosophers-COL-002000-LTLCardinality-10 60765 m, 2199 m/sec, 60764 t fired, .
Time elapsed: 82 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 34/1773 3/32 Philosophers-COL-002000-LTLCardinality-10 71918 m, 2230 m/sec, 71917 t fired, .
Time elapsed: 87 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 39/1773 4/32 Philosophers-COL-002000-LTLCardinality-10 83253 m, 2267 m/sec, 83252 t fired, .
Time elapsed: 92 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 44/1773 4/32 Philosophers-COL-002000-LTLCardinality-10 94730 m, 2295 m/sec, 94729 t fired, .
Time elapsed: 97 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 49/1773 5/32 Philosophers-COL-002000-LTLCardinality-10 106394 m, 2332 m/sec, 106393 t fired, .
Time elapsed: 102 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 54/1773 5/32 Philosophers-COL-002000-LTLCardinality-10 118259 m, 2373 m/sec, 118258 t fired, .
Time elapsed: 107 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-002000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-002000-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 59/1773 6/32 Philosophers-COL-002000-LTLCardinality-10 130168 m, 2381 m/sec, 130167 t fired, .
Time elapsed: 112 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
lola: FINISHED task # 10 (type EXCL) for Philosophers-COL-002000-LTLCardinality-10
lola: result : false
lola: markings : 134843
lola: fired transitions : 134843
lola: time used : 61.000000
lola: memory pages used : 6
lola: LAUNCH task # 7 (type EXCL) for 6 Philosophers-COL-002000-LTLCardinality-07
lola: time limit : 3486 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for Philosophers-COL-002000-LTLCardinality-07
lola: result : false
lola: markings : 1504
lola: fired transitions : 1505
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-002000-LTLCardinality-00: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-01: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-07: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-10: LTL false LTL model checker
Philosophers-COL-002000-LTLCardinality-11: LTL false LTL model checker
Time elapsed: 114 secs. Pages in use: 6
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-002000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Philosophers-COL-002000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947500147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-002000.tgz
mv Philosophers-COL-002000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;