fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r295-tall-167873947600243
Last Updated
May 14, 2023

About the Execution of LoLa+red for Philosophers-PT-001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5353.739 492981.00 556190.00 2035.10 TFTFFF?FFTFFFFFF 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-167873947600243.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-PT-001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947600243
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678806243979

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-PT-001000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 15:04:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 15:04:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:04:05] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2023-03-14 15:04:05] [INFO ] Transformed 5000 places.
[2023-03-14 15:04:05] [INFO ] Transformed 5000 transitions.
[2023-03-14 15:04:05] [INFO ] Parsed PT model containing 5000 places and 5000 transitions and 16000 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 615 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-PT-001000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 44 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:04:07] [INFO ] Computed 2000 place invariants in 44 ms
[2023-03-14 15:04:07] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-14 15:04:07] [INFO ] Invariant cache hit.
[2023-03-14 15:04:08] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2023-03-14 15:04:08] [INFO ] Invariant cache hit.
[2023-03-14 15:04:11] [INFO ] Dead Transitions using invariants and state equation in 3209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4672 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-14 15:04:12] [INFO ] Flatten gal took : 369 ms
[2023-03-14 15:04:12] [INFO ] Flatten gal took : 248 ms
[2023-03-14 15:04:13] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3357 ms. (steps per millisecond=2 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1082 ms. (steps per millisecond=9 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 847 ms. (steps per millisecond=11 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-14 15:04:22] [INFO ] Invariant cache hit.
[2023-03-14 15:04:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 520 ms returned sat
[2023-03-14 15:04:29] [INFO ] After 7020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 15:04:31] [INFO ] [Nat]Absence check using 2000 positive place invariants in 482 ms returned sat
[2023-03-14 15:04:36] [INFO ] After 4067ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2023-03-14 15:04:38] [INFO ] After 5428ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 552 ms.
[2023-03-14 15:04:38] [INFO ] After 9109ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
Fused 10 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1003 steps, including 0 resets, run visited all 1 properties in 187 ms. (steps per millisecond=5 )
Parikh walk visited 3 properties in 640 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Philosophers-PT-001000-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Philosophers-PT-001000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((F(p1)||G(!p2)))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 103 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:04:39] [INFO ] Invariant cache hit.
[2023-03-14 15:04:40] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2023-03-14 15:04:40] [INFO ] Invariant cache hit.
[2023-03-14 15:04:42] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
[2023-03-14 15:04:42] [INFO ] Invariant cache hit.
[2023-03-14 15:04:45] [INFO ] Dead Transitions using invariants and state equation in 3329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5708 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2))]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(LEQ (ADD s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s3848 s3849 s3850 s3851 s3852 s3853 s3854 s3855 s3856 s3857 s3858 s3859 s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-01 finished in 6117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||(p0&&F(p1)&&F((G(p2)||G(!p1))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 335 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:04:46] [INFO ] Invariant cache hit.
[2023-03-14 15:04:47] [INFO ] Implicit Places using invariants in 1186 ms returned []
[2023-03-14 15:04:47] [INFO ] Invariant cache hit.
[2023-03-14 15:04:48] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 2391 ms to find 0 implicit places.
[2023-03-14 15:04:48] [INFO ] Redundant transitions in 401 ms returned []
[2023-03-14 15:04:48] [INFO ] Invariant cache hit.
[2023-03-14 15:04:52] [INFO ] Dead Transitions using invariants and state equation in 3158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6300 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration timeout after 75780 steps with 0 reset in 10001 ms.
Product exploration timeout after 65880 steps with 4 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 : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2193 ms. (steps per millisecond=4 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1031 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 15:05:16] [INFO ] Invariant cache hit.
[2023-03-14 15:05:17] [INFO ] [Real]Absence check using 2000 positive place invariants in 464 ms returned sat
[2023-03-14 15:05:20] [INFO ] After 2888ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 15:05:21] [INFO ] After 3245ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-14 15:05:21] [INFO ] After 5235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 204 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 205 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p2)), (F (AND p1 (NOT p2))), (F p1), (F (AND (NOT p1) p2)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-14 15:05:22] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 63 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:05:37] [INFO ] Invariant cache hit.
[2023-03-14 15:05:38] [INFO ] Implicit Places using invariants in 1222 ms returned []
[2023-03-14 15:05:38] [INFO ] Invariant cache hit.
[2023-03-14 15:05:39] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 2346 ms to find 0 implicit places.
[2023-03-14 15:05:39] [INFO ] Invariant cache hit.
[2023-03-14 15:05:43] [INFO ] Dead Transitions using invariants and state equation in 3161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5574 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2545 ms. (steps per millisecond=3 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1017 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=11 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-14 15:05:48] [INFO ] Invariant cache hit.
[2023-03-14 15:05:49] [INFO ] [Real]Absence check using 2000 positive place invariants in 472 ms returned sat
[2023-03-14 15:05:53] [INFO ] After 3011ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 15:05:53] [INFO ] After 3372ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-14 15:05:53] [INFO ] After 5414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 220 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 221 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p2)), (F (AND p1 (NOT p2))), (F p1), (F (AND (NOT p1) p2)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 279 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-14 15:05:54] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 15:06:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration timeout after 69530 steps with 0 reset in 10003 ms.
Product exploration timeout after 71300 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 221 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:06:31] [INFO ] Redundant transitions in 321 ms returned []
[2023-03-14 15:06:31] [INFO ] Invariant cache hit.
[2023-03-14 15:06:34] [INFO ] Dead Transitions using invariants and state equation in 2905 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3457 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 187 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:06:34] [INFO ] Invariant cache hit.
[2023-03-14 15:06:35] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2023-03-14 15:06:35] [INFO ] Invariant cache hit.
[2023-03-14 15:06:36] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-14 15:06:36] [INFO ] Invariant cache hit.
[2023-03-14 15:06:39] [INFO ] Dead Transitions using invariants and state equation in 3083 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5478 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLCardinality-03 finished in 114469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 470 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:06:40] [INFO ] Invariant cache hit.
[2023-03-14 15:06:43] [INFO ] Implicit Places using invariants in 2339 ms returned []
[2023-03-14 15:06:43] [INFO ] Invariant cache hit.
[2023-03-14 15:06:45] [INFO ] Implicit Places using invariants and state equation in 2313 ms returned []
Implicit Place search using SMT with State Equation took 4653 ms to find 0 implicit places.
[2023-03-14 15:06:45] [INFO ] Redundant transitions in 161 ms returned []
[2023-03-14 15:06:45] [INFO ] Invariant cache hit.
[2023-03-14 15:06:48] [INFO ] Dead Transitions using invariants and state equation in 3297 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8593 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 6226 ms.
Stack based approach found an accepted trace after 18666 steps with 0 reset with depth 18667 and stack size 18667 in 1792 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-05 finished in 16678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(!p2))))))'
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 44 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:06:56] [INFO ] Invariant cache hit.
[2023-03-14 15:06:57] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-14 15:06:57] [INFO ] Invariant cache hit.
[2023-03-14 15:06:57] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2023-03-14 15:06:58] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-14 15:06:58] [INFO ] Invariant cache hit.
[2023-03-14 15:07:01] [INFO ] Dead Transitions using invariants and state equation in 3320 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4523 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ (ADD s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s3848 s3849 s3850 s3851 s3852 s3853 s3854 s3855 s3856 s3857 s3858 s3859...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 31230 steps with 0 reset in 10003 ms.
Product exploration timeout after 31160 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3117 ms. (steps per millisecond=3 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1807 ms. (steps per millisecond=5 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2212 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 15:07:30] [INFO ] Invariant cache hit.
[2023-03-14 15:07:31] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 15:07:32] [INFO ] [Nat]Absence check using 2000 positive place invariants in 461 ms returned sat
[2023-03-14 15:07:41] [INFO ] After 6413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 15:07:42] [INFO ] After 7231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 472 ms.
[2023-03-14 15:07:42] [INFO ] After 10890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 184 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 570 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 335 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 35 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:07:43] [INFO ] Invariant cache hit.
[2023-03-14 15:07:44] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-14 15:07:44] [INFO ] Invariant cache hit.
[2023-03-14 15:07:44] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2023-03-14 15:07:45] [INFO ] Redundant transitions in 170 ms returned []
[2023-03-14 15:07:45] [INFO ] Invariant cache hit.
[2023-03-14 15:07:48] [INFO ] Dead Transitions using invariants and state equation in 3096 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4249 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3111 ms. (steps per millisecond=3 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1815 ms. (steps per millisecond=5 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2197 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 15:07:57] [INFO ] Invariant cache hit.
[2023-03-14 15:07:58] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 15:07:59] [INFO ] [Nat]Absence check using 2000 positive place invariants in 471 ms returned sat
[2023-03-14 15:08:07] [INFO ] After 5961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 15:08:08] [INFO ] After 6751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 471 ms.
[2023-03-14 15:08:09] [INFO ] After 10428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 184 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 571 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 318 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Product exploration timeout after 28430 steps with 0 reset in 10001 ms.
Product exploration timeout after 28140 steps with 0 reset in 10003 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 33 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:08:30] [INFO ] Invariant cache hit.
[2023-03-14 15:08:30] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-14 15:08:30] [INFO ] Invariant cache hit.
[2023-03-14 15:08:31] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2023-03-14 15:08:31] [INFO ] Redundant transitions in 205 ms returned []
[2023-03-14 15:08:31] [INFO ] Invariant cache hit.
[2023-03-14 15:08:34] [INFO ] Dead Transitions using invariants and state equation in 3050 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4302 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLCardinality-06 finished in 98105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 166 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:08:35] [INFO ] Invariant cache hit.
[2023-03-14 15:08:37] [INFO ] Implicit Places using invariants in 2681 ms returned []
[2023-03-14 15:08:37] [INFO ] Invariant cache hit.
[2023-03-14 15:08:40] [INFO ] Implicit Places using invariants and state equation in 2609 ms returned []
Implicit Place search using SMT with State Equation took 5291 ms to find 0 implicit places.
[2023-03-14 15:08:40] [INFO ] Invariant cache hit.
[2023-03-14 15:08:43] [INFO ] Dead Transitions using invariants and state equation in 3034 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8494 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s3848 s3849 s3850 s3851 s3852 s3853 s3854 s3855 s3856 s3857 s3858 s3859 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-07 finished in 8594 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 U p1)))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 262 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:08:43] [INFO ] Invariant cache hit.
[2023-03-14 15:08:46] [INFO ] Implicit Places using invariants in 2735 ms returned []
[2023-03-14 15:08:46] [INFO ] Invariant cache hit.
[2023-03-14 15:08:49] [INFO ] Implicit Places using invariants and state equation in 2763 ms returned []
Implicit Place search using SMT with State Equation took 5500 ms to find 0 implicit places.
[2023-03-14 15:08:49] [INFO ] Invariant cache hit.
[2023-03-14 15:08:52] [INFO ] Dead Transitions using invariants and state equation in 3151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8914 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s2313 s3699), p0:(LEQ s400 s2602)], 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]]
Entered a terminal (fully accepting) state of product in 1385 steps with 692 reset in 282 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-11 finished in 9304 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(F(p1))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 998 Post agglomeration using F-continuation condition.Transition count delta: 998
Deduced a syphon composed of 998 places in 1 ms
Reduce places removed 998 places and 0 transitions.
Iterating global reduction 0 with 1996 rules applied. Total rules applied 1996 place count 4002 transition count 4002
Applied a total of 1996 rules in 736 ms. Remains 4002 /5000 variables (removed 998) and now considering 4002/5000 (removed 998) transitions.
// Phase 1: matrix 4002 rows 4002 cols
[2023-03-14 15:08:53] [INFO ] Computed 2000 place invariants in 12 ms
[2023-03-14 15:08:56] [INFO ] Implicit Places using invariants in 2497 ms returned []
[2023-03-14 15:08:56] [INFO ] Invariant cache hit.
[2023-03-14 15:09:01] [INFO ] Implicit Places using invariants and state equation in 5562 ms returned []
Implicit Place search using SMT with State Equation took 8060 ms to find 0 implicit places.
[2023-03-14 15:09:01] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-14 15:09:01] [INFO ] Invariant cache hit.
[2023-03-14 15:09:03] [INFO ] Dead Transitions using invariants and state equation in 2122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4002/5000 places, 4002/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11032 ms. Remains : 4002/5000 places, 4002/5000 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s4000 s3288), p1:(OR (LEQ s4000 s3288) (LEQ 1 s642))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 3852 ms.
Product exploration explored 100000 steps with 3 reset in 6139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Finished random walk after 4983 steps, including 1 resets, run visited all 1 properties in 869 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 147 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 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 4002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4002/4002 places, 4002/4002 transitions.
Applied a total of 0 rules in 170 ms. Remains 4002 /4002 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2023-03-14 15:09:15] [INFO ] Invariant cache hit.
[2023-03-14 15:09:18] [INFO ] Implicit Places using invariants in 2415 ms returned []
[2023-03-14 15:09:18] [INFO ] Invariant cache hit.
[2023-03-14 15:09:23] [INFO ] Implicit Places using invariants and state equation in 5467 ms returned []
Implicit Place search using SMT with State Equation took 7887 ms to find 0 implicit places.
[2023-03-14 15:09:23] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-14 15:09:23] [INFO ] Invariant cache hit.
[2023-03-14 15:09:25] [INFO ] Dead Transitions using invariants and state equation in 2276 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10447 ms. Remains : 4002/4002 places, 4002/4002 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 : [p1, (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 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 p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1589 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73863 steps, run timeout after 3005 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73863 steps, saw 73631 distinct states, run finished after 3007 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 15:09:31] [INFO ] Invariant cache hit.
[2023-03-14 15:09:31] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:09:32] [INFO ] [Nat]Absence check using 2000 positive place invariants in 423 ms returned sat
[2023-03-14 15:09:37] [INFO ] After 5053ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 15:09:37] [INFO ] After 5622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 595 ms.
[2023-03-14 15:09:38] [INFO ] After 7057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 491 steps, including 0 resets, run visited all 1 properties in 53 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 53 ms.
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 78 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 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7 reset in 7782 ms.
Stack based approach found an accepted trace after 4462 steps with 0 reset with depth 4463 and stack size 935 in 704 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-12 finished in 54456 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 U X(G(p1)))))'
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 248 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:09:47] [INFO ] Computed 2000 place invariants in 19 ms
[2023-03-14 15:09:50] [INFO ] Implicit Places using invariants in 2915 ms returned []
[2023-03-14 15:09:50] [INFO ] Invariant cache hit.
[2023-03-14 15:09:53] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 5902 ms to find 0 implicit places.
[2023-03-14 15:09:53] [INFO ] Invariant cache hit.
[2023-03-14 15:09:56] [INFO ] Dead Transitions using invariants and state equation in 3293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9444 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s2230 s4495), p0:(AND (GT s3281 s4465) (LEQ s1930 s435))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 344 steps with 0 reset in 113 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-13 finished in 9826 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 1 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 999 Post agglomeration using F-continuation condition.Transition count delta: 999
Deduced a syphon composed of 999 places in 1 ms
Reduce places removed 999 places and 0 transitions.
Iterating global reduction 0 with 1998 rules applied. Total rules applied 1998 place count 4001 transition count 4001
Applied a total of 1998 rules in 650 ms. Remains 4001 /5000 variables (removed 999) and now considering 4001/5000 (removed 999) transitions.
// Phase 1: matrix 4001 rows 4001 cols
[2023-03-14 15:09:57] [INFO ] Computed 2000 place invariants in 13 ms
[2023-03-14 15:10:00] [INFO ] Implicit Places using invariants in 2393 ms returned []
[2023-03-14 15:10:00] [INFO ] Invariant cache hit.
[2023-03-14 15:10:03] [INFO ] Implicit Places using invariants and state equation in 3596 ms returned []
Implicit Place search using SMT with State Equation took 5991 ms to find 0 implicit places.
[2023-03-14 15:10:03] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-14 15:10:03] [INFO ] Invariant cache hit.
[2023-03-14 15:10:07] [INFO ] Dead Transitions using invariants and state equation in 3137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4001/5000 places, 4001/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9893 ms. Remains : 4001/5000 places, 4001/5000 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s4000)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 3651 ms.
Stack based approach found an accepted trace after 1306 steps with 0 reset with depth 1307 and stack size 1304 in 310 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-14 finished in 13907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&F(p1)))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 249 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:10:11] [INFO ] Computed 2000 place invariants in 24 ms
[2023-03-14 15:10:14] [INFO ] Implicit Places using invariants in 2774 ms returned []
[2023-03-14 15:10:14] [INFO ] Invariant cache hit.
[2023-03-14 15:10:16] [INFO ] Implicit Places using invariants and state equation in 2735 ms returned []
Implicit Place search using SMT with State Equation took 5511 ms to find 0 implicit places.
[2023-03-14 15:10:16] [INFO ] Invariant cache hit.
[2023-03-14 15:10:19] [INFO ] Dead Transitions using invariants and state equation in 3058 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8819 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Philosophers-PT-001000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s4837), p0:(LEQ s3117 s92)], 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]]
Product exploration explored 100000 steps with 24 reset in 7664 ms.
Stack based approach found an accepted trace after 29915 steps with 2 reset with depth 24582 and stack size 1803 in 1883 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-15 finished in 18582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||(p0&&F(p1)&&F((G(p2)||G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(!p2))))))'
[2023-03-14 15:10:30] [INFO ] Flatten gal took : 223 ms
[2023-03-14 15:10:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2023-03-14 15:10:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 5000 transitions and 16000 arcs took 20 ms.
Total runtime 384750 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-PT-001000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA Philosophers-PT-001000-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678806736960

--------------------
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: 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: LAUNCH task # 4 (type EXCL) for 3 Philosophers-PT-001000-LTLCardinality-06
lola: time limit : 1797 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 2/1797 2/32 Philosophers-PT-001000-LTLCardinality-06 41680 m, 8336 m/sec, 122436 t fired, .

Time elapsed: 8 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 7/1797 3/32 Philosophers-PT-001000-LTLCardinality-06 117048 m, 15073 m/sec, 366132 t fired, .

Time elapsed: 13 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 12/1797 5/32 Philosophers-PT-001000-LTLCardinality-06 189098 m, 14410 m/sec, 611617 t fired, .

Time elapsed: 18 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 17/1797 7/32 Philosophers-PT-001000-LTLCardinality-06 260483 m, 14277 m/sec, 856907 t fired, .

Time elapsed: 23 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 22/1797 9/32 Philosophers-PT-001000-LTLCardinality-06 330155 m, 13934 m/sec, 1104128 t fired, .

Time elapsed: 28 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 27/1797 10/32 Philosophers-PT-001000-LTLCardinality-06 398848 m, 13738 m/sec, 1352186 t fired, .

Time elapsed: 33 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 32/1797 12/32 Philosophers-PT-001000-LTLCardinality-06 466949 m, 13620 m/sec, 1599674 t fired, .

Time elapsed: 38 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 37/1797 14/32 Philosophers-PT-001000-LTLCardinality-06 537126 m, 14035 m/sec, 1845991 t fired, .

Time elapsed: 43 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 42/1797 16/32 Philosophers-PT-001000-LTLCardinality-06 607668 m, 14108 m/sec, 2094908 t fired, .

Time elapsed: 48 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 47/1797 17/32 Philosophers-PT-001000-LTLCardinality-06 675221 m, 13510 m/sec, 2341383 t fired, .

Time elapsed: 53 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 52/1797 19/32 Philosophers-PT-001000-LTLCardinality-06 739740 m, 12903 m/sec, 2581104 t fired, .

Time elapsed: 58 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 57/1797 21/32 Philosophers-PT-001000-LTLCardinality-06 803326 m, 12717 m/sec, 2820144 t fired, .

Time elapsed: 63 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 62/1797 22/32 Philosophers-PT-001000-LTLCardinality-06 867270 m, 12788 m/sec, 3059841 t fired, .

Time elapsed: 68 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 67/1797 24/32 Philosophers-PT-001000-LTLCardinality-06 930349 m, 12615 m/sec, 3298712 t fired, .

Time elapsed: 73 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 72/1797 25/32 Philosophers-PT-001000-LTLCardinality-06 993653 m, 12660 m/sec, 3538569 t fired, .

Time elapsed: 78 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 77/1797 27/32 Philosophers-PT-001000-LTLCardinality-06 1056864 m, 12642 m/sec, 3778427 t fired, .

Time elapsed: 83 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 82/1797 29/32 Philosophers-PT-001000-LTLCardinality-06 1120197 m, 12666 m/sec, 4018270 t fired, .

Time elapsed: 88 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 87/1797 30/32 Philosophers-PT-001000-LTLCardinality-06 1182658 m, 12492 m/sec, 4258501 t fired, .

Time elapsed: 93 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 92/1797 32/32 Philosophers-PT-001000-LTLCardinality-06 1245610 m, 12590 m/sec, 4498558 t fired, .

Time elapsed: 98 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Philosophers-PT-001000-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-PT-001000-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Philosophers-PT-001000-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 103 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-PT-001000-LTLCardinality-03
lola: time limit : 3497 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Philosophers-PT-001000-LTLCardinality-03
lola: result : false
lola: markings : 8421
lola: fired transitions : 8421
lola: time used : 2.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-PT-001000-LTLCardinality-03: LTL false LTL model checker
Philosophers-PT-001000-LTLCardinality-06: LTL unknown AGGR


Time elapsed: 105 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-001000"
export BK_EXAMINATION="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-PT-001000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947600243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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