About the Execution of LTSMin+red for PhilosophersDyn-COL-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2923.363 | 569342.00 | 614067.00 | 1725.00 | TFFFFFFF?FFFFFTF | 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-167873950200291.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 PhilosophersDyn-COL-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950200291
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 32K 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 PhilosophersDyn-COL-20-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679484200547
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=PhilosophersDyn-COL-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 11:23:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 11:23:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:23:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 11:23:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 11:23:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 551 ms
[2023-03-22 11:23:23] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 540 PT places and 17240.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 11:23:23] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 14 ms.
[2023-03-22 11:23:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 420 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 27) seen :23
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 639 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-22 11:23:23] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-22 11:23:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 11:23:24] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 11:23:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 11:23:24] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-22 11:23:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 11:23:24] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-22 11:23:24] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 11:23:24] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 12 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-22 11:23:24] [INFO ] Invariant cache hit.
[2023-03-22 11:23:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 8/8 places, 7/7 transitions.
Incomplete random walk after 10004 steps, including 443 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 526 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 493 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Probably explored full state space saw : 2014 states, properties seen :0
Probabilistic random walk after 6629 steps, saw 2014 distinct states, run finished after 48 ms. (steps per millisecond=138 ) properties seen :0
Explored full state space saw : 2014 states, properties seen :0
Exhaustive walk after 6629 steps, saw 2014 distinct states, run finished after 29 ms. (steps per millisecond=228 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2023-03-22 11:23:24] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-22 11:23:24] [INFO ] Flatten gal took : 39 ms
FORMULA PhilosophersDyn-COL-20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 11:23:24] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(20), Philosopher(20)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-22 11:23:24] [INFO ] Unfolded HLPN to a Petri net with 540 places and 17220 transitions 140780 arcs in 191 ms.
[2023-03-22 11:23:24] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Support contains 540 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 17030/17030 transitions.
Applied a total of 0 rules in 135 ms. Remains 540 /540 variables (removed 0) and now considering 17030/17030 (removed 0) transitions.
[2023-03-22 11:23:25] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2023-03-22 11:23:26] [INFO ] Computed 79 place invariants in 914 ms
[2023-03-22 11:23:33] [INFO ] Dead Transitions using invariants and state equation in 8062 ms found 1560 transitions.
Found 1560 dead transitions using SMT.
Drop transitions removed 1560 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1560 transitions.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 11:23:35] [INFO ] Computed 79 place invariants in 1899 ms
[2023-03-22 11:23:35] [INFO ] Implicit Places using invariants in 2043 ms returned []
Implicit Place search using SMT only with invariants took 2049 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/540 places, 15470/17030 transitions.
Applied a total of 0 rules in 103 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10364 ms. Remains : 540/540 places, 15470/17030 transitions.
Support contains 540 out of 540 places after structural reductions.
[2023-03-22 11:23:36] [INFO ] Flatten gal took : 984 ms
[2023-03-22 11:23:37] [INFO ] Flatten gal took : 651 ms
[2023-03-22 11:23:38] [INFO ] Input system was already deterministic with 15470 transitions.
Incomplete random walk after 10000 steps, including 1150 resets, run finished after 750 ms. (steps per millisecond=13 ) properties (out of 26) seen :19
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 11:23:39] [INFO ] Invariant cache hit.
[2023-03-22 11:23:40] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-22 11:23:40] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 50 ms returned sat
[2023-03-22 11:23:47] [INFO ] After 7741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 11:23:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-22 11:23:48] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 48 ms returned sat
[2023-03-22 11:24:00] [INFO ] After 12651ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-22 11:24:01] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 11:24:12] [INFO ] After 11695ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-22 11:24:12] [INFO ] After 11699ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 11:24:12] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 230 ms.
Support contains 80 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2326 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:24:15] [INFO ] Invariant cache hit.
[2023-03-22 11:24:22] [INFO ] Dead Transitions using invariants and state equation in 6543 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8873 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1134 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 32551 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32551 steps, saw 9091 distinct states, run finished after 3004 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 11:24:25] [INFO ] Invariant cache hit.
[2023-03-22 11:24:26] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-22 11:24:26] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 50 ms returned sat
[2023-03-22 11:24:42] [INFO ] After 16767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 11:24:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-22 11:24:42] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 49 ms returned sat
[2023-03-22 11:24:52] [INFO ] After 10028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 11:24:53] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 11:25:07] [INFO ] After 14591ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 11:25:07] [INFO ] After 14595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 11:25:07] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 80 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2193 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2193 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2014 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:25:12] [INFO ] Invariant cache hit.
[2023-03-22 11:25:13] [INFO ] Implicit Places using invariants in 1728 ms returned []
Implicit Place search using SMT only with invariants took 1729 ms to find 0 implicit places.
[2023-03-22 11:25:13] [INFO ] Invariant cache hit.
[2023-03-22 11:25:20] [INFO ] Dead Transitions using invariants and state equation in 6637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10384 ms. Remains : 540/540 places, 15470/15470 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(p1)||p0))) U (p1&&(p2 U X(p3)))))'
Support contains 460 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 57 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:25:20] [INFO ] Invariant cache hit.
[2023-03-22 11:25:27] [INFO ] Dead Transitions using invariants and state equation in 6438 ms found 0 transitions.
[2023-03-22 11:25:27] [INFO ] Invariant cache hit.
[2023-03-22 11:25:28] [INFO ] Implicit Places using invariants in 820 ms returned []
Implicit Place search using SMT only with invariants took 824 ms to find 0 implicit places.
[2023-03-22 11:25:28] [INFO ] Invariant cache hit.
[2023-03-22 11:25:34] [INFO ] Dead Transitions using invariants and state equation in 6556 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13886 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 572 ms :[(OR (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p3), true, (NOT p1), (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 8}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=6 dest: 4}], [{ cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(LEQ 3 (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 1 reset in 8 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-02 finished in 14581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 420 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 55 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:25:35] [INFO ] Invariant cache hit.
[2023-03-22 11:25:42] [INFO ] Dead Transitions using invariants and state equation in 6598 ms found 0 transitions.
[2023-03-22 11:25:42] [INFO ] Invariant cache hit.
[2023-03-22 11:25:43] [INFO ] Implicit Places using invariants in 1533 ms returned []
Implicit Place search using SMT only with invariants took 1534 ms to find 0 implicit places.
[2023-03-22 11:25:43] [INFO ] Invariant cache hit.
[2023-03-22 11:25:50] [INFO ] Dead Transitions using invariants and state equation in 6539 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14732 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ 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}]], initial=0, aps=[p1:(LEQ 2 (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167...], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 203 steps with 22 reset in 52 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-03 finished in 14968 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&&(G(p1)||G(p2))))))'
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 310 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:25:50] [INFO ] Invariant cache hit.
[2023-03-22 11:25:57] [INFO ] Dead Transitions using invariants and state equation in 6420 ms found 0 transitions.
[2023-03-22 11:25:57] [INFO ] Invariant cache hit.
[2023-03-22 11:25:59] [INFO ] Implicit Places using invariants in 2445 ms returned []
Implicit Place search using SMT only with invariants took 2450 ms to find 0 implicit places.
[2023-03-22 11:25:59] [INFO ] Invariant cache hit.
[2023-03-22 11:26:06] [INFO ] Dead Transitions using invariants and state equation in 6598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15793 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139)), p1:(LEQ 1 (ADD s40 s41 s42 s43 s44 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 468 steps with 53 reset in 38 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-05 finished in 16125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 60 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 125 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:26:06] [INFO ] Invariant cache hit.
[2023-03-22 11:26:13] [INFO ] Dead Transitions using invariants and state equation in 6479 ms found 0 transitions.
[2023-03-22 11:26:13] [INFO ] Invariant cache hit.
[2023-03-22 11:26:15] [INFO ] Implicit Places using invariants in 2389 ms returned []
Implicit Place search using SMT only with invariants took 2397 ms to find 0 implicit places.
[2023-03-22 11:26:15] [INFO ] Invariant cache hit.
[2023-03-22 11:26:21] [INFO ] Dead Transitions using invariants and state equation in 6257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15270 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 3 (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99)), p0:(LEQ (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-06 finished in 15592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(G(p2)))))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 55 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:26:22] [INFO ] Invariant cache hit.
[2023-03-22 11:26:28] [INFO ] Dead Transitions using invariants and state equation in 6385 ms found 0 transitions.
[2023-03-22 11:26:28] [INFO ] Invariant cache hit.
[2023-03-22 11:26:29] [INFO ] Implicit Places using invariants in 812 ms returned []
Implicit Place search using SMT only with invariants took 814 ms to find 0 implicit places.
[2023-03-22 11:26:29] [INFO ] Invariant cache hit.
[2023-03-22 11:26:35] [INFO ] Dead Transitions using invariants and state equation in 6329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13588 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT 1 (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139)), p1:(LEQ (ADD s60 s61 s62 s63 s64 s65 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 321 steps with 36 reset in 43 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-07 finished in 13901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3066 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:26:39] [INFO ] Invariant cache hit.
[2023-03-22 11:26:45] [INFO ] Dead Transitions using invariants and state equation in 6345 ms found 0 transitions.
[2023-03-22 11:26:45] [INFO ] Invariant cache hit.
[2023-03-22 11:26:47] [INFO ] Implicit Places using invariants in 2494 ms returned []
Implicit Place search using SMT only with invariants took 2495 ms to find 0 implicit places.
[2023-03-22 11:26:47] [INFO ] Invariant cache hit.
[2023-03-22 11:26:54] [INFO ] Dead Transitions using invariants and state equation in 6249 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18160 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11451 reset in 3320 ms.
Product exploration explored 100000 steps with 11449 reset in 3160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1151 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 33769 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33769 steps, saw 9408 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 11:27:04] [INFO ] Invariant cache hit.
[2023-03-22 11:27:04] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-22 11:27:04] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 46 ms returned sat
[2023-03-22 11:27:09] [INFO ] After 4478ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 11:27:09] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 11:27:19] [INFO ] After 10689ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-22 11:27:19] [INFO ] After 15479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1990 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:27:21] [INFO ] Invariant cache hit.
[2023-03-22 11:27:28] [INFO ] Dead Transitions using invariants and state equation in 6399 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8392 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1136 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 33488 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33488 steps, saw 9343 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 11:27:31] [INFO ] Invariant cache hit.
[2023-03-22 11:27:31] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-22 11:27:31] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 51 ms returned sat
[2023-03-22 11:27:36] [INFO ] After 4537ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 11:27:36] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 11:27:47] [INFO ] After 10692ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-22 11:27:47] [INFO ] After 15648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1967 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1968 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1977 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:27:51] [INFO ] Invariant cache hit.
[2023-03-22 11:27:53] [INFO ] Implicit Places using invariants in 2450 ms returned []
Implicit Place search using SMT only with invariants took 2451 ms to find 0 implicit places.
[2023-03-22 11:27:53] [INFO ] Invariant cache hit.
[2023-03-22 11:28:00] [INFO ] Dead Transitions using invariants and state equation in 6268 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10699 ms. Remains : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 22670
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 520 transition count 22670
Applied a total of 40 rules in 987 ms. Remains 520 /540 variables (removed 20) and now considering 22670/15470 (removed -7200) transitions.
Running SMT prover for 1 properties.
[2023-03-22 11:28:01] [INFO ] Flow matrix only has 22290 transitions (discarded 380 similar events)
// Phase 1: matrix 22290 rows 520 cols
[2023-03-22 11:28:02] [INFO ] Computed 79 place invariants in 1312 ms
[2023-03-22 11:28:02] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-22 11:28:02] [INFO ] [Real]Absence check using 26 positive and 53 generalized place invariants in 49 ms returned sat
[2023-03-22 11:28:11] [INFO ] After 8481ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 11:28:11] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-22 11:28:21] [INFO ] After 9960ms SMT Verify possible using 400 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-22 11:28:21] [INFO ] After 18728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2628 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 11:28:25] [INFO ] Computed 79 place invariants in 1779 ms
[2023-03-22 11:28:32] [INFO ] Dead Transitions using invariants and state equation in 8471 ms found 0 transitions.
[2023-03-22 11:28:32] [INFO ] Invariant cache hit.
[2023-03-22 11:28:35] [INFO ] Implicit Places using invariants in 2462 ms returned []
Implicit Place search using SMT only with invariants took 2465 ms to find 0 implicit places.
[2023-03-22 11:28:35] [INFO ] Invariant cache hit.
[2023-03-22 11:28:41] [INFO ] Dead Transitions using invariants and state equation in 6234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19803 ms. Remains : 540/540 places, 15470/15470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 1148 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 33754 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33754 steps, saw 9407 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 11:28:45] [INFO ] Invariant cache hit.
[2023-03-22 11:28:45] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-22 11:28:45] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 53 ms returned sat
[2023-03-22 11:28:49] [INFO ] After 4534ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 11:28:49] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 11:29:00] [INFO ] After 10632ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-22 11:29:00] [INFO ] After 15486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 21 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2055 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:29:02] [INFO ] Invariant cache hit.
[2023-03-22 11:29:09] [INFO ] Dead Transitions using invariants and state equation in 6598 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8655 ms. Remains : 540/540 places, 15470/15470 transitions.
Incomplete random walk after 10000 steps, including 1140 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 34773 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34773 steps, saw 9693 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 11:29:12] [INFO ] Invariant cache hit.
[2023-03-22 11:29:12] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-22 11:29:12] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 46 ms returned sat
[2023-03-22 11:29:16] [INFO ] After 4226ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 11:29:17] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-22 11:29:27] [INFO ] After 10605ms SMT Verify possible using 8020 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-22 11:29:27] [INFO ] After 15164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1913 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1914 ms. Remains : 540/540 places, 15470/15470 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1952 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:29:31] [INFO ] Invariant cache hit.
[2023-03-22 11:29:34] [INFO ] Implicit Places using invariants in 2447 ms returned []
Implicit Place search using SMT only with invariants took 2448 ms to find 0 implicit places.
[2023-03-22 11:29:34] [INFO ] Invariant cache hit.
[2023-03-22 11:29:40] [INFO ] Dead Transitions using invariants and state equation in 6523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10927 ms. Remains : 540/540 places, 15470/15470 transitions.
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 540 transition count 22670
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 40 place count 520 transition count 22670
Applied a total of 40 rules in 943 ms. Remains 520 /540 variables (removed 20) and now considering 22670/15470 (removed -7200) transitions.
Running SMT prover for 1 properties.
[2023-03-22 11:29:41] [INFO ] Flow matrix only has 22290 transitions (discarded 380 similar events)
// Phase 1: matrix 22290 rows 520 cols
[2023-03-22 11:29:42] [INFO ] Computed 79 place invariants in 1277 ms
[2023-03-22 11:29:42] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned sat
[2023-03-22 11:29:42] [INFO ] [Real]Absence check using 26 positive and 53 generalized place invariants in 46 ms returned sat
[2023-03-22 11:29:50] [INFO ] After 7568ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 11:29:50] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-22 11:30:00] [INFO ] After 9974ms SMT Verify possible using 400 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-22 11:30:00] [INFO ] After 17743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 11443 reset in 2907 ms.
Product exploration explored 100000 steps with 11467 reset in 2924 ms.
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2739 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
// Phase 1: matrix 15470 rows 540 cols
[2023-03-22 11:30:11] [INFO ] Computed 79 place invariants in 1781 ms
[2023-03-22 11:30:18] [INFO ] Dead Transitions using invariants and state equation in 8631 ms found 0 transitions.
[2023-03-22 11:30:18] [INFO ] Invariant cache hit.
[2023-03-22 11:30:20] [INFO ] Implicit Places using invariants in 2326 ms returned []
Implicit Place search using SMT only with invariants took 2329 ms to find 0 implicit places.
[2023-03-22 11:30:20] [INFO ] Invariant cache hit.
[2023-03-22 11:30:27] [INFO ] Dead Transitions using invariants and state equation in 6983 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20739 ms. Remains : 540/540 places, 15470/15470 transitions.
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-08 finished in 232922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(F(p1))) U (p2&&F(G(p3)))))'
Support contains 140 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 3141 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:30:32] [INFO ] Invariant cache hit.
[2023-03-22 11:30:38] [INFO ] Dead Transitions using invariants and state equation in 6527 ms found 0 transitions.
[2023-03-22 11:30:38] [INFO ] Invariant cache hit.
[2023-03-22 11:30:40] [INFO ] Implicit Places using invariants in 1637 ms returned []
Implicit Place search using SMT only with invariants took 1638 ms to find 0 implicit places.
[2023-03-22 11:30:40] [INFO ] Invariant cache hit.
[2023-03-22 11:30:47] [INFO ] Dead Transitions using invariants and state equation in 6949 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18278 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (NOT p3)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LEQ 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119)) (LEQ (ADD s120 s121 s122 s123 s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 11441 reset in 2997 ms.
Stack based approach found an accepted trace after 13015 steps with 1486 reset with depth 6 and stack size 6 in 411 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-09 finished in 21895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1878 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:30:52] [INFO ] Invariant cache hit.
[2023-03-22 11:30:59] [INFO ] Dead Transitions using invariants and state equation in 6848 ms found 0 transitions.
[2023-03-22 11:30:59] [INFO ] Invariant cache hit.
[2023-03-22 11:31:02] [INFO ] Implicit Places using invariants in 2895 ms returned []
Implicit Place search using SMT only with invariants took 2910 ms to find 0 implicit places.
[2023-03-22 11:31:02] [INFO ] Invariant cache hit.
[2023-03-22 11:31:08] [INFO ] Dead Transitions using invariants and state equation in 6411 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18077 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-10 finished in 18195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((!p0&&G(p1)))))))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 87 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:31:09] [INFO ] Invariant cache hit.
[2023-03-22 11:31:16] [INFO ] Dead Transitions using invariants and state equation in 6982 ms found 0 transitions.
[2023-03-22 11:31:16] [INFO ] Invariant cache hit.
[2023-03-22 11:31:18] [INFO ] Implicit Places using invariants in 2902 ms returned []
Implicit Place search using SMT only with invariants took 2906 ms to find 0 implicit places.
[2023-03-22 11:31:18] [INFO ] Invariant cache hit.
[2023-03-22 11:31:25] [INFO ] Dead Transitions using invariants and state equation in 6773 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16783 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19)), p0:(LEQ 1 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 ...], 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-12 finished in 17045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U p1))'
Support contains 40 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 82 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:31:26] [INFO ] Invariant cache hit.
[2023-03-22 11:31:33] [INFO ] Dead Transitions using invariants and state equation in 6980 ms found 0 transitions.
[2023-03-22 11:31:33] [INFO ] Invariant cache hit.
[2023-03-22 11:31:35] [INFO ] Implicit Places using invariants in 2330 ms returned []
Implicit Place search using SMT only with invariants took 2333 ms to find 0 implicit places.
[2023-03-22 11:31:35] [INFO ] Invariant cache hit.
[2023-03-22 11:31:42] [INFO ] Dead Transitions using invariants and state equation in 6895 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16323 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79)), p0:(GT 1 (ADD s120 s121 s122 s123 s124 s125 s126 s127 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 14 reset in 4 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-13 finished in 16439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U p2))'
Support contains 480 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 2677 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:31:45] [INFO ] Invariant cache hit.
[2023-03-22 11:31:51] [INFO ] Dead Transitions using invariants and state equation in 6546 ms found 0 transitions.
[2023-03-22 11:31:51] [INFO ] Invariant cache hit.
[2023-03-22 11:31:52] [INFO ] Implicit Places using invariants in 752 ms returned []
Implicit Place search using SMT only with invariants took 762 ms to find 0 implicit places.
[2023-03-22 11:31:52] [INFO ] Invariant cache hit.
[2023-03-22 11:31:59] [INFO ] Dead Transitions using invariants and state equation in 6734 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16722 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GT (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 96160 steps with 48080 reset in 10001 ms.
Product exploration timeout after 95110 steps with 47555 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 p2) p1 p0), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 671 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1141 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 11:32:21] [INFO ] Invariant cache hit.
[2023-03-22 11:32:21] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))
Knowledge based reduction with 16 factoid took 636 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-20-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-14 finished in 39635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 20 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 15470/15470 transitions.
Applied a total of 0 rules in 1984 ms. Remains 540 /540 variables (removed 0) and now considering 15470/15470 (removed 0) transitions.
[2023-03-22 11:32:24] [INFO ] Invariant cache hit.
[2023-03-22 11:32:30] [INFO ] Dead Transitions using invariants and state equation in 6837 ms found 0 transitions.
[2023-03-22 11:32:30] [INFO ] Invariant cache hit.
[2023-03-22 11:32:33] [INFO ] Implicit Places using invariants in 2889 ms returned []
Implicit Place search using SMT only with invariants took 2894 ms to find 0 implicit places.
[2023-03-22 11:32:33] [INFO ] Invariant cache hit.
[2023-03-22 11:32:40] [INFO ] Dead Transitions using invariants and state equation in 6833 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18563 ms. Remains : 540/540 places, 15470/15470 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 32 steps with 4 reset in 2 ms.
FORMULA PhilosophersDyn-COL-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-20-LTLCardinality-15 finished in 18649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
[2023-03-22 11:32:41] [INFO ] Flatten gal took : 675 ms
[2023-03-22 11:32:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 11:32:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 540 places, 15470 transitions and 120800 arcs took 89 ms.
Total runtime 559207 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1160/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PhilosophersDyn-COL-20-LTLCardinality-08
BK_STOP 1679484769889
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name PhilosophersDyn-COL-20-LTLCardinality-08
ltl formula formula --ltl=/tmp/1160/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 540 places, 15470 transitions and 120800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.320 real 0.880 user 0.700 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1160/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1160/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1160/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1160/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
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="PhilosophersDyn-COL-20"
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 PhilosophersDyn-COL-20, 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-167873950200291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-20.tgz
mv PhilosophersDyn-COL-20 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 ;