Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.2K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 12:23 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.0K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 12:51 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-10-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678814976232

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 17:29:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 17:29:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 17:29:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 17:29:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 17:29:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 671 ms
[2023-03-14 17:29:38] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 17:29:38] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 6 ms.
[2023-03-14 17:29:38] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 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 697 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 28) seen :24
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 636 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 527 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-14 17:29:39] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-14 17:29:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-14 17:29:39] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 17:29:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 17:29:39] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-14 17:29:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 17:29:39] [INFO ] After 6ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-14 17:29:39] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-14 17:29:39] [INFO ] After 86ms 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 4 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 9 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-14 17:29:39] [INFO ] Invariant cache hit.
[2023-03-14 17:29:39] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 8/8 places, 7/7 transitions.
Incomplete random walk after 10006 steps, including 702 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 544 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Probably explored full state space saw : 504 states, properties seen :0
Probabilistic random walk after 1609 steps, saw 504 distinct states, run finished after 20 ms. (steps per millisecond=80 ) properties seen :0
Explored full state space saw : 504 states, properties seen :0
Exhaustive walk after 1609 steps, saw 504 distinct states, run finished after 5 ms. (steps per millisecond=321 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2023-03-14 17:29:39] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-14 17:29:39] [INFO ] Flatten gal took : 32 ms
FORMULA PhilosophersDyn-COL-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 17:29:39] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-14 17:29:39] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 50 ms.
[2023-03-14 17:29:39] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 25 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-14 17:29:39] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-14 17:29:39] [INFO ] Computed 39 place invariants in 49 ms
[2023-03-14 17:29:40] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 17:29:40] [INFO ] Computed 39 place invariants in 44 ms
[2023-03-14 17:29:40] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-14 17:29:40] [INFO ] Invariant cache hit.
[2023-03-14 17:29:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:29:41] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1444 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 170 out of 170 places after structural reductions.
[2023-03-14 17:29:41] [INFO ] Flatten gal took : 187 ms
[2023-03-14 17:29:41] [INFO ] Flatten gal took : 134 ms
[2023-03-14 17:29:42] [INFO ] Input system was already deterministic with 1885 transitions.
Incomplete random walk after 10000 steps, including 1177 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 24) seen :14
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-14 17:29:42] [INFO ] Invariant cache hit.
[2023-03-14 17:29:43] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-14 17:29:43] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 17:29:43] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 17:29:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:29:43] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:29:44] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-14 17:29:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:29:58] [INFO ] After 13817ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-14 17:29:58] [INFO ] After 14565ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-14 17:29:59] [INFO ] After 15976ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 70 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 160 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:29:59] [INFO ] Invariant cache hit.
[2023-03-14 17:30:00] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 850 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1183 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 218662 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218662 steps, saw 56067 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-14 17:30:03] [INFO ] Invariant cache hit.
[2023-03-14 17:30:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:30:03] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-14 17:30:04] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 17:30:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:30:04] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-14 17:30:05] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 17:30:05] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:30:11] [INFO ] After 6754ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-14 17:30:12] [INFO ] Deduced a trap composed of 77 places in 231 ms of which 1 ms to minimize.
[2023-03-14 17:30:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2023-03-14 17:30:13] [INFO ] Deduced a trap composed of 77 places in 209 ms of which 2 ms to minimize.
[2023-03-14 17:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2023-03-14 17:30:13] [INFO ] After 8452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 514 ms.
[2023-03-14 17:30:14] [INFO ] After 9792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 70 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 88 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:30:14] [INFO ] Invariant cache hit.
[2023-03-14 17:30:14] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-14 17:30:14] [INFO ] Invariant cache hit.
[2023-03-14 17:30:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:30:19] [INFO ] Implicit Places using invariants and state equation in 4662 ms returned []
Implicit Place search using SMT with State Equation took 4882 ms to find 0 implicit places.
[2023-03-14 17:30:19] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-14 17:30:19] [INFO ] Invariant cache hit.
[2023-03-14 17:30:19] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5716 ms. Remains : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 44 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-03-14 17:30:19] [INFO ] Invariant cache hit.
[2023-03-14 17:30:20] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:30:20] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-14 17:30:20] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 17:30:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:30:20] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:30:21] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 17:30:21] [INFO ] After 1235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-14 17:30:22] [INFO ] After 1654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Successfully simplified 1 atomic propositions for a total of 14 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' '!(F(G(p0)))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 294 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:30:22] [INFO ] Invariant cache hit.
[2023-03-14 17:30:23] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
[2023-03-14 17:30:23] [INFO ] Invariant cache hit.
[2023-03-14 17:30:23] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-14 17:30:23] [INFO ] Invariant cache hit.
[2023-03-14 17:30:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:30:30] [INFO ] Implicit Places using invariants and state equation in 6442 ms returned []
Implicit Place search using SMT with State Equation took 6718 ms to find 0 implicit places.
[2023-03-14 17:30:30] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-14 17:30:30] [INFO ] Invariant cache hit.
[2023-03-14 17:30:30] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8254 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159) (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 3 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-00 finished in 8457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 97 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:30:30] [INFO ] Invariant cache hit.
[2023-03-14 17:30:31] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
[2023-03-14 17:30:31] [INFO ] Invariant cache hit.
[2023-03-14 17:30:31] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-14 17:30:31] [INFO ] Invariant cache hit.
[2023-03-14 17:30:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:30:38] [INFO ] Implicit Places using invariants and state equation in 6371 ms returned []
Implicit Place search using SMT with State Equation took 6649 ms to find 0 implicit places.
[2023-03-14 17:30:38] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 17:30:38] [INFO ] Invariant cache hit.
[2023-03-14 17:30:38] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7918 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159) (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11919 reset in 737 ms.
Product exploration explored 100000 steps with 11881 reset in 676 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1197 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 355884 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 355884 steps, saw 89362 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:30:43] [INFO ] Invariant cache hit.
[2023-03-14 17:30:43] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:30:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:30:43] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:30:44] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:30:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:30:45] [INFO ] After 1262ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:30:45] [INFO ] After 1331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-14 17:30:45] [INFO ] After 1792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 74 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:30:45] [INFO ] Invariant cache hit.
[2023-03-14 17:30:46] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1194 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 356380 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 356380 steps, saw 89499 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:30:49] [INFO ] Invariant cache hit.
[2023-03-14 17:30:49] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:30:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:30:49] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:30:49] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:30:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:30:50] [INFO ] After 1261ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:30:50] [INFO ] After 1326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-14 17:30:50] [INFO ] After 1786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 80 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 71 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:30:51] [INFO ] Invariant cache hit.
[2023-03-14 17:30:51] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-14 17:30:51] [INFO ] Invariant cache hit.
[2023-03-14 17:30:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:30:57] [INFO ] Implicit Places using invariants and state equation in 6360 ms returned []
Implicit Place search using SMT with State Equation took 6633 ms to find 0 implicit places.
[2023-03-14 17:30:57] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-14 17:30:57] [INFO ] Invariant cache hit.
[2023-03-14 17:30:58] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7335 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 104 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-14 17:30:58] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-14 17:30:58] [INFO ] Computed 39 place invariants in 43 ms
[2023-03-14 17:30:58] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:30:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:30:58] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 14 ms returned sat
[2023-03-14 17:30:59] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:30:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 17:31:08] [INFO ] After 9057ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 17:31:08] [INFO ] After 9590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 101 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 17:31:08] [INFO ] Computed 39 place invariants in 38 ms
[2023-03-14 17:31:09] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
[2023-03-14 17:31:09] [INFO ] Invariant cache hit.
[2023-03-14 17:31:09] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-14 17:31:09] [INFO ] Invariant cache hit.
[2023-03-14 17:31:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:31:15] [INFO ] Implicit Places using invariants and state equation in 6401 ms returned []
Implicit Place search using SMT with State Equation took 6688 ms to find 0 implicit places.
[2023-03-14 17:31:15] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-14 17:31:15] [INFO ] Invariant cache hit.
[2023-03-14 17:31:16] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8036 ms. Remains : 170/170 places, 1885/1885 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1196 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 361113 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 361113 steps, saw 90500 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:31:19] [INFO ] Invariant cache hit.
[2023-03-14 17:31:19] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:31:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:31:19] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:31:20] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:31:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:31:21] [INFO ] After 1287ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:31:21] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-14 17:31:21] [INFO ] After 1811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 68 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:31:21] [INFO ] Invariant cache hit.
[2023-03-14 17:31:22] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 662 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1200 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 361322 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 361322 steps, saw 90530 distinct states, run finished after 3002 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:31:25] [INFO ] Invariant cache hit.
[2023-03-14 17:31:25] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:31:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:31:25] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-14 17:31:25] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:31:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:31:27] [INFO ] After 1368ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:31:27] [INFO ] After 1445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-14 17:31:27] [INFO ] After 1929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 71 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 68 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:31:27] [INFO ] Invariant cache hit.
[2023-03-14 17:31:27] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-14 17:31:27] [INFO ] Invariant cache hit.
[2023-03-14 17:31:27] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:31:34] [INFO ] Implicit Places using invariants and state equation in 6374 ms returned []
Implicit Place search using SMT with State Equation took 6658 ms to find 0 implicit places.
[2023-03-14 17:31:34] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-14 17:31:34] [INFO ] Invariant cache hit.
[2023-03-14 17:31:34] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7331 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 91 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-14 17:31:34] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-14 17:31:34] [INFO ] Computed 39 place invariants in 33 ms
[2023-03-14 17:31:34] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:31:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:31:34] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:31:35] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:31:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 17:31:44] [INFO ] After 9057ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-14 17:31:44] [INFO ] After 9558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11904 reset in 639 ms.
Product exploration explored 100000 steps with 11926 reset in 651 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 81 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 17:31:46] [INFO ] Computed 39 place invariants in 31 ms
[2023-03-14 17:31:46] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
[2023-03-14 17:31:46] [INFO ] Invariant cache hit.
[2023-03-14 17:31:46] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-14 17:31:46] [INFO ] Invariant cache hit.
[2023-03-14 17:31:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:31:53] [INFO ] Implicit Places using invariants and state equation in 6412 ms returned []
Implicit Place search using SMT with State Equation took 6679 ms to find 0 implicit places.
[2023-03-14 17:31:53] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-14 17:31:53] [INFO ] Invariant cache hit.
[2023-03-14 17:31:53] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7944 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-01 finished in 83226 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))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:31:54] [INFO ] Invariant cache hit.
[2023-03-14 17:31:54] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
[2023-03-14 17:31:54] [INFO ] Invariant cache hit.
[2023-03-14 17:31:54] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-14 17:31:54] [INFO ] Invariant cache hit.
[2023-03-14 17:31:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:01] [INFO ] Implicit Places using invariants and state equation in 6352 ms returned []
Implicit Place search using SMT with State Equation took 6630 ms to find 0 implicit places.
[2023-03-14 17:32:01] [INFO ] Invariant cache hit.
[2023-03-14 17:32:01] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7730 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109) (ADD s130 s131 s132 s133 s134 s135 s136 s137 s138 s139)), p0:(AND (GT 1 (ADD s130 s131 s132...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11940 reset in 685 ms.
Product exploration explored 100000 steps with 11946 reset in 729 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1195 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 352002 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352002 steps, saw 88332 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:32:06] [INFO ] Invariant cache hit.
[2023-03-14 17:32:06] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:32:06] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2023-03-14 17:32:07] [INFO ] After 323ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 17:32:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:07] [INFO ] After 462ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:07] [INFO ] After 852ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:32:07] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-14 17:32:08] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:09] [INFO ] After 896ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:09] [INFO ] After 963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-14 17:32:09] [INFO ] After 1379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:09] [INFO ] Invariant cache hit.
[2023-03-14 17:32:09] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1200 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 350442 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 350442 steps, saw 87891 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:32:12] [INFO ] Invariant cache hit.
[2023-03-14 17:32:12] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:32:12] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 17:32:13] [INFO ] After 326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 17:32:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:13] [INFO ] After 478ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:13] [INFO ] After 873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:32:13] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 17:32:14] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:15] [INFO ] After 962ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:15] [INFO ] After 1037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-14 17:32:15] [INFO ] After 1449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:15] [INFO ] Invariant cache hit.
[2023-03-14 17:32:15] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-14 17:32:15] [INFO ] Invariant cache hit.
[2023-03-14 17:32:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:21] [INFO ] Implicit Places using invariants and state equation in 6348 ms returned []
Implicit Place search using SMT with State Equation took 6627 ms to find 0 implicit places.
[2023-03-14 17:32:22] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-14 17:32:22] [INFO ] Invariant cache hit.
[2023-03-14 17:32:22] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7310 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 110 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-14 17:32:22] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-14 17:32:22] [INFO ] Computed 39 place invariants in 31 ms
[2023-03-14 17:32:22] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:32:22] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2023-03-14 17:32:23] [INFO ] After 470ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 17:32:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 17:32:23] [INFO ] After 476ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:23] [INFO ] After 1009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:32:23] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 17:32:24] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:24] [INFO ] After 345ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:24] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-14 17:32:24] [INFO ] After 988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (NOT p1)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 17:32:25] [INFO ] Computed 39 place invariants in 28 ms
[2023-03-14 17:32:25] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
[2023-03-14 17:32:25] [INFO ] Invariant cache hit.
[2023-03-14 17:32:26] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-14 17:32:26] [INFO ] Invariant cache hit.
[2023-03-14 17:32:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:32] [INFO ] Implicit Places using invariants and state equation in 6425 ms returned []
Implicit Place search using SMT with State Equation took 6719 ms to find 0 implicit places.
[2023-03-14 17:32:32] [INFO ] Invariant cache hit.
[2023-03-14 17:32:33] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7937 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1181 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 335185 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335185 steps, saw 84307 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:32:36] [INFO ] Invariant cache hit.
[2023-03-14 17:32:36] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:32:36] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 17:32:37] [INFO ] After 334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 17:32:37] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:37] [INFO ] After 479ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:37] [INFO ] After 883ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:32:37] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:32:37] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:38] [INFO ] After 1004ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:38] [INFO ] After 1074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-14 17:32:39] [INFO ] After 1506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 72 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:39] [INFO ] Invariant cache hit.
[2023-03-14 17:32:39] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 675 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1190 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 339571 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339571 steps, saw 85472 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:32:42] [INFO ] Invariant cache hit.
[2023-03-14 17:32:42] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:32:42] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 15 ms returned sat
[2023-03-14 17:32:43] [INFO ] After 333ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 17:32:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:43] [INFO ] After 481ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:43] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:32:43] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 11 ms returned sat
[2023-03-14 17:32:44] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:45] [INFO ] After 985ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:45] [INFO ] After 1052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-14 17:32:45] [INFO ] After 1485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 67 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 71 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:45] [INFO ] Invariant cache hit.
[2023-03-14 17:32:45] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-14 17:32:45] [INFO ] Invariant cache hit.
[2023-03-14 17:32:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:32:51] [INFO ] Implicit Places using invariants and state equation in 6401 ms returned []
Implicit Place search using SMT with State Equation took 6683 ms to find 0 implicit places.
[2023-03-14 17:32:52] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-14 17:32:52] [INFO ] Invariant cache hit.
[2023-03-14 17:32:52] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7376 ms. Remains : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 102 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2023-03-14 17:32:52] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2023-03-14 17:32:52] [INFO ] Computed 39 place invariants in 31 ms
[2023-03-14 17:32:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:32:52] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:32:53] [INFO ] After 450ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 17:32:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-14 17:32:53] [INFO ] After 416ms SMT Verify possible using 100 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:53] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:32:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:32:53] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:32:54] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:54] [INFO ] After 317ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:32:54] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-14 17:32:54] [INFO ] After 923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11931 reset in 668 ms.
Product exploration explored 100000 steps with 11893 reset in 668 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (NOT p1)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 117 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 17:32:56] [INFO ] Computed 39 place invariants in 26 ms
[2023-03-14 17:32:57] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
[2023-03-14 17:32:57] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-14 17:32:57] [INFO ] Invariant cache hit.
[2023-03-14 17:32:57] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1289 ms. Remains : 170/170 places, 1885/1885 transitions.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:32:57] [INFO ] Invariant cache hit.
[2023-03-14 17:32:58] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
[2023-03-14 17:32:58] [INFO ] Invariant cache hit.
[2023-03-14 17:32:58] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-14 17:32:58] [INFO ] Invariant cache hit.
[2023-03-14 17:32:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:05] [INFO ] Implicit Places using invariants and state equation in 6404 ms returned []
Implicit Place search using SMT with State Equation took 6686 ms to find 0 implicit places.
[2023-03-14 17:33:05] [INFO ] Invariant cache hit.
[2023-03-14 17:33:05] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7809 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-02 finished in 71655 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)||X(!p1))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 80 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:33:05] [INFO ] Invariant cache hit.
[2023-03-14 17:33:06] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
[2023-03-14 17:33:06] [INFO ] Invariant cache hit.
[2023-03-14 17:33:06] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-14 17:33:06] [INFO ] Invariant cache hit.
[2023-03-14 17:33:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:13] [INFO ] Implicit Places using invariants and state equation in 6378 ms returned []
Implicit Place search using SMT with State Equation took 6650 ms to find 0 implicit places.
[2023-03-14 17:33:13] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 17:33:13] [INFO ] Invariant cache hit.
[2023-03-14 17:33:13] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7888 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, false, p1]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s160 s161 s162 s163 s164 s165 s166 s167 s168 s169)), p0:(LEQ 3 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11926 reset in 775 ms.
Product exploration explored 100000 steps with 11920 reset in 688 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 365 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[true, false, p1]
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 17:33:15] [INFO ] Invariant cache hit.
[2023-03-14 17:33:15] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:33:15] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 17:33:16] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:33:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:33:16] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 17:33:16] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:33:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:18] [INFO ] After 2336ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:33:18] [INFO ] After 2469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-14 17:33:18] [INFO ] After 2966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 157 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 17:33:19] [INFO ] Computed 39 place invariants in 30 ms
[2023-03-14 17:33:19] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 751 ms. Remains : 160/170 places, 1875/1885 transitions.
Incomplete random walk after 10000 steps, including 1188 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 291458 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291458 steps, saw 70464 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 17:33:22] [INFO ] Invariant cache hit.
[2023-03-14 17:33:22] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:33:22] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:33:23] [INFO ] After 320ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-14 17:33:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:23] [INFO ] After 622ms SMT Verify possible using 1010 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:33:23] [INFO ] After 1012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:33:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:33:24] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 7 ms returned sat
[2023-03-14 17:33:24] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:33:28] [INFO ] After 4529ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:33:28] [INFO ] After 4662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-14 17:33:29] [INFO ] After 5135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 70 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 65 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 17:33:29] [INFO ] Invariant cache hit.
[2023-03-14 17:33:29] [INFO ] Implicit Places using invariants in 314 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 317 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 148 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 17:33:29] [INFO ] Computed 29 place invariants in 24 ms
[2023-03-14 17:33:30] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-14 17:33:30] [INFO ] Invariant cache hit.
[2023-03-14 17:33:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:35] [INFO ] Implicit Places using invariants and state equation in 5510 ms returned []
Implicit Place search using SMT with State Equation took 5812 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6342 ms. Remains : 140/160 places, 1865/1875 transitions.
Incomplete random walk after 10000 steps, including 1786 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 608 ms. (steps per millisecond=79 ) properties seen :0
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 600 ms. (steps per millisecond=80 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (AND (NOT p1) p0))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1)]
Property proved to be true thanks to knowledge :(G (OR p0 p1))
Knowledge based reduction with 12 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-03 finished in 31512 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)&&F(G(p1)))))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 86 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 17:33:37] [INFO ] Computed 39 place invariants in 30 ms
[2023-03-14 17:33:37] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
[2023-03-14 17:33:37] [INFO ] Invariant cache hit.
[2023-03-14 17:33:38] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-14 17:33:38] [INFO ] Invariant cache hit.
[2023-03-14 17:33:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:44] [INFO ] Implicit Places using invariants and state equation in 6400 ms returned []
Implicit Place search using SMT with State Equation took 6684 ms to find 0 implicit places.
[2023-03-14 17:33:44] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-14 17:33:44] [INFO ] Invariant cache hit.
[2023-03-14 17:33:45] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7983 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GT 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109)) (GT 1 (ADD s110 s111 s112 s113 s114 s115 s116 s117 s118 s119))), p1:(GT (ADD s140 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-04 finished in 8117 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((X(G(p0)) U (p1||X(p1)))))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:33:45] [INFO ] Invariant cache hit.
[2023-03-14 17:33:45] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
[2023-03-14 17:33:45] [INFO ] Invariant cache hit.
[2023-03-14 17:33:46] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-14 17:33:46] [INFO ] Invariant cache hit.
[2023-03-14 17:33:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:33:52] [INFO ] Implicit Places using invariants and state equation in 6437 ms returned []
Implicit Place search using SMT with State Equation took 6782 ms to find 0 implicit places.
[2023-03-14 17:33:52] [INFO ] Invariant cache hit.
[2023-03-14 17:33:53] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7919 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149)), p0:(LEQ (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149) (ADD s130 s131 s132 s1...], 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 13 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-05 finished in 8066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:33:53] [INFO ] Invariant cache hit.
[2023-03-14 17:33:54] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
[2023-03-14 17:33:54] [INFO ] Invariant cache hit.
[2023-03-14 17:33:54] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-14 17:33:54] [INFO ] Invariant cache hit.
[2023-03-14 17:33:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:01] [INFO ] Implicit Places using invariants and state equation in 6789 ms returned []
Implicit Place search using SMT with State Equation took 7076 ms to find 0 implicit places.
[2023-03-14 17:34:01] [INFO ] Invariant cache hit.
[2023-03-14 17:34:01] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8199 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11930 reset in 646 ms.
Product exploration explored 100000 steps with 11952 reset in 647 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 143 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1198 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 352609 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352609 steps, saw 88487 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:34:06] [INFO ] Invariant cache hit.
[2023-03-14 17:34:06] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:34:06] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-14 17:34:06] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:34:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:34:06] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:34:06] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:34:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:07] [INFO ] After 1119ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:34:08] [INFO ] After 1188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-14 17:34:08] [INFO ] After 1640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 1875
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 1875
Applied a total of 20 rules in 139 ms. Remains 160 /170 variables (removed 10) and now considering 1875/1885 (removed 10) transitions.
// Phase 1: matrix 1875 rows 160 cols
[2023-03-14 17:34:08] [INFO ] Computed 39 place invariants in 32 ms
[2023-03-14 17:34:08] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 712 ms. Remains : 160/170 places, 1875/1885 transitions.
Incomplete random walk after 10000 steps, including 1199 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 364734 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 364734 steps, saw 87116 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 17:34:11] [INFO ] Invariant cache hit.
[2023-03-14 17:34:11] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:34:11] [INFO ] [Real]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:34:11] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 17:34:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-14 17:34:12] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
[2023-03-14 17:34:12] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 17:34:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:16] [INFO ] After 3761ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 17:34:16] [INFO ] Deduced a trap composed of 57 places in 215 ms of which 1 ms to minimize.
[2023-03-14 17:34:16] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 0 ms to minimize.
[2023-03-14 17:34:17] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 0 ms to minimize.
[2023-03-14 17:34:17] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 1 ms to minimize.
[2023-03-14 17:34:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1451 ms
[2023-03-14 17:34:17] [INFO ] After 5246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-14 17:34:17] [INFO ] After 5667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 66 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 160/160 places, 1875/1875 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 1875/1875 transitions.
Applied a total of 0 rules in 78 ms. Remains 160 /160 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
[2023-03-14 17:34:17] [INFO ] Invariant cache hit.
[2023-03-14 17:34:18] [INFO ] Implicit Places using invariants in 315 ms returned [130, 131, 132, 133, 134, 135, 136, 137, 138, 139]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 318 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 150/160 places, 1875/1875 transitions.
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 150 transition count 1865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 140 transition count 1865
Applied a total of 20 rules in 137 ms. Remains 140 /150 variables (removed 10) and now considering 1865/1875 (removed 10) transitions.
// Phase 1: matrix 1865 rows 140 cols
[2023-03-14 17:34:18] [INFO ] Computed 29 place invariants in 29 ms
[2023-03-14 17:34:18] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-14 17:34:18] [INFO ] Invariant cache hit.
[2023-03-14 17:34:18] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:24] [INFO ] Implicit Places using invariants and state equation in 5964 ms returned []
Implicit Place search using SMT with State Equation took 6275 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/160 places, 1865/1875 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6808 ms. Remains : 140/160 places, 1865/1875 transitions.
Incomplete random walk after 10000 steps, including 1789 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Probably explored full state space saw : 14836 states, properties seen :0
Probabilistic random walk after 48551 steps, saw 14836 distinct states, run finished after 489 ms. (steps per millisecond=99 ) properties seen :0
Explored full state space saw : 14836 states, properties seen :0
Exhaustive walk after 48551 steps, saw 14836 distinct states, run finished after 468 ms. (steps per millisecond=103 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-06 finished in 32243 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||X(G((!p0&&X(p1)))))))'
Support contains 110 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-14 17:34:25] [INFO ] Computed 39 place invariants in 25 ms
[2023-03-14 17:34:26] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
[2023-03-14 17:34:26] [INFO ] Invariant cache hit.
[2023-03-14 17:34:26] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-14 17:34:26] [INFO ] Invariant cache hit.
[2023-03-14 17:34:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:28] [INFO ] Implicit Places using invariants and state equation in 2561 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
[2023-03-14 17:34:28] [INFO ] Invariant cache hit.
[2023-03-14 17:34:29] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3818 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109)), p1:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s2...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1216 ms.
Product exploration explored 100000 steps with 50000 reset in 1178 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-08 finished in 6450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p0)) U p1) U G(p2))))'
Support contains 40 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:32] [INFO ] Invariant cache hit.
[2023-03-14 17:34:32] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
[2023-03-14 17:34:32] [INFO ] Invariant cache hit.
[2023-03-14 17:34:32] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-14 17:34:32] [INFO ] Invariant cache hit.
[2023-03-14 17:34:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:38] [INFO ] Implicit Places using invariants and state equation in 5478 ms returned []
Implicit Place search using SMT with State Equation took 5676 ms to find 0 implicit places.
[2023-03-14 17:34:38] [INFO ] Invariant cache hit.
[2023-03-14 17:34:38] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6784 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 2 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159)), p1:(LEQ (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129) (ADD s100 s101 s102 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-10 finished in 7027 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 110 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 80 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:39] [INFO ] Invariant cache hit.
[2023-03-14 17:34:39] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
[2023-03-14 17:34:39] [INFO ] Invariant cache hit.
[2023-03-14 17:34:39] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-14 17:34:39] [INFO ] Invariant cache hit.
[2023-03-14 17:34:40] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:42] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
[2023-03-14 17:34:42] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-14 17:34:42] [INFO ] Invariant cache hit.
[2023-03-14 17:34:43] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3886 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-11 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:(AND (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36...], 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 29 steps with 4 reset in 1 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-11 finished in 3972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 82 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:43] [INFO ] Invariant cache hit.
[2023-03-14 17:34:43] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2023-03-14 17:34:43] [INFO ] Invariant cache hit.
[2023-03-14 17:34:44] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-14 17:34:44] [INFO ] Invariant cache hit.
[2023-03-14 17:34:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:50] [INFO ] Implicit Places using invariants and state equation in 5995 ms returned []
Implicit Place search using SMT with State Equation took 6264 ms to find 0 implicit places.
[2023-03-14 17:34:50] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-14 17:34:50] [INFO ] Invariant cache hit.
[2023-03-14 17:34:50] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7499 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109)), p0:(LEQ (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159) (ADD s140 s141 s142 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11914 reset in 657 ms.
Product exploration explored 100000 steps with 11889 reset in 655 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1195 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 17:34:52] [INFO ] Invariant cache hit.
[2023-03-14 17:34:52] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:34:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:34:52] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 15 ms returned sat
[2023-03-14 17:34:53] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:34:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:54] [INFO ] After 1008ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:34:54] [INFO ] After 1157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-14 17:34:54] [INFO ] After 1719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 66 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:34:54] [INFO ] Invariant cache hit.
[2023-03-14 17:34:55] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1193 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 295323 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295323 steps, saw 74471 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 17:34:58] [INFO ] Invariant cache hit.
[2023-03-14 17:34:58] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:34:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:34:58] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:34:58] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:34:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:34:59] [INFO ] After 988ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:34:59] [INFO ] After 1127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-14 17:35:00] [INFO ] After 1679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 67 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 70 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:35:00] [INFO ] Invariant cache hit.
[2023-03-14 17:35:00] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-14 17:35:00] [INFO ] Invariant cache hit.
[2023-03-14 17:35:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:35:06] [INFO ] Implicit Places using invariants and state equation in 6059 ms returned []
Implicit Place search using SMT with State Equation took 6340 ms to find 0 implicit places.
[2023-03-14 17:35:06] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 17:35:06] [INFO ] Invariant cache hit.
[2023-03-14 17:35:07] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7004 ms. Remains : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 31 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-14 17:35:07] [INFO ] Invariant cache hit.
[2023-03-14 17:35:07] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:35:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:35:07] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-14 17:35:07] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:35:07] [INFO ] After 521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-14 17:35:07] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 334 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 85 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:35:08] [INFO ] Invariant cache hit.
[2023-03-14 17:35:09] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
[2023-03-14 17:35:09] [INFO ] Invariant cache hit.
[2023-03-14 17:35:09] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-14 17:35:09] [INFO ] Invariant cache hit.
[2023-03-14 17:35:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:35:15] [INFO ] Implicit Places using invariants and state equation in 6010 ms returned []
Implicit Place search using SMT with State Equation took 6290 ms to find 0 implicit places.
[2023-03-14 17:35:15] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-14 17:35:15] [INFO ] Invariant cache hit.
[2023-03-14 17:35:15] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7527 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1207 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 17:35:16] [INFO ] Invariant cache hit.
[2023-03-14 17:35:16] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:35:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:35:16] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:35:17] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:35:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:35:18] [INFO ] After 957ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:35:18] [INFO ] After 1097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-14 17:35:18] [INFO ] After 1635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 65 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:35:18] [INFO ] Invariant cache hit.
[2023-03-14 17:35:18] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 170/170 places, 1885/1885 transitions.
Incomplete random walk after 10000 steps, including 1183 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 280221 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280221 steps, saw 70895 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 17:35:22] [INFO ] Invariant cache hit.
[2023-03-14 17:35:22] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:35:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-14 17:35:22] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:35:22] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:35:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:35:23] [INFO ] After 940ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 17:35:23] [INFO ] After 1078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-14 17:35:23] [INFO ] After 1622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 65 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 68 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:35:23] [INFO ] Invariant cache hit.
[2023-03-14 17:35:24] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-14 17:35:24] [INFO ] Invariant cache hit.
[2023-03-14 17:35:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:35:30] [INFO ] Implicit Places using invariants and state equation in 5956 ms returned []
Implicit Place search using SMT with State Equation took 6236 ms to find 0 implicit places.
[2023-03-14 17:35:30] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-14 17:35:30] [INFO ] Invariant cache hit.
[2023-03-14 17:35:30] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6877 ms. Remains : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 26 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-14 17:35:30] [INFO ] Invariant cache hit.
[2023-03-14 17:35:30] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 17:35:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-14 17:35:30] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-14 17:35:31] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 17:35:31] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-14 17:35:31] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 11925 reset in 664 ms.
Product exploration explored 100000 steps with 11956 reset in 668 ms.
Support contains 30 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 77 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:35:33] [INFO ] Invariant cache hit.
[2023-03-14 17:35:33] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
[2023-03-14 17:35:33] [INFO ] Invariant cache hit.
[2023-03-14 17:35:34] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-14 17:35:34] [INFO ] Invariant cache hit.
[2023-03-14 17:35:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:35:40] [INFO ] Implicit Places using invariants and state equation in 5922 ms returned []
Implicit Place search using SMT with State Equation took 6180 ms to find 0 implicit places.
[2023-03-14 17:35:40] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-14 17:35:40] [INFO ] Invariant cache hit.
[2023-03-14 17:35:40] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7387 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-12 finished in 57696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:35:40] [INFO ] Invariant cache hit.
[2023-03-14 17:35:41] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
[2023-03-14 17:35:41] [INFO ] Invariant cache hit.
[2023-03-14 17:35:41] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-14 17:35:41] [INFO ] Invariant cache hit.
[2023-03-14 17:35:42] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:35:48] [INFO ] Implicit Places using invariants and state equation in 6424 ms returned []
Implicit Place search using SMT with State Equation took 6780 ms to find 0 implicit places.
[2023-03-14 17:35:48] [INFO ] Invariant cache hit.
[2023-03-14 17:35:48] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7856 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 1 (ADD s130 s131 s132 s133 s134 s135 s136 s137 s138 s139)) (GT 1 (ADD s160 s161 s162 s163 s164 s165 s166 s167 s168 s169)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1169 ms.
Product exploration explored 100000 steps with 50000 reset in 1174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-13 finished in 10394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:35:51] [INFO ] Invariant cache hit.
[2023-03-14 17:35:51] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
[2023-03-14 17:35:51] [INFO ] Invariant cache hit.
[2023-03-14 17:35:52] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-14 17:35:52] [INFO ] Invariant cache hit.
[2023-03-14 17:35:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:35:58] [INFO ] Implicit Places using invariants and state equation in 6382 ms returned []
Implicit Place search using SMT with State Equation took 6637 ms to find 0 implicit places.
[2023-03-14 17:35:58] [INFO ] Invariant cache hit.
[2023-03-14 17:35:58] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7714 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s140 s141 s142 s143 s144 s145 s146 s147 s148 s149) (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1170 ms.
Product exploration explored 100000 steps with 50000 reset in 1173 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-14 finished in 10199 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 U X(p1))&&X(G(p2))))'
Support contains 50 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-14 17:36:01] [INFO ] Invariant cache hit.
[2023-03-14 17:36:02] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
[2023-03-14 17:36:02] [INFO ] Invariant cache hit.
[2023-03-14 17:36:02] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-14 17:36:02] [INFO ] Invariant cache hit.
[2023-03-14 17:36:02] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-14 17:36:07] [INFO ] Implicit Places using invariants and state equation in 5064 ms returned []
Implicit Place search using SMT with State Equation took 5296 ms to find 0 implicit places.
[2023-03-14 17:36:07] [INFO ] Invariant cache hit.
[2023-03-14 17:36:07] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6425 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (LEQ 3 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159)) (LEQ 1 (ADD s120 s121 s122 s123 s124 s125 s126 s127 s128 s129))), p2:(LEQ (ADD s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-10-LTLCardinality-15 finished in 6615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
[2023-03-14 17:36:08] [INFO ] Flatten gal took : 103 ms
[2023-03-14 17:36:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-14 17:36:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 17 ms.
Total runtime 390747 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PhilosophersDyn-COL-10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLCardinality

FORMULA PhilosophersDyn-COL-10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678815415546

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 13 (type SKEL/SRCH) for 3 PhilosophersDyn-COL-10-LTLCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 13 (type SKEL/SRCH) for PhilosophersDyn-COL-10-LTLCardinality-02
lola: result : false
lola: markings : 27
lola: fired transitions : 39
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 PhilosophersDyn-COL-10-LTLCardinality-12
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for PhilosophersDyn-COL-10-LTLCardinality-12
lola: result : true
lola: markings : 199051
lola: fired transitions : 631330
lola: time used : 2.000000
lola: memory pages used : 2
lola: LAUNCH task # 8 (type EXCL) for 3 PhilosophersDyn-COL-10-LTLCardinality-02
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for PhilosophersDyn-COL-10-LTLCardinality-02
lola: result : true
lola: markings : 199051
lola: fired transitions : 631330
lola: time used : 2.000000
lola: memory pages used : 2
lola: LAUNCH task # 6 (type EXCL) for 3 PhilosophersDyn-COL-10-LTLCardinality-02
lola: time limit : 1798 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for PhilosophersDyn-COL-10-LTLCardinality-02
lola: result : true
lola: markings : 46
lola: fired transitions : 45
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 PhilosophersDyn-COL-10-LTLCardinality-01
lola: time limit : 3596 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 1/3596 1/32 PhilosophersDyn-COL-10-LTLCardinality-01 5184 m, 1036 m/sec, 13071 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 6/3596 1/32 PhilosophersDyn-COL-10-LTLCardinality-01 26293 m, 4221 m/sec, 71825 t fired, .

Time elapsed: 10 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 11/3596 1/32 PhilosophersDyn-COL-10-LTLCardinality-01 46615 m, 4064 m/sec, 132193 t fired, .

Time elapsed: 15 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 16/3596 1/32 PhilosophersDyn-COL-10-LTLCardinality-01 72144 m, 5105 m/sec, 202463 t fired, .

Time elapsed: 20 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 21/3596 1/32 PhilosophersDyn-COL-10-LTLCardinality-01 97749 m, 5121 m/sec, 278567 t fired, .

Time elapsed: 25 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 26/3596 2/32 PhilosophersDyn-COL-10-LTLCardinality-01 122908 m, 5031 m/sec, 353753 t fired, .

Time elapsed: 30 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 31/3596 2/32 PhilosophersDyn-COL-10-LTLCardinality-01 147187 m, 4855 m/sec, 426470 t fired, .

Time elapsed: 35 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 36/3596 2/32 PhilosophersDyn-COL-10-LTLCardinality-01 170010 m, 4564 m/sec, 494693 t fired, .

Time elapsed: 40 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PhilosophersDyn-COL-10-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 41/3596 2/32 PhilosophersDyn-COL-10-LTLCardinality-01 191334 m, 4264 m/sec, 558772 t fired, .

Time elapsed: 45 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 1 (type EXCL) for PhilosophersDyn-COL-10-LTLCardinality-01
lola: result : true
lola: markings : 195251
lola: fired transitions : 570577
lola: time used : 42.000000
lola: memory pages used : 2
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PhilosophersDyn-COL-10-LTLCardinality-01: LTL true LTL model checker
PhilosophersDyn-COL-10-LTLCardinality-02: CONJ true CONJ
PhilosophersDyn-COL-10-LTLCardinality-12: LTL true LTL model checker


Time elapsed: 46 secs. Pages in use: 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-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PhilosophersDyn-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947700283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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