Execution Chart

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

Trace from the execution

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

--------------------
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 1679471196449

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-001000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:46:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:46:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:46:38] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2023-03-22 07:46:38] [INFO ] Transformed 5000 places.
[2023-03-22 07:46:38] [INFO ] Transformed 5000 transitions.
[2023-03-22 07:46:38] [INFO ] Parsed PT model containing 5000 places and 5000 transitions and 16000 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 639 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 45 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:46:40] [INFO ] Computed 2000 place invariants in 49 ms
[2023-03-22 07:46:41] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-03-22 07:46:41] [INFO ] Invariant cache hit.
[2023-03-22 07:46:41] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2023-03-22 07:46:41] [INFO ] Invariant cache hit.
[2023-03-22 07:46:45] [INFO ] Dead Transitions using invariants and state equation in 4135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5649 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-22 07:46:46] [INFO ] Flatten gal took : 357 ms
[2023-03-22 07:46:47] [INFO ] Flatten gal took : 222 ms
[2023-03-22 07:46:47] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3770 ms. (steps per millisecond=2 ) properties (out of 26) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 743 ms. (steps per millisecond=13 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1140 ms. (steps per millisecond=8 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=10 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-22 07:46:56] [INFO ] Invariant cache hit.
[2023-03-22 07:46:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 516 ms returned sat
[2023-03-22 07:47:06] [INFO ] After 9403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 07:47:08] [INFO ] [Nat]Absence check using 2000 positive place invariants in 536 ms returned sat
[2023-03-22 07:47:14] [INFO ] After 3972ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :2
[2023-03-22 07:47:15] [INFO ] After 4736ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :2
Attempting to minimize the solution found.
Minimization took 363 ms.
[2023-03-22 07:47:16] [INFO ] After 9342ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :2
Fused 9 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 2 properties in 271 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 275 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 112 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:47:16] [INFO ] Invariant cache hit.
[2023-03-22 07:47:18] [INFO ] Implicit Places using invariants in 1102 ms returned []
[2023-03-22 07:47:18] [INFO ] Invariant cache hit.
[2023-03-22 07:47:19] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 2346 ms to find 0 implicit places.
[2023-03-22 07:47:19] [INFO ] Invariant cache hit.
[2023-03-22 07:47:22] [INFO ] Dead Transitions using invariants and state equation in 3382 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5842 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 372 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 17 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-01 finished in 6324 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 197 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:47:23] [INFO ] Invariant cache hit.
[2023-03-22 07:47:24] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2023-03-22 07:47:24] [INFO ] Invariant cache hit.
[2023-03-22 07:47:26] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 2803 ms to find 0 implicit places.
[2023-03-22 07:47:26] [INFO ] Redundant transitions in 390 ms returned []
[2023-03-22 07:47:26] [INFO ] Invariant cache hit.
[2023-03-22 07:47:30] [INFO ] Dead Transitions using invariants and state equation in 3599 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7012 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 197 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 66670 steps with 0 reset in 10002 ms.
Product exploration timeout after 66670 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 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 150 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 2442 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 1095 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:47:54] [INFO ] Invariant cache hit.
[2023-03-22 07:47:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 539 ms returned sat
[2023-03-22 07:47:59] [INFO ] After 3245ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 07:48:00] [INFO ] After 3606ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-22 07:48:00] [INFO ] After 5794ms 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 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 271 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 149 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 160 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-22 07:48:01] [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 65 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:48:16] [INFO ] Invariant cache hit.
[2023-03-22 07:48:18] [INFO ] Implicit Places using invariants in 1528 ms returned []
[2023-03-22 07:48:18] [INFO ] Invariant cache hit.
[2023-03-22 07:48:19] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 2855 ms to find 0 implicit places.
[2023-03-22 07:48:19] [INFO ] Invariant cache hit.
[2023-03-22 07:48:23] [INFO ] Dead Transitions using invariants and state equation in 3696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6618 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 131 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 156 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 2265 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 1099 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:48:27] [INFO ] Invariant cache hit.
[2023-03-22 07:48:28] [INFO ] [Real]Absence check using 2000 positive place invariants in 540 ms returned sat
[2023-03-22 07:48:32] [INFO ] After 3280ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 07:48:32] [INFO ] After 3645ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-22 07:48:33] [INFO ] After 5847ms 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 216 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 217 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 287 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))]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-22 07:48:34] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 155 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 73260 steps with 0 reset in 10001 ms.
Product exploration timeout after 68920 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 152 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 237 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:49:10] [INFO ] Redundant transitions in 334 ms returned []
[2023-03-22 07:49:10] [INFO ] Invariant cache hit.
[2023-03-22 07:49:14] [INFO ] Dead Transitions using invariants and state equation in 3880 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4488 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 62 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:49:14] [INFO ] Invariant cache hit.
[2023-03-22 07:49:15] [INFO ] Implicit Places using invariants in 1366 ms returned []
[2023-03-22 07:49:15] [INFO ] Invariant cache hit.
[2023-03-22 07:49:17] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 2713 ms to find 0 implicit places.
[2023-03-22 07:49:17] [INFO ] Invariant cache hit.
[2023-03-22 07:49:20] [INFO ] Dead Transitions using invariants and state equation in 3731 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6509 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLCardinality-03 finished in 118285 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 513 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:49:21] [INFO ] Invariant cache hit.
[2023-03-22 07:49:24] [INFO ] Implicit Places using invariants in 2669 ms returned []
[2023-03-22 07:49:24] [INFO ] Invariant cache hit.
[2023-03-22 07:49:27] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 5359 ms to find 0 implicit places.
[2023-03-22 07:49:27] [INFO ] Redundant transitions in 180 ms returned []
[2023-03-22 07:49:27] [INFO ] Invariant cache hit.
[2023-03-22 07:49:31] [INFO ] Dead Transitions using invariants and state equation in 3753 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9814 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 39 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 5770 ms.
Stack based approach found an accepted trace after 10014 steps with 0 reset with depth 10015 and stack size 928 in 1210 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-05 finished in 16867 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 39 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:49:38] [INFO ] Invariant cache hit.
[2023-03-22 07:49:38] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-22 07:49:38] [INFO ] Invariant cache hit.
[2023-03-22 07:49:39] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2023-03-22 07:49:39] [INFO ] Redundant transitions in 166 ms returned []
[2023-03-22 07:49:39] [INFO ] Invariant cache hit.
[2023-03-22 07:49:42] [INFO ] Dead Transitions using invariants and state equation in 3419 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4784 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 142 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 31310 steps with 0 reset in 10003 ms.
Product exploration timeout after 30190 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 276 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 151 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 3450 ms. (steps per millisecond=2 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1893 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 2288 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 866 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:50:12] [INFO ] Invariant cache hit.
[2023-03-22 07:50:14] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:50:15] [INFO ] [Nat]Absence check using 2000 positive place invariants in 541 ms returned sat
[2023-03-22 07:50:25] [INFO ] After 7184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:50:25] [INFO ] After 8046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 531 ms.
[2023-03-22 07:50:26] [INFO ] After 12156ms 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 194 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 688 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 388 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 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
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-22 07:50:27] [INFO ] Invariant cache hit.
[2023-03-22 07:50:28] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-22 07:50:28] [INFO ] Invariant cache hit.
[2023-03-22 07:50:29] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2023-03-22 07:50:29] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-22 07:50:29] [INFO ] Invariant cache hit.
[2023-03-22 07:50:33] [INFO ] Dead Transitions using invariants and state equation in 3731 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5096 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 134 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 3393 ms. (steps per millisecond=2 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1902 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 2288 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 885 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:50:42] [INFO ] Invariant cache hit.
[2023-03-22 07:50:43] [INFO ] After 708ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:50:44] [INFO ] [Nat]Absence check using 2000 positive place invariants in 537 ms returned sat
[2023-03-22 07:50:54] [INFO ] After 6902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:50:54] [INFO ] After 7711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 493 ms.
[2023-03-22 07:50:55] [INFO ] After 11747ms 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 192 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 631 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 355 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)]
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Product exploration timeout after 26670 steps with 0 reset in 10002 ms.
Product exploration timeout after 27280 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 30 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:51:16] [INFO ] Invariant cache hit.
[2023-03-22 07:51:17] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-22 07:51:17] [INFO ] Invariant cache hit.
[2023-03-22 07:51:18] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-22 07:51:18] [INFO ] Redundant transitions in 171 ms returned []
[2023-03-22 07:51:18] [INFO ] Invariant cache hit.
[2023-03-22 07:51:21] [INFO ] Dead Transitions using invariants and state equation in 3693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5011 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLCardinality-06 finished in 104039 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 163 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:51:22] [INFO ] Invariant cache hit.
[2023-03-22 07:51:25] [INFO ] Implicit Places using invariants in 3243 ms returned []
[2023-03-22 07:51:25] [INFO ] Invariant cache hit.
[2023-03-22 07:51:28] [INFO ] Implicit Places using invariants and state equation in 3026 ms returned []
Implicit Place search using SMT with State Equation took 6271 ms to find 0 implicit places.
[2023-03-22 07:51:28] [INFO ] Invariant cache hit.
[2023-03-22 07:51:32] [INFO ] Dead Transitions using invariants and state equation in 3693 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10129 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 84 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 2 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-07 finished in 10240 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 241 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 07:51:32] [INFO ] Invariant cache hit.
[2023-03-22 07:51:35] [INFO ] Implicit Places using invariants in 3088 ms returned []
[2023-03-22 07:51:35] [INFO ] Invariant cache hit.
[2023-03-22 07:51:38] [INFO ] Implicit Places using invariants and state equation in 3119 ms returned []
Implicit Place search using SMT with State Equation took 6211 ms to find 0 implicit places.
[2023-03-22 07:51:38] [INFO ] Invariant cache hit.
[2023-03-22 07:51:42] [INFO ] Dead Transitions using invariants and state equation in 3402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9855 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 81 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 2427 steps with 1213 reset in 556 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-11 finished in 10514 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 0 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 779 ms. Remains 4002 /5000 variables (removed 998) and now considering 4002/5000 (removed 998) transitions.
// Phase 1: matrix 4002 rows 4002 cols
[2023-03-22 07:51:43] [INFO ] Computed 2000 place invariants in 11 ms
[2023-03-22 07:51:46] [INFO ] Implicit Places using invariants in 3102 ms returned []
[2023-03-22 07:51:46] [INFO ] Invariant cache hit.
[2023-03-22 07:51:51] [INFO ] Implicit Places using invariants and state equation in 4118 ms returned []
Implicit Place search using SMT with State Equation took 7220 ms to find 0 implicit places.
[2023-03-22 07:51:51] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-22 07:51:51] [INFO ] Invariant cache hit.
[2023-03-22 07:51:53] [INFO ] Dead Transitions using invariants and state equation in 2520 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 10645 ms. Remains : 4002/5000 places, 4002/5000 transitions.
Stuttering acceptance computed with spot in 143 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 6 reset in 7232 ms.
Stack based approach found an accepted trace after 2048 steps with 0 reset with depth 2049 and stack size 2046 in 436 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-12 finished in 18484 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 238 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:52:01] [INFO ] Computed 2000 place invariants in 19 ms
[2023-03-22 07:52:04] [INFO ] Implicit Places using invariants in 3180 ms returned []
[2023-03-22 07:52:04] [INFO ] Invariant cache hit.
[2023-03-22 07:52:08] [INFO ] Implicit Places using invariants and state equation in 3395 ms returned []
Implicit Place search using SMT with State Equation took 6577 ms to find 0 implicit places.
[2023-03-22 07:52:08] [INFO ] Invariant cache hit.
[2023-03-22 07:52:12] [INFO ] Dead Transitions using invariants and state equation in 3709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10530 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 127 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 21415 steps with 0 reset in 1122 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-13 finished in 11812 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 2 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 614 ms. Remains 4001 /5000 variables (removed 999) and now considering 4001/5000 (removed 999) transitions.
// Phase 1: matrix 4001 rows 4001 cols
[2023-03-22 07:52:13] [INFO ] Computed 2000 place invariants in 8 ms
[2023-03-22 07:52:16] [INFO ] Implicit Places using invariants in 2859 ms returned []
[2023-03-22 07:52:16] [INFO ] Invariant cache hit.
[2023-03-22 07:52:20] [INFO ] Implicit Places using invariants and state equation in 4040 ms returned []
Implicit Place search using SMT with State Equation took 6905 ms to find 0 implicit places.
[2023-03-22 07:52:20] [INFO ] Redundant transitions in 122 ms returned []
[2023-03-22 07:52:20] [INFO ] Invariant cache hit.
[2023-03-22 07:52:23] [INFO ] Dead Transitions using invariants and state equation in 2446 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 10095 ms. Remains : 4001/5000 places, 4001/5000 transitions.
Stuttering acceptance computed with spot in 34 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 4178 ms.
Stack based approach found an accepted trace after 7442 steps with 0 reset with depth 7443 and stack size 7429 in 950 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-14 finished in 15283 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 246 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 07:52:28] [INFO ] Computed 2000 place invariants in 16 ms
[2023-03-22 07:52:32] [INFO ] Implicit Places using invariants in 3398 ms returned []
[2023-03-22 07:52:32] [INFO ] Invariant cache hit.
[2023-03-22 07:52:35] [INFO ] Implicit Places using invariants and state equation in 3392 ms returned []
Implicit Place search using SMT with State Equation took 6792 ms to find 0 implicit places.
[2023-03-22 07:52:35] [INFO ] Invariant cache hit.
[2023-03-22 07:52:39] [INFO ] Dead Transitions using invariants and state equation in 3388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10427 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 200 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 18 reset in 6444 ms.
Stack based approach found an accepted trace after 24587 steps with 14 reset with depth 16040 and stack size 16040 in 2379 ms.
FORMULA Philosophers-PT-001000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLCardinality-15 finished in 19483 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-22 07:52:48] [INFO ] Flatten gal took : 201 ms
[2023-03-22 07:52:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2023-03-22 07:52:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 5000 transitions and 16000 arcs took 21 ms.
Total runtime 369963 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1287/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393216 kB
MemFree: 15851864 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16045600 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1287/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15836340 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033332 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2023

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-PT-001000, examination is 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 r297-tall-167873950200243"
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 ;