About the Execution of LTSMin+red for Philosophers-PT-000500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1731.792 | 3600000.00 | 12621234.00 | 1909.20 | F?F?FF?FFFFFFFFF | 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.r297-tall-167873950100235.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-000500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950100235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 716K Feb 25 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Feb 25 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 379K Feb 25 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.4M Feb 25 13:29 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 214K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 840K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 184K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 850K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.5M Feb 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 234K Feb 25 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K 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 1.1M 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-000500-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679470715356
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-000500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:38:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:38:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:38:37] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-22 07:38:37] [INFO ] Transformed 2500 places.
[2023-03-22 07:38:37] [INFO ] Transformed 2500 transitions.
[2023-03-22 07:38:37] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 113 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-000500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 31 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-22 07:38:37] [INFO ] Computed 1000 place invariants in 36 ms
[2023-03-22 07:38:38] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-22 07:38:38] [INFO ] Invariant cache hit.
[2023-03-22 07:38:40] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2023-03-22 07:38:40] [INFO ] Invariant cache hit.
[2023-03-22 07:38:41] [INFO ] Dead Transitions using invariants and state equation in 1876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4026 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2023-03-22 07:38:42] [INFO ] Flatten gal took : 196 ms
[2023-03-22 07:38:42] [INFO ] Flatten gal took : 136 ms
[2023-03-22 07:38:42] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1251 ms. (steps per millisecond=7 ) properties (out of 32) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-22 07:38:47] [INFO ] Invariant cache hit.
[2023-03-22 07:38:48] [INFO ] [Real]Absence check using 1000 positive place invariants in 183 ms returned sat
[2023-03-22 07:38:49] [INFO ] After 1438ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0 real:4
[2023-03-22 07:38:49] [INFO ] [Nat]Absence check using 1000 positive place invariants in 211 ms returned sat
[2023-03-22 07:38:51] [INFO ] After 1522ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :3
[2023-03-22 07:38:52] [INFO ] After 2034ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :3
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-22 07:38:52] [INFO ] After 3257ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :3
Fused 14 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 3 properties in 87 ms. (steps per millisecond=5 )
Parikh walk visited 3 properties in 89 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA Philosophers-PT-000500-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Philosophers-PT-000500-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-15 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(G(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 183 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:38:52] [INFO ] Invariant cache hit.
[2023-03-22 07:38:54] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2023-03-22 07:38:54] [INFO ] Invariant cache hit.
[2023-03-22 07:38:57] [INFO ] Implicit Places using invariants and state equation in 3053 ms returned []
Implicit Place search using SMT with State Equation took 4469 ms to find 0 implicit places.
[2023-03-22 07:38:57] [INFO ] Invariant cache hit.
[2023-03-22 07:38:59] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6538 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-00 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 s477 s478 s479 s480 s481 s482 s483 s484 s488 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], 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 26924 steps with 0 reset in 1265 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-00 finished in 8083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 78 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:39:00] [INFO ] Invariant cache hit.
[2023-03-22 07:39:01] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2023-03-22 07:39:01] [INFO ] Invariant cache hit.
[2023-03-22 07:39:04] [INFO ] Implicit Places using invariants and state equation in 2442 ms returned []
Implicit Place search using SMT with State Equation took 3490 ms to find 0 implicit places.
[2023-03-22 07:39:04] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-22 07:39:04] [INFO ] Invariant cache hit.
[2023-03-22 07:39:06] [INFO ] Dead Transitions using invariants and state equation in 1805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5524 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 44490 steps with 588 reset in 10002 ms.
Product exploration timeout after 43710 steps with 572 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)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 36 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 140 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:39:42] [INFO ] Invariant cache hit.
[2023-03-22 07:39:43] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2023-03-22 07:39:43] [INFO ] Invariant cache hit.
[2023-03-22 07:39:45] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3581 ms to find 0 implicit places.
[2023-03-22 07:39:45] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-22 07:39:45] [INFO ] Invariant cache hit.
[2023-03-22 07:39:47] [INFO ] Dead Transitions using invariants and state equation in 1812 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5661 ms. Remains : 2500/2500 places, 2500/2500 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)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 49 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 45520 steps with 596 reset in 10002 ms.
Product exploration timeout after 44600 steps with 595 reset in 10003 ms.
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:40:22] [INFO ] Invariant cache hit.
[2023-03-22 07:40:24] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2023-03-22 07:40:24] [INFO ] Invariant cache hit.
[2023-03-22 07:40:26] [INFO ] Implicit Places using invariants and state equation in 2472 ms returned []
Implicit Place search using SMT with State Equation took 3523 ms to find 0 implicit places.
[2023-03-22 07:40:26] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-22 07:40:26] [INFO ] Invariant cache hit.
[2023-03-22 07:40:28] [INFO ] Dead Transitions using invariants and state equation in 1842 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5482 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLCardinality-01 finished in 87834 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)&&G(F(p0)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 57 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:40:28] [INFO ] Invariant cache hit.
[2023-03-22 07:40:29] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2023-03-22 07:40:29] [INFO ] Invariant cache hit.
[2023-03-22 07:40:32] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 3763 ms to find 0 implicit places.
[2023-03-22 07:40:32] [INFO ] Invariant cache hit.
[2023-03-22 07:40:34] [INFO ] Dead Transitions using invariants and state equation in 1865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5686 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-02 finished in 5919 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(F((p0||G(p1))))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:40:34] [INFO ] Invariant cache hit.
[2023-03-22 07:40:36] [INFO ] Implicit Places using invariants in 1487 ms returned []
[2023-03-22 07:40:36] [INFO ] Invariant cache hit.
[2023-03-22 07:40:39] [INFO ] Implicit Places using invariants and state equation in 3023 ms returned []
Implicit Place search using SMT with State Equation took 4512 ms to find 0 implicit places.
[2023-03-22 07:40:39] [INFO ] Invariant cache hit.
[2023-03-22 07:40:40] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6430 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT 1 (ADD s957 s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s975 s977 s978 s979 s980 s1021 s1022 s1023 s1024 s1025 s1026...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 68090 steps with 19385 reset in 10002 ms.
Product exploration timeout after 65790 steps with 18773 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 p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 743 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Finished Best-First random walk after 6990 steps, including 1 resets, run visited all 1 properties in 299 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 310 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 42 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:41:40] [INFO ] Invariant cache hit.
[2023-03-22 07:41:42] [INFO ] Implicit Places using invariants in 1426 ms returned []
[2023-03-22 07:41:42] [INFO ] Invariant cache hit.
[2023-03-22 07:41:45] [INFO ] Implicit Places using invariants and state equation in 2894 ms returned []
Implicit Place search using SMT with State Equation took 4322 ms to find 0 implicit places.
[2023-03-22 07:41:45] [INFO ] Invariant cache hit.
[2023-03-22 07:41:46] [INFO ] Dead Transitions using invariants and state equation in 1783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6149 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 130 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 68190 steps with 19403 reset in 10001 ms.
Product exploration timeout after 65680 steps with 18775 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 186 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:42:44] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-22 07:42:44] [INFO ] Invariant cache hit.
[2023-03-22 07:42:46] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2075 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 27 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:42:46] [INFO ] Invariant cache hit.
[2023-03-22 07:42:47] [INFO ] Implicit Places using invariants in 1448 ms returned []
[2023-03-22 07:42:47] [INFO ] Invariant cache hit.
[2023-03-22 07:42:50] [INFO ] Implicit Places using invariants and state equation in 2886 ms returned []
Implicit Place search using SMT with State Equation took 4335 ms to find 0 implicit places.
[2023-03-22 07:42:50] [INFO ] Invariant cache hit.
[2023-03-22 07:42:52] [INFO ] Dead Transitions using invariants and state equation in 1813 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6177 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLCardinality-03 finished in 137929 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 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 61 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:42:52] [INFO ] Invariant cache hit.
[2023-03-22 07:42:53] [INFO ] Implicit Places using invariants in 1385 ms returned []
[2023-03-22 07:42:53] [INFO ] Invariant cache hit.
[2023-03-22 07:42:56] [INFO ] Implicit Places using invariants and state equation in 2733 ms returned []
Implicit Place search using SMT with State Equation took 4120 ms to find 0 implicit places.
[2023-03-22 07:42:56] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-22 07:42:56] [INFO ] Invariant cache hit.
[2023-03-22 07:42:58] [INFO ] Dead Transitions using invariants and state equation in 1753 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5994 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=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 5612 ms.
Stack based approach found an accepted trace after 49279 steps with 0 reset with depth 49280 and stack size 17663 in 3160 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-04 finished in 14819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(F(!p0))&&F(p1)))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 29 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:43:07] [INFO ] Invariant cache hit.
[2023-03-22 07:43:08] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2023-03-22 07:43:08] [INFO ] Invariant cache hit.
[2023-03-22 07:43:10] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 3353 ms to find 0 implicit places.
[2023-03-22 07:43:10] [INFO ] Invariant cache hit.
[2023-03-22 07:43:12] [INFO ] Dead Transitions using invariants and state equation in 1713 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5096 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, true, p0, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s957 s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s975 s977 s978 s979 s980 s1021 s1022 s1023 s1024 s1025 s1026...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 5141 ms.
Stack based approach found an accepted trace after 1685 steps with 0 reset with depth 1686 and stack size 1686 in 186 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-05 finished in 10603 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((((p0||G(p1)) U X(!p2)) U p3))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 24 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:43:17] [INFO ] Invariant cache hit.
[2023-03-22 07:43:18] [INFO ] Implicit Places using invariants in 831 ms returned []
[2023-03-22 07:43:18] [INFO ] Invariant cache hit.
[2023-03-22 07:43:20] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 2991 ms to find 0 implicit places.
[2023-03-22 07:43:20] [INFO ] Invariant cache hit.
[2023-03-22 07:43:22] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4770 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p3), (NOT p3), (NOT p3), p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(OR (LEQ 2 (ADD s1414 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 67890 steps with 22618 reset in 10002 ms.
Product exploration timeout after 66320 steps with 22090 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))))]
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(NOT p3), (NOT p3), (NOT p3), p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1267 ms. (steps per millisecond=7 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 719 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 07:44:32] [INFO ] Invariant cache hit.
[2023-03-22 07:44:34] [INFO ] [Real]Absence check using 1000 positive place invariants in 213 ms returned sat
[2023-03-22 07:44:35] [INFO ] After 2269ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-22 07:44:36] [INFO ] [Nat]Absence check using 1000 positive place invariants in 213 ms returned sat
[2023-03-22 07:44:38] [INFO ] After 1464ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-22 07:44:38] [INFO ] After 1628ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-22 07:44:39] [INFO ] After 3272ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 1 properties in 51 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 52 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p0 (NOT p1) p2), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1))))), (F (NOT p2)), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F p3), (F (AND (NOT p0) p1 p2)), (F p1), (F (NOT (OR (AND p0 p2) (AND p1 p2))))]
Knowledge based reduction with 6 factoid took 723 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 264 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
[2023-03-22 07:44:40] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p3))
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 19 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:44:55] [INFO ] Invariant cache hit.
[2023-03-22 07:44:56] [INFO ] Implicit Places using invariants in 836 ms returned []
[2023-03-22 07:44:56] [INFO ] Invariant cache hit.
[2023-03-22 07:44:58] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2989 ms to find 0 implicit places.
[2023-03-22 07:44:58] [INFO ] Invariant cache hit.
[2023-03-22 07:45:00] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4820 ms. Remains : 2500/2500 places, 2500/2500 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 p3) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:45:16] [INFO ] Invariant cache hit.
[2023-03-22 07:45:17] [INFO ] [Real]Absence check using 1000 positive place invariants in 214 ms returned sat
[2023-03-22 07:45:18] [INFO ] After 1311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:45:18] [INFO ] [Nat]Absence check using 1000 positive place invariants in 203 ms returned sat
[2023-03-22 07:45:22] [INFO ] After 2407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:45:22] [INFO ] After 2566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-22 07:45:22] [INFO ] After 3994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 500 steps, including 0 resets, run visited all 1 properties in 47 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 48 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F p1), (F (NOT (AND p0 (NOT p3)))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
[2023-03-22 07:45:23] [INFO ] Invariant cache hit.
[2023-03-22 07:45:38] [INFO ] [Real]Absence check using 1000 positive place invariants in 352 ms returned unknown
Could not prove EG (AND p0 (NOT p3))
Stuttering acceptance computed with spot in 261 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Product exploration timeout after 65640 steps with 21865 reset in 10001 ms.
Product exploration timeout after 64420 steps with 21452 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 252 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p2), p2, true, (NOT p1)]
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 42 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:45:59] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-22 07:45:59] [INFO ] Invariant cache hit.
[2023-03-22 07:46:00] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1907 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 19 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:46:00] [INFO ] Invariant cache hit.
[2023-03-22 07:46:01] [INFO ] Implicit Places using invariants in 833 ms returned []
[2023-03-22 07:46:01] [INFO ] Invariant cache hit.
[2023-03-22 07:46:03] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2965 ms to find 0 implicit places.
[2023-03-22 07:46:03] [INFO ] Invariant cache hit.
[2023-03-22 07:46:05] [INFO ] Dead Transitions using invariants and state equation in 1831 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4818 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLCardinality-06 finished in 168001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:46:05] [INFO ] Invariant cache hit.
[2023-03-22 07:46:07] [INFO ] Implicit Places using invariants in 1714 ms returned []
[2023-03-22 07:46:07] [INFO ] Invariant cache hit.
[2023-03-22 07:46:11] [INFO ] Implicit Places using invariants and state equation in 3522 ms returned []
Implicit Place search using SMT with State Equation took 5238 ms to find 0 implicit places.
[2023-03-22 07:46:11] [INFO ] Invariant cache hit.
[2023-03-22 07:46:13] [INFO ] Dead Transitions using invariants and state equation in 1864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7173 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s345 s896), p0:(GT s2331 s1229)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-12 finished in 7311 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 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 0 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 0 with 994 rules applied. Total rules applied 994 place count 2003 transition count 2003
Applied a total of 994 rules in 447 ms. Remains 2003 /2500 variables (removed 497) and now considering 2003/2500 (removed 497) transitions.
// Phase 1: matrix 2003 rows 2003 cols
[2023-03-22 07:46:13] [INFO ] Computed 1000 place invariants in 7 ms
[2023-03-22 07:46:15] [INFO ] Implicit Places using invariants in 1566 ms returned []
[2023-03-22 07:46:15] [INFO ] Invariant cache hit.
[2023-03-22 07:46:18] [INFO ] Implicit Places using invariants and state equation in 3292 ms returned []
Implicit Place search using SMT with State Equation took 4860 ms to find 0 implicit places.
[2023-03-22 07:46:18] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-22 07:46:18] [INFO ] Invariant cache hit.
[2023-03-22 07:46:19] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2003/2500 places, 2003/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6674 ms. Remains : 2003/2500 places, 2003/2500 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s722 s156)], 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 1844 ms.
Stack based approach found an accepted trace after 3677 steps with 0 reset with depth 3678 and stack size 3669 in 219 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-13 finished in 8790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(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' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : Philosophers-PT-000500-LTLCardinality-03
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 54 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-22 07:46:22] [INFO ] Computed 1000 place invariants in 8 ms
[2023-03-22 07:46:23] [INFO ] Implicit Places using invariants in 1511 ms returned []
[2023-03-22 07:46:23] [INFO ] Invariant cache hit.
[2023-03-22 07:46:26] [INFO ] Implicit Places using invariants and state equation in 2992 ms returned []
Implicit Place search using SMT with State Equation took 4506 ms to find 0 implicit places.
[2023-03-22 07:46:26] [INFO ] Invariant cache hit.
[2023-03-22 07:46:28] [INFO ] Dead Transitions using invariants and state equation in 1746 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6309 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(GT 1 (ADD s957 s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s975 s977 s978 s979 s980 s1021 s1022 s1023 s1024 s1025 s1026...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 68870 steps with 19653 reset in 10001 ms.
Product exploration timeout after 67370 steps with 19175 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 p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 746 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Finished Best-First random walk after 2997 steps, including 0 resets, run visited all 1 properties in 129 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 29 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:47:26] [INFO ] Invariant cache hit.
[2023-03-22 07:47:28] [INFO ] Implicit Places using invariants in 1442 ms returned []
[2023-03-22 07:47:28] [INFO ] Invariant cache hit.
[2023-03-22 07:47:31] [INFO ] Implicit Places using invariants and state equation in 3103 ms returned []
Implicit Place search using SMT with State Equation took 4546 ms to find 0 implicit places.
[2023-03-22 07:47:31] [INFO ] Invariant cache hit.
[2023-03-22 07:47:32] [INFO ] Dead Transitions using invariants and state equation in 1781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6357 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Finished Best-First random walk after 9988 steps, including 2 resets, run visited all 1 properties in 427 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 69070 steps with 19677 reset in 10002 ms.
Product exploration timeout after 66870 steps with 19018 reset in 10003 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 40 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:48:28] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-22 07:48:28] [INFO ] Invariant cache hit.
[2023-03-22 07:48:30] [INFO ] Dead Transitions using invariants and state equation in 1818 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1921 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 25 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:48:30] [INFO ] Invariant cache hit.
[2023-03-22 07:48:32] [INFO ] Implicit Places using invariants in 1438 ms returned []
[2023-03-22 07:48:32] [INFO ] Invariant cache hit.
[2023-03-22 07:48:35] [INFO ] Implicit Places using invariants and state equation in 3116 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
[2023-03-22 07:48:35] [INFO ] Invariant cache hit.
[2023-03-22 07:48:36] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6344 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Treatment of property Philosophers-PT-000500-LTLCardinality-03 finished in 134907 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((((p0||G(p1)) U X(!p2)) U p3))))'
[2023-03-22 07:48:37] [INFO ] Flatten gal took : 92 ms
[2023-03-22 07:48:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-22 07:48:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2500 transitions and 8000 arcs took 11 ms.
Total runtime 600004 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1702/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 15977608 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16060436 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1702/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 15967920 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16050332 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1702/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15962272 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16047332 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-000500"
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-000500, 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-167873950100235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000500.tgz
mv Philosophers-PT-000500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;