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.r263-smll-167863538400572.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 Peterson-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538400572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.5K Feb 25 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 22:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K 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 Peterson-COL-4-LTLFireability-00
FORMULA_NAME Peterson-COL-4-LTLFireability-01
FORMULA_NAME Peterson-COL-4-LTLFireability-02
FORMULA_NAME Peterson-COL-4-LTLFireability-03
FORMULA_NAME Peterson-COL-4-LTLFireability-04
FORMULA_NAME Peterson-COL-4-LTLFireability-05
FORMULA_NAME Peterson-COL-4-LTLFireability-06
FORMULA_NAME Peterson-COL-4-LTLFireability-07
FORMULA_NAME Peterson-COL-4-LTLFireability-08
FORMULA_NAME Peterson-COL-4-LTLFireability-09
FORMULA_NAME Peterson-COL-4-LTLFireability-10
FORMULA_NAME Peterson-COL-4-LTLFireability-11
FORMULA_NAME Peterson-COL-4-LTLFireability-12
FORMULA_NAME Peterson-COL-4-LTLFireability-13
FORMULA_NAME Peterson-COL-4-LTLFireability-14
FORMULA_NAME Peterson-COL-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678842266433

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 01:04:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 01:04:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 01:04:29] [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-15 01:04:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 01:04:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 840 ms
[2023-03-15 01:04:30] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 01:04:30] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 9 ms.
[2023-03-15 01:04:30] [INFO ] Skeletonized 15 HLPN properties in 21 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-COL-4-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1875 steps, including 0 resets, run visited all 13 properties in 83 ms. (steps per millisecond=22 )
[2023-03-15 01:04:31] [INFO ] Flatten gal took : 30 ms
[2023-03-15 01:04:31] [INFO ] Flatten gal took : 5 ms
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 01:04:31] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 54 ms.
[2023-03-15 01:04:31] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Deduced a syphon composed of 20 places in 10 ms
Reduce places removed 20 places and 40 transitions.
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 28 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:04:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 01:04:31] [INFO ] Computed 19 place invariants in 32 ms
[2023-03-15 01:04:31] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-15 01:04:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:04:31] [INFO ] Invariant cache hit.
[2023-03-15 01:04:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:04:32] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
[2023-03-15 01:04:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:04:32] [INFO ] Invariant cache hit.
[2023-03-15 01:04:33] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1780 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 480 out of 480 places after structural reductions.
[2023-03-15 01:04:33] [INFO ] Flatten gal took : 130 ms
[2023-03-15 01:04:33] [INFO ] Flatten gal took : 105 ms
[2023-03-15 01:04:34] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:04:34] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:04:34] [INFO ] Invariant cache hit.
[2023-03-15 01:04:34] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-15 01:04:34] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2023-03-15 01:04:34] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 01:04:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-15 01:04:34] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 10 ms returned sat
[2023-03-15 01:04:35] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 01:04:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:04:35] [INFO ] After 83ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 01:04:35] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 8 ms to minimize.
[2023-03-15 01:04:35] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 1 ms to minimize.
[2023-03-15 01:04:36] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 2 ms to minimize.
[2023-03-15 01:04:36] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 9 ms to minimize.
[2023-03-15 01:04:36] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 1 ms to minimize.
[2023-03-15 01:04:36] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 1 ms to minimize.
[2023-03-15 01:04:37] [INFO ] Deduced a trap composed of 69 places in 280 ms of which 1 ms to minimize.
[2023-03-15 01:04:37] [INFO ] Deduced a trap composed of 73 places in 212 ms of which 2 ms to minimize.
[2023-03-15 01:04:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2249 ms
[2023-03-15 01:04:37] [INFO ] After 2375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-15 01:04:37] [INFO ] After 2973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 20 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 288 transition count 394
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 184 transition count 394
Applied a total of 592 rules in 109 ms. Remains 184 /480 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 184/480 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46 steps, run visited all 1 properties in 9 ms. (steps per millisecond=5 )
Probabilistic random walk after 46 steps, saw 41 distinct states, run finished after 10 ms. (steps per millisecond=4 ) properties seen :1
FORMULA Peterson-COL-4-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(p0)||X(X(F(p1)))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 43 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:04:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:04:38] [INFO ] Invariant cache hit.
[2023-03-15 01:04:38] [INFO ] Implicit Places using invariants in 252 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 257 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 20 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 322 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (AND (GEQ s33 1) (GEQ s62 1)) (AND (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s35 1) (GEQ s51 1)) (AND (GEQ s37 1) (GEQ s59 1)) (AND (GEQ s31 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20411 reset in 902 ms.
Product exploration explored 100000 steps with 20395 reset in 686 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) (NOT p0)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 367 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 3 factoid took 379 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-15 01:04:42] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 01:04:42] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-15 01:04:43] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-15 01:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:04:44] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2023-03-15 01:04:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:04:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-15 01:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:04:46] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-15 01:04:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:04:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 34 ms returned sat
[2023-03-15 01:04:46] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 80 ms.
[2023-03-15 01:04:51] [INFO ] Added : 387 causal constraints over 78 iterations in 5354 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 25 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:04:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:04:51] [INFO ] Invariant cache hit.
[2023-03-15 01:04:51] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-15 01:04:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:04:51] [INFO ] Invariant cache hit.
[2023-03-15 01:04:52] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:04:52] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2023-03-15 01:04:52] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:04:52] [INFO ] Invariant cache hit.
[2023-03-15 01:04:53] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1636 ms. Remains : 475/475 places, 690/690 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 : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-15 01:04:53] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:04:53] [INFO ] Invariant cache hit.
[2023-03-15 01:04:55] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2023-03-15 01:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:04:56] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2023-03-15 01:04:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:04:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-15 01:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:04:59] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2023-03-15 01:04:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:04:59] [INFO ] [Nat]Added 116 Read/Feed constraints in 59 ms returned sat
[2023-03-15 01:04:59] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 1 ms to minimize.
[2023-03-15 01:04:59] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 1 ms to minimize.
[2023-03-15 01:05:00] [INFO ] Deduced a trap composed of 48 places in 365 ms of which 0 ms to minimize.
[2023-03-15 01:05:00] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 2 ms to minimize.
[2023-03-15 01:05:01] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 1 ms to minimize.
[2023-03-15 01:05:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2096 ms
[2023-03-15 01:05:01] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 71 ms.
[2023-03-15 01:05:08] [INFO ] Added : 399 causal constraints over 80 iterations in 6783 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20382 reset in 879 ms.
Product exploration explored 100000 steps with 20413 reset in 595 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 475 transition count 690
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 116 place count 475 transition count 690
Deduced a syphon composed of 205 places in 2 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 205 place count 475 transition count 690
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 321 place count 359 transition count 574
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 437 place count 359 transition count 574
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 189 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 537 place count 359 transition count 574
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 621 place count 275 transition count 490
Deduced a syphon composed of 105 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 705 place count 275 transition count 490
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 705 rules in 99 ms. Remains 275 /475 variables (removed 200) and now considering 490/690 (removed 200) transitions.
[2023-03-15 01:05:10] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-15 01:05:10] [INFO ] Flow matrix only has 430 transitions (discarded 60 similar events)
// Phase 1: matrix 430 rows 275 cols
[2023-03-15 01:05:10] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 01:05:10] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/475 places, 490/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 610 ms. Remains : 275/475 places, 490/690 transitions.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 23 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:05:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 01:05:10] [INFO ] Computed 14 place invariants in 8 ms
[2023-03-15 01:05:11] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-15 01:05:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:11] [INFO ] Invariant cache hit.
[2023-03-15 01:05:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:05:12] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-15 01:05:12] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:12] [INFO ] Invariant cache hit.
[2023-03-15 01:05:12] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2156 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-COL-4-LTLFireability-00 finished in 34727 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((X((G(p0) U (p2&&G(p0))))||p1))))))'
Support contains 110 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 480 transition count 686
Reduce places removed 4 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 1 with 104 rules applied. Total rules applied 108 place count 476 transition count 586
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 208 place count 376 transition count 586
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 208 place count 376 transition count 566
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 248 place count 356 transition count 566
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 280 place count 340 transition count 550
Applied a total of 280 rules in 72 ms. Remains 340 /480 variables (removed 140) and now considering 550/690 (removed 140) transitions.
[2023-03-15 01:05:13] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
// Phase 1: matrix 490 rows 340 cols
[2023-03-15 01:05:13] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-15 01:05:13] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-15 01:05:13] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-15 01:05:13] [INFO ] Invariant cache hit.
[2023-03-15 01:05:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:05:14] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2023-03-15 01:05:14] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 01:05:14] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-15 01:05:14] [INFO ] Invariant cache hit.
[2023-03-15 01:05:14] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 340/480 places, 550/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1776 ms. Remains : 340/480 places, 550/690 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s116 1) (GEQ s120 1) (GEQ s124 1) (GEQ s128 1) (GEQ s63 1) (GEQ s132 1) (GEQ s67 1) (GEQ s136 1) (GEQ s71 1) (GEQ s140 1) (GEQ s75 1) (GEQ s14...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2 reset in 1311 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-01 finished in 3496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:05:16] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 01:05:16] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 01:05:16] [INFO ] Implicit Places using invariants in 264 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 267 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 291 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s427 1) (GEQ s425 1) (GEQ s423 1) (GEQ s437 1) (GEQ s435 1) (GEQ s433 1) (GEQ s431 1) (GEQ s382 1) (GEQ s445 1) (GEQ s380 1) (GEQ s443 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1661 ms.
Product exploration explored 100000 steps with 0 reset in 1374 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 144 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 237 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:05:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 01:05:21] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 01:05:21] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-15 01:05:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:21] [INFO ] Invariant cache hit.
[2023-03-15 01:05:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:05:22] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-03-15 01:05:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:22] [INFO ] Invariant cache hit.
[2023-03-15 01:05:23] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2179 ms. Remains : 475/475 places, 690/690 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 p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 151 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 262 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1608 ms.
Product exploration explored 100000 steps with 0 reset in 1303 ms.
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:05:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:27] [INFO ] Invariant cache hit.
[2023-03-15 01:05:28] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-15 01:05:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:28] [INFO ] Invariant cache hit.
[2023-03-15 01:05:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:05:29] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2023-03-15 01:05:29] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:29] [INFO ] Invariant cache hit.
[2023-03-15 01:05:29] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1910 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-COL-4-LTLFireability-02 finished in 13264 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(!p1))||p0)) U (F(p2)&&X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:05:29] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 01:05:30] [INFO ] Computed 19 place invariants in 9 ms
[2023-03-15 01:05:30] [INFO ] Implicit Places using invariants in 302 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 304 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 322 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s188 1) (GEQ s187 1) (GEQ s170 1) (GEQ s174 1) (GEQ s172 1) (GEQ s171 1) (GEQ s178 1) (GEQ s176 1) (GEQ s175 1) (GEQ s182 1) (GEQ s180 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6649 reset in 1644 ms.
Stack based approach found an accepted trace after 28 steps with 1 reset with depth 13 and stack size 13 in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-05 finished in 2394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((X(p1)||p0)))) U (G(p2)||X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:05:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:32] [INFO ] Invariant cache hit.
[2023-03-15 01:05:32] [INFO ] Implicit Places using invariants in 222 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 223 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (GEQ s427 1) (GEQ s425 1) (GEQ s423 1) (GEQ s437 1) (GEQ s435 1) (GEQ s433 1) (GEQ s431 1) (GEQ s382 1) (GEQ s445 1) (GEQ s380 1) (GEQ s443 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-06 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(((p1||X(X(F(p2)))) U (p3&&(p1||X(X(F(p2)))))))||p0))))'
Support contains 225 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:05:33] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:33] [INFO ] Invariant cache hit.
[2023-03-15 01:05:33] [INFO ] Implicit Places using invariants in 142 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 144 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s313 1)) (AND (GEQ s3 1) (GEQ s360 1)) (AND (GEQ s3 1) (GEQ s307 1)) (AND (GEQ s9 1) (GEQ s310 1)) (AND (GEQ s7 1) (GEQ s366 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13394 reset in 928 ms.
Product exploration explored 100000 steps with 13364 reset in 713 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 p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 6 states, 7 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Finished random walk after 25 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
[2023-03-15 01:05:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 01:05:36] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 01:05:38] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2023-03-15 01:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:05:39] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2023-03-15 01:05:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:05:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-15 01:05:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:05:41] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2023-03-15 01:05:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:05:41] [INFO ] [Nat]Added 116 Read/Feed constraints in 47 ms returned sat
[2023-03-15 01:05:41] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 1 ms to minimize.
[2023-03-15 01:05:42] [INFO ] Deduced a trap composed of 14 places in 408 ms of which 1 ms to minimize.
[2023-03-15 01:05:42] [INFO ] Deduced a trap composed of 46 places in 416 ms of which 2 ms to minimize.
[2023-03-15 01:05:42] [INFO ] Deduced a trap composed of 98 places in 299 ms of which 1 ms to minimize.
[2023-03-15 01:05:43] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 2 ms to minimize.
[2023-03-15 01:05:43] [INFO ] Deduced a trap composed of 73 places in 308 ms of which 1 ms to minimize.
[2023-03-15 01:05:44] [INFO ] Deduced a trap composed of 91 places in 313 ms of which 1 ms to minimize.
[2023-03-15 01:05:44] [INFO ] Deduced a trap composed of 95 places in 291 ms of which 1 ms to minimize.
[2023-03-15 01:05:44] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 1 ms to minimize.
[2023-03-15 01:05:44] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 1 ms to minimize.
[2023-03-15 01:05:45] [INFO ] Deduced a trap composed of 95 places in 257 ms of which 1 ms to minimize.
[2023-03-15 01:05:45] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 1 ms to minimize.
[2023-03-15 01:05:45] [INFO ] Deduced a trap composed of 91 places in 274 ms of which 1 ms to minimize.
[2023-03-15 01:05:46] [INFO ] Deduced a trap composed of 69 places in 257 ms of which 1 ms to minimize.
[2023-03-15 01:05:46] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5072 ms
[2023-03-15 01:05:46] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 83 ms.
[2023-03-15 01:05:54] [INFO ] Added : 441 causal constraints over 89 iterations in 7918 ms. Result :sat
Could not prove EG (NOT p3)
[2023-03-15 01:05:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:05:54] [INFO ] Invariant cache hit.
[2023-03-15 01:05:56] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-15 01:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:05:57] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2023-03-15 01:05:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:05:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-15 01:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:00] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2023-03-15 01:06:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 49 ms returned sat
[2023-03-15 01:06:00] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 1 ms to minimize.
[2023-03-15 01:06:01] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 1 ms to minimize.
[2023-03-15 01:06:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 677 ms
[2023-03-15 01:06:01] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 62 ms.
[2023-03-15 01:06:04] [INFO ] Added : 201 causal constraints over 41 iterations in 3032 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:06:04] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:06:04] [INFO ] Invariant cache hit.
[2023-03-15 01:06:04] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-15 01:06:04] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:06:04] [INFO ] Invariant cache hit.
[2023-03-15 01:06:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:04] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-15 01:06:04] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:06:04] [INFO ] Invariant cache hit.
[2023-03-15 01:06:05] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1625 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F p3), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 244 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
[2023-03-15 01:06:07] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:06:07] [INFO ] Invariant cache hit.
[2023-03-15 01:06:08] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-15 01:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:09] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2023-03-15 01:06:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:06:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-15 01:06:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:12] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2023-03-15 01:06:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:12] [INFO ] [Nat]Added 116 Read/Feed constraints in 45 ms returned sat
[2023-03-15 01:06:12] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 1 ms to minimize.
[2023-03-15 01:06:12] [INFO ] Deduced a trap composed of 53 places in 389 ms of which 2 ms to minimize.
[2023-03-15 01:06:13] [INFO ] Deduced a trap composed of 42 places in 375 ms of which 1 ms to minimize.
[2023-03-15 01:06:13] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 1 ms to minimize.
[2023-03-15 01:06:14] [INFO ] Deduced a trap composed of 39 places in 392 ms of which 5 ms to minimize.
[2023-03-15 01:06:14] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2023-03-15 01:06:14] [INFO ] Deduced a trap composed of 42 places in 383 ms of which 1 ms to minimize.
[2023-03-15 01:06:15] [INFO ] Deduced a trap composed of 61 places in 420 ms of which 1 ms to minimize.
[2023-03-15 01:06:15] [INFO ] Deduced a trap composed of 34 places in 402 ms of which 1 ms to minimize.
[2023-03-15 01:06:16] [INFO ] Deduced a trap composed of 91 places in 431 ms of which 1 ms to minimize.
[2023-03-15 01:06:16] [INFO ] Deduced a trap composed of 116 places in 361 ms of which 1 ms to minimize.
[2023-03-15 01:06:17] [INFO ] Deduced a trap composed of 62 places in 391 ms of which 0 ms to minimize.
[2023-03-15 01:06:17] [INFO ] Deduced a trap composed of 49 places in 350 ms of which 1 ms to minimize.
[2023-03-15 01:06:17] [INFO ] Deduced a trap composed of 64 places in 345 ms of which 1 ms to minimize.
[2023-03-15 01:06:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5971 ms
[2023-03-15 01:06:18] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 65 ms.
[2023-03-15 01:06:25] [INFO ] Deduced a trap composed of 2 places in 501 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 01:06:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
[2023-03-15 01:06:25] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:06:25] [INFO ] Invariant cache hit.
[2023-03-15 01:06:27] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-15 01:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:28] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2023-03-15 01:06:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:06:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 30 ms returned sat
[2023-03-15 01:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:31] [INFO ] [Nat]Absence check using state equation in 902 ms returned sat
[2023-03-15 01:06:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 48 ms returned sat
[2023-03-15 01:06:31] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2023-03-15 01:06:31] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 1 ms to minimize.
[2023-03-15 01:06:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2023-03-15 01:06:31] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 61 ms.
[2023-03-15 01:06:35] [INFO ] Added : 201 causal constraints over 41 iterations in 3551 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 13405 reset in 999 ms.
Product exploration explored 100000 steps with 13359 reset in 627 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 475 transition count 690
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 36 place count 475 transition count 690
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 125 place count 475 transition count 690
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 177 place count 423 transition count 638
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 229 place count 423 transition count 638
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 249 place count 423 transition count 638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 253 place count 419 transition count 634
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 257 place count 419 transition count 634
Deduced a syphon composed of 89 places in 0 ms
Applied a total of 257 rules in 76 ms. Remains 419 /475 variables (removed 56) and now considering 634/690 (removed 56) transitions.
[2023-03-15 01:06:37] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 01:06:37] [INFO ] Flow matrix only has 574 transitions (discarded 60 similar events)
// Phase 1: matrix 574 rows 419 cols
[2023-03-15 01:06:37] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 01:06:38] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/475 places, 634/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 701 ms. Remains : 419/475 places, 634/690 transitions.
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:06:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 01:06:38] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 01:06:38] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-15 01:06:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:06:38] [INFO ] Invariant cache hit.
[2023-03-15 01:06:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:39] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-03-15 01:06:39] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:06:39] [INFO ] Invariant cache hit.
[2023-03-15 01:06:40] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1457 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-COL-4-LTLFireability-07 finished in 67040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 80 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 480 transition count 634
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 424 transition count 634
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 112 place count 424 transition count 550
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 280 place count 340 transition count 550
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 320 transition count 530
Applied a total of 320 rules in 66 ms. Remains 320 /480 variables (removed 160) and now considering 530/690 (removed 160) transitions.
[2023-03-15 01:06:40] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
// Phase 1: matrix 470 rows 320 cols
[2023-03-15 01:06:40] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 01:06:40] [INFO ] Implicit Places using invariants in 359 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 363 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/480 places, 530/690 transitions.
Applied a total of 0 rules in 14 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 445 ms. Remains : 315/480 places, 530/690 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s144 1) (GEQ s142 1) (GEQ s96 1) (GEQ s150 1) (GEQ s152 1) (GEQ s147 1) (GEQ s99 1) (GEQ s98 1) (GEQ s149 1) (GEQ s157 1) (GEQ s101 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7762 reset in 743 ms.
Product exploration explored 100000 steps with 7767 reset in 517 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-15 01:06:42] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
// Phase 1: matrix 470 rows 315 cols
[2023-03-15 01:06:42] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 01:06:43] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-15 01:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:43] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2023-03-15 01:06:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:06:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-15 01:06:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:44] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2023-03-15 01:06:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:44] [INFO ] [Nat]Added 116 Read/Feed constraints in 54 ms returned sat
[2023-03-15 01:06:45] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 1 ms to minimize.
[2023-03-15 01:06:45] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 1 ms to minimize.
[2023-03-15 01:06:45] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 1 ms to minimize.
[2023-03-15 01:06:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 857 ms
[2023-03-15 01:06:45] [INFO ] Computed and/alt/rep : 429/946/429 causal constraints (skipped 36 transitions) in 54 ms.
[2023-03-15 01:06:47] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 3 ms to minimize.
[2023-03-15 01:06:48] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 1 ms to minimize.
[2023-03-15 01:06:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2023-03-15 01:06:48] [INFO ] Added : 141 causal constraints over 29 iterations in 2657 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Applied a total of 0 rules in 14 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2023-03-15 01:06:48] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-15 01:06:48] [INFO ] Invariant cache hit.
[2023-03-15 01:06:48] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-15 01:06:48] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-15 01:06:48] [INFO ] Invariant cache hit.
[2023-03-15 01:06:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:49] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2023-03-15 01:06:49] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 01:06:49] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-15 01:06:49] [INFO ] Invariant cache hit.
[2023-03-15 01:06:50] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1932 ms. Remains : 315/315 places, 530/530 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-15 01:06:50] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-15 01:06:50] [INFO ] Invariant cache hit.
[2023-03-15 01:06:51] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-15 01:06:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:51] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2023-03-15 01:06:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 01:06:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-15 01:06:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 01:06:53] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-15 01:06:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:53] [INFO ] [Nat]Added 116 Read/Feed constraints in 72 ms returned sat
[2023-03-15 01:06:53] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 0 ms to minimize.
[2023-03-15 01:06:53] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 1 ms to minimize.
[2023-03-15 01:06:53] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 1 ms to minimize.
[2023-03-15 01:06:54] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 1 ms to minimize.
[2023-03-15 01:06:54] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2023-03-15 01:06:54] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2023-03-15 01:06:54] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 1 ms to minimize.
[2023-03-15 01:06:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1582 ms
[2023-03-15 01:06:54] [INFO ] Computed and/alt/rep : 429/946/429 causal constraints (skipped 36 transitions) in 31 ms.
[2023-03-15 01:06:56] [INFO ] Added : 169 causal constraints over 34 iterations in 1438 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7780 reset in 669 ms.
Product exploration explored 100000 steps with 7725 reset in 478 ms.
Support contains 80 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2023-03-15 01:06:57] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-15 01:06:57] [INFO ] Invariant cache hit.
[2023-03-15 01:06:57] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-15 01:06:57] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-15 01:06:57] [INFO ] Invariant cache hit.
[2023-03-15 01:06:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:06:58] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
[2023-03-15 01:06:58] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 01:06:58] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-15 01:06:58] [INFO ] Invariant cache hit.
[2023-03-15 01:06:59] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2087 ms. Remains : 315/315 places, 530/530 transitions.
Treatment of property Peterson-COL-4-LTLFireability-08 finished in 19454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 40 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 640 place count 160 transition count 370
Applied a total of 640 rules in 32 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2023-03-15 01:06:59] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2023-03-15 01:06:59] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 01:06:59] [INFO ] Implicit Places using invariants in 236 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 239 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/480 places, 370/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 280 ms. Remains : 155/480 places, 370/690 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s43 1)) (AND (GEQ s20 1) (GEQ s44 1)) (AND (GEQ s25 1) (GEQ s49 1)) (AND (GEQ s30 1) (GEQ s46 1)) (AND (GEQ s15 1) (GEQ s47 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12858 reset in 1040 ms.
Stack based approach found an accepted trace after 30 steps with 3 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-09 finished in 1395 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))'
Support contains 120 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 480 transition count 634
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 424 transition count 634
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 112 place count 424 transition count 565
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 250 place count 355 transition count 565
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 290 place count 335 transition count 545
Applied a total of 290 rules in 41 ms. Remains 335 /480 variables (removed 145) and now considering 545/690 (removed 145) transitions.
[2023-03-15 01:07:01] [INFO ] Flow matrix only has 485 transitions (discarded 60 similar events)
// Phase 1: matrix 485 rows 335 cols
[2023-03-15 01:07:01] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 01:07:01] [INFO ] Implicit Places using invariants in 226 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 228 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 330/480 places, 545/690 transitions.
Applied a total of 0 rules in 14 ms. Remains 330 /330 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 330/480 places, 545/690 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s159 1) (GEQ s157 1) (GEQ s111 1) (GEQ s165 1) (GEQ s167 1) (GEQ s162 1) (GEQ s114 1) (GEQ s113 1) (GEQ s164 1) (GEQ s172 1) (GEQ s116 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-10 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 15 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:07:01] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 01:07:01] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 01:07:01] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-15 01:07:01] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:07:01] [INFO ] Invariant cache hit.
[2023-03-15 01:07:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:07:03] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
[2023-03-15 01:07:03] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:07:03] [INFO ] Invariant cache hit.
[2023-03-15 01:07:03] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2468 ms. Remains : 480/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s178 1) (GEQ s194 1) (GEQ s182 1) (GEQ s186 1) (GEQ s190 1)), p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s11 1)) (AND (GEQ s2 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 831 reset in 186 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-11 finished in 2806 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(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 480 transition count 570
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 360 transition count 570
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 240 place count 360 transition count 475
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 430 place count 265 transition count 475
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 470 place count 245 transition count 455
Applied a total of 470 rules in 20 ms. Remains 245 /480 variables (removed 235) and now considering 455/690 (removed 235) transitions.
[2023-03-15 01:07:04] [INFO ] Flow matrix only has 395 transitions (discarded 60 similar events)
// Phase 1: matrix 395 rows 245 cols
[2023-03-15 01:07:04] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 01:07:04] [INFO ] Implicit Places using invariants in 138 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 140 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/480 places, 455/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 240 /240 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 240/480 places, 455/690 transitions.
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s7 1) (GEQ s118 1)) (AND (GEQ s3 1) (GEQ s165 1)) (AND (GEQ s3 1) (GEQ s112 1)) (AND (GEQ s9 1) (GEQ s115 1)) (AND (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2138 ms.
Stack based approach found an accepted trace after 127 steps with 0 reset with depth 128 and stack size 128 in 3 ms.
FORMULA Peterson-COL-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-12 finished in 2390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((F(p0)&&F(G(!p1)))))))'
Support contains 160 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 480 transition count 682
Reduce places removed 8 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 24 rules applied. Total rules applied 32 place count 472 transition count 666
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 48 place count 456 transition count 666
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 48 place count 456 transition count 642
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 96 place count 432 transition count 642
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 128 place count 416 transition count 626
Applied a total of 128 rules in 39 ms. Remains 416 /480 variables (removed 64) and now considering 626/690 (removed 64) transitions.
[2023-03-15 01:07:06] [INFO ] Flow matrix only has 566 transitions (discarded 60 similar events)
// Phase 1: matrix 566 rows 416 cols
[2023-03-15 01:07:06] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 01:07:06] [INFO ] Implicit Places using invariants in 281 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 283 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/480 places, 626/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 411 /411 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 411/480 places, 626/690 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s373 1) (GEQ s371 1) (GEQ s370 1) (GEQ s381 1) (GEQ s379 1) (GEQ s378 1) (GEQ s376 1) (GEQ s337 1) (GEQ s387 1) (GEQ s335 1) (GEQ s386 1) (GEQ...], 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 77 reset in 568 ms.
Stack based approach found an accepted trace after 752 steps with 25 reset with depth 24 and stack size 24 in 4 ms.
FORMULA Peterson-COL-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-13 finished in 1040 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(F(p0))||(F(p0)&&X(X(X(F((!p1||G(p0))))))))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:07:07] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 01:07:07] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 01:07:07] [INFO ] Implicit Places using invariants in 336 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 338 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 352 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 392 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LT s429 1) (LT s459 1) (LT s394 1) (LT s424 1) (LT s469 1) (LT s404 1) (LT s434 1) (LT s399 1) (LT s464 1) (LT s414 1) (LT s379 1) (LT s444 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17886 reset in 846 ms.
Product exploration explored 100000 steps with 17849 reset in 751 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 263 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:07:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 01:07:11] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 01:07:11] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-15 01:07:11] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 01:07:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-15 01:07:12] [INFO ] After 1041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 01:07:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:07:13] [INFO ] After 646ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 01:07:13] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 2 ms to minimize.
[2023-03-15 01:07:14] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 0 ms to minimize.
[2023-03-15 01:07:14] [INFO ] Deduced a trap composed of 81 places in 189 ms of which 0 ms to minimize.
[2023-03-15 01:07:14] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 1 ms to minimize.
[2023-03-15 01:07:14] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 1 ms to minimize.
[2023-03-15 01:07:14] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 1 ms to minimize.
[2023-03-15 01:07:15] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 1 ms to minimize.
[2023-03-15 01:07:15] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 1 ms to minimize.
[2023-03-15 01:07:15] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 3 ms to minimize.
[2023-03-15 01:07:15] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2023-03-15 01:07:15] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 0 ms to minimize.
[2023-03-15 01:07:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2172 ms
[2023-03-15 01:07:16] [INFO ] Deduced a trap composed of 43 places in 316 ms of which 1 ms to minimize.
[2023-03-15 01:07:16] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 1 ms to minimize.
[2023-03-15 01:07:17] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 0 ms to minimize.
[2023-03-15 01:07:17] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 1 ms to minimize.
[2023-03-15 01:07:17] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 1 ms to minimize.
[2023-03-15 01:07:17] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 0 ms to minimize.
[2023-03-15 01:07:18] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 1 ms to minimize.
[2023-03-15 01:07:18] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 1 ms to minimize.
[2023-03-15 01:07:18] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 1 ms to minimize.
[2023-03-15 01:07:19] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2023-03-15 01:07:19] [INFO ] Deduced a trap composed of 80 places in 306 ms of which 1 ms to minimize.
[2023-03-15 01:07:20] [INFO ] Deduced a trap composed of 69 places in 303 ms of which 1 ms to minimize.
[2023-03-15 01:07:20] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 1 ms to minimize.
[2023-03-15 01:07:20] [INFO ] Deduced a trap composed of 61 places in 291 ms of which 0 ms to minimize.
[2023-03-15 01:07:20] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4836 ms
[2023-03-15 01:07:21] [INFO ] After 8138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 935 ms.
[2023-03-15 01:07:21] [INFO ] After 10316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 85 ms.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 475 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 283 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 283 transition count 394
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 179 transition count 394
Applied a total of 592 rules in 26 ms. Remains 179 /475 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 179/475 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 665934 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{0=1}
Probabilistic random walk after 665934 steps, saw 111676 distinct states, run finished after 3002 ms. (steps per millisecond=221 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-15 01:07:25] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-15 01:07:25] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 01:07:25] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-15 01:07:25] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 01:07:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-15 01:07:26] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 01:07:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:07:26] [INFO ] After 509ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 01:07:27] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2023-03-15 01:07:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-15 01:07:27] [INFO ] After 1173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 506 ms.
[2023-03-15 01:07:28] [INFO ] After 2437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 761592 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :{}
Probabilistic random walk after 761592 steps, saw 127621 distinct states, run finished after 3007 ms. (steps per millisecond=253 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:07:31] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:07:31] [INFO ] Invariant cache hit.
[2023-03-15 01:07:31] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-15 01:07:31] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 01:07:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-15 01:07:32] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 01:07:32] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:07:32] [INFO ] After 487ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 01:07:33] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-15 01:07:33] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-15 01:07:33] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-15 01:07:33] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-15 01:07:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 640 ms
[2023-03-15 01:07:33] [INFO ] After 1577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 504 ms.
[2023-03-15 01:07:34] [INFO ] After 2734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 179/179 places, 394/394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 10 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-15 01:07:34] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:07:34] [INFO ] Invariant cache hit.
[2023-03-15 01:07:34] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-15 01:07:34] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:07:34] [INFO ] Invariant cache hit.
[2023-03-15 01:07:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:07:35] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-15 01:07:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 01:07:35] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:07:35] [INFO ] Invariant cache hit.
[2023-03-15 01:07:35] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1154 ms. Remains : 179/179 places, 394/394 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 179 transition count 334
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 169 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 164 transition count 324
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 145 place count 164 transition count 264
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 185 place count 164 transition count 224
Reduce places removed 40 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 60 rules applied. Total rules applied 245 place count 124 transition count 204
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 265 place count 104 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 104 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 273 place count 100 transition count 200
Applied a total of 273 rules in 100 ms. Remains 100 /179 variables (removed 79) and now considering 200/394 (removed 194) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 100 cols
[2023-03-15 01:07:35] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 01:07:35] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-15 01:07:35] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 01:07:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-15 01:07:36] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 01:07:36] [INFO ] After 691ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-15 01:07:36] [INFO ] After 1107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:07:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 01:07:37] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-15 01:07:37] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-15 01:07:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:07:37] [INFO ] Invariant cache hit.
[2023-03-15 01:07:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:07:38] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2023-03-15 01:07:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:07:38] [INFO ] Invariant cache hit.
[2023-03-15 01:07:39] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2031 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:07:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:07:40] [INFO ] Invariant cache hit.
[2023-03-15 01:07:40] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-15 01:07:41] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 01:07:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-15 01:07:42] [INFO ] After 1006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 01:07:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:07:43] [INFO ] After 753ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 01:07:43] [INFO ] Deduced a trap composed of 54 places in 273 ms of which 1 ms to minimize.
[2023-03-15 01:07:43] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 1 ms to minimize.
[2023-03-15 01:07:44] [INFO ] Deduced a trap composed of 54 places in 265 ms of which 1 ms to minimize.
[2023-03-15 01:07:44] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 1 ms to minimize.
[2023-03-15 01:07:44] [INFO ] Deduced a trap composed of 57 places in 268 ms of which 1 ms to minimize.
[2023-03-15 01:07:45] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 1 ms to minimize.
[2023-03-15 01:07:45] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 1 ms to minimize.
[2023-03-15 01:07:45] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 0 ms to minimize.
[2023-03-15 01:07:45] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 1 ms to minimize.
[2023-03-15 01:07:45] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 1 ms to minimize.
[2023-03-15 01:07:46] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 1 ms to minimize.
[2023-03-15 01:07:46] [INFO ] Deduced a trap composed of 36 places in 267 ms of which 1 ms to minimize.
[2023-03-15 01:07:46] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 1 ms to minimize.
[2023-03-15 01:07:47] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 1 ms to minimize.
[2023-03-15 01:07:47] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 0 ms to minimize.
[2023-03-15 01:07:47] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 1 ms to minimize.
[2023-03-15 01:07:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4678 ms
[2023-03-15 01:07:49] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 1 ms to minimize.
[2023-03-15 01:07:49] [INFO ] Deduced a trap composed of 14 places in 371 ms of which 1 ms to minimize.
[2023-03-15 01:07:50] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 1 ms to minimize.
[2023-03-15 01:07:50] [INFO ] Deduced a trap composed of 25 places in 314 ms of which 1 ms to minimize.
[2023-03-15 01:07:50] [INFO ] Deduced a trap composed of 69 places in 251 ms of which 1 ms to minimize.
[2023-03-15 01:07:51] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 1 ms to minimize.
[2023-03-15 01:07:51] [INFO ] Deduced a trap composed of 15 places in 316 ms of which 1 ms to minimize.
[2023-03-15 01:07:51] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 1 ms to minimize.
[2023-03-15 01:07:52] [INFO ] Deduced a trap composed of 58 places in 271 ms of which 1 ms to minimize.
[2023-03-15 01:07:52] [INFO ] Deduced a trap composed of 78 places in 258 ms of which 5 ms to minimize.
[2023-03-15 01:07:53] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 1 ms to minimize.
[2023-03-15 01:07:53] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 1 ms to minimize.
[2023-03-15 01:07:53] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 1 ms to minimize.
[2023-03-15 01:07:54] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 1 ms to minimize.
[2023-03-15 01:07:54] [INFO ] Deduced a trap composed of 27 places in 350 ms of which 1 ms to minimize.
[2023-03-15 01:07:55] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 1 ms to minimize.
[2023-03-15 01:07:55] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 1 ms to minimize.
[2023-03-15 01:07:56] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 0 ms to minimize.
[2023-03-15 01:07:56] [INFO ] Deduced a trap composed of 39 places in 373 ms of which 1 ms to minimize.
[2023-03-15 01:07:57] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 1 ms to minimize.
[2023-03-15 01:07:57] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 1 ms to minimize.
[2023-03-15 01:07:57] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8751 ms
[2023-03-15 01:07:57] [INFO ] After 15083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1108 ms.
[2023-03-15 01:07:58] [INFO ] After 17394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 102 ms.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 475 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 283 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 283 transition count 394
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 179 transition count 394
Applied a total of 592 rules in 30 ms. Remains 179 /475 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 179/475 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Finished Best-First random walk after 3409 steps, including 1 resets, run visited all 2 properties in 54 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17816 reset in 721 ms.
Product exploration explored 100000 steps with 17695 reset in 499 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 475 transition count 690
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 112 place count 475 transition count 690
Deduced a syphon composed of 201 places in 1 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 201 place count 475 transition count 690
Discarding 112 places :
Symmetric choice reduction at 1 with 112 rule applications. Total rules 313 place count 363 transition count 578
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 425 place count 363 transition count 578
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 184 places in 1 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 520 place count 363 transition count 578
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 600 place count 283 transition count 498
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 680 place count 283 transition count 498
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 680 rules in 67 ms. Remains 283 /475 variables (removed 192) and now considering 498/690 (removed 192) transitions.
[2023-03-15 01:08:01] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 01:08:01] [INFO ] Flow matrix only has 438 transitions (discarded 60 similar events)
// Phase 1: matrix 438 rows 283 cols
[2023-03-15 01:08:01] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 01:08:02] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/475 places, 498/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 695 ms. Remains : 283/475 places, 498/690 transitions.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-15 01:08:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-15 01:08:02] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 01:08:02] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-15 01:08:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:08:02] [INFO ] Invariant cache hit.
[2023-03-15 01:08:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:03] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2023-03-15 01:08:03] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-15 01:08:03] [INFO ] Invariant cache hit.
[2023-03-15 01:08:04] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2232 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-COL-4-LTLFireability-14 finished in 57192 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 80 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 480 transition count 602
Reduce places removed 88 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 168 rules applied. Total rules applied 256 place count 392 transition count 522
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 336 place count 312 transition count 522
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 336 place count 312 transition count 482
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 416 place count 272 transition count 482
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 448 place count 256 transition count 466
Applied a total of 448 rules in 35 ms. Remains 256 /480 variables (removed 224) and now considering 466/690 (removed 224) transitions.
[2023-03-15 01:08:04] [INFO ] Flow matrix only has 406 transitions (discarded 60 similar events)
// Phase 1: matrix 406 rows 256 cols
[2023-03-15 01:08:04] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 01:08:05] [INFO ] Implicit Places using invariants in 325 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 327 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/480 places, 466/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 374 ms. Remains : 251/480 places, 466/690 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s213 1) (GEQ s211 1) (GEQ s210 1) (GEQ s221 1) (GEQ s219 1) (GEQ s218 1) (GEQ s216 1) (GEQ s177 1) (GEQ s227 1) (GEQ s175 1) (GEQ s226 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 802 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-15 finished in 1250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Found a Shortening insensitive property : Peterson-COL-4-LTLFireability-00
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 400 place count 280 transition count 405
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 570 place count 195 transition count 405
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 610 place count 175 transition count 385
Applied a total of 610 rules in 28 ms. Remains 175 /480 variables (removed 305) and now considering 385/690 (removed 305) transitions.
[2023-03-15 01:08:06] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
// Phase 1: matrix 325 rows 175 cols
[2023-03-15 01:08:06] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 01:08:06] [INFO ] Implicit Places using invariants in 227 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 241 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 170/480 places, 385/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 276 ms. Remains : 170/480 places, 385/690 transitions.
Running random walk in product with property : Peterson-COL-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (AND (GEQ s33 1) (GEQ s62 1)) (AND (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s35 1) (GEQ s51 1)) (AND (GEQ s37 1) (GEQ s59 1)) (AND (GEQ s31 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20588 reset in 552 ms.
Stack based approach found an accepted trace after 42971 steps with 8836 reset with depth 7 and stack size 7 in 186 ms.
Treatment of property Peterson-COL-4-LTLFireability-00 finished in 1390 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Found a Lengthening insensitive property : Peterson-COL-4-LTLFireability-02
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 480 transition count 602
Reduce places removed 88 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 168 rules applied. Total rules applied 256 place count 392 transition count 522
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 336 place count 312 transition count 522
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 336 place count 312 transition count 502
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 376 place count 292 transition count 502
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 408 place count 276 transition count 486
Applied a total of 408 rules in 29 ms. Remains 276 /480 variables (removed 204) and now considering 486/690 (removed 204) transitions.
[2023-03-15 01:08:07] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 276 cols
[2023-03-15 01:08:07] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 01:08:08] [INFO ] Implicit Places using invariants in 359 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 361 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 271/480 places, 486/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 397 ms. Remains : 271/480 places, 486/690 transitions.
Running random walk in product with property : Peterson-COL-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s233 1) (GEQ s231 1) (GEQ s230 1) (GEQ s241 1) (GEQ s239 1) (GEQ s238 1) (GEQ s236 1) (GEQ s197 1) (GEQ s247 1) (GEQ s195 1) (GEQ s246 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1521 ms.
Product exploration explored 100000 steps with 0 reset in 1457 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 82 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 248 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-15 01:08:12] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 271 cols
[2023-03-15 01:08:12] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-15 01:08:12] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-15 01:08:12] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 01:08:12] [INFO ] Invariant cache hit.
[2023-03-15 01:08:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:13] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2023-03-15 01:08:13] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 01:08:13] [INFO ] Invariant cache hit.
[2023-03-15 01:08:13] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1345 ms. Remains : 271/271 places, 486/486 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 p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 88 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1479 ms.
Product exploration explored 100000 steps with 0 reset in 1278 ms.
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-15 01:08:17] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 01:08:17] [INFO ] Invariant cache hit.
[2023-03-15 01:08:17] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-15 01:08:17] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 01:08:17] [INFO ] Invariant cache hit.
[2023-03-15 01:08:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:18] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2023-03-15 01:08:18] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-15 01:08:18] [INFO ] Invariant cache hit.
[2023-03-15 01:08:18] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1259 ms. Remains : 271/271 places, 486/486 transitions.
Treatment of property Peterson-COL-4-LTLFireability-02 finished in 11390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(((p1||X(X(F(p2)))) U (p3&&(p1||X(X(F(p2)))))))||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' '!(F(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((G(F(p0))||(F(p0)&&X(X(X(F((!p1||G(p0))))))))))'
Found a Shortening insensitive property : Peterson-COL-4-LTLFireability-14
Stuttering acceptance computed with spot in 346 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 288 transition count 394
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 184 transition count 394
Applied a total of 592 rules in 21 ms. Remains 184 /480 variables (removed 296) and now considering 394/690 (removed 296) transitions.
[2023-03-15 01:08:19] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 184 cols
[2023-03-15 01:08:19] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 01:08:19] [INFO ] Implicit Places using invariants in 251 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 253 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 179/480 places, 394/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 282 ms. Remains : 179/480 places, 394/690 transitions.
Running random walk in product with property : Peterson-COL-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LT s138 1) (LT s163 1) (LT s110 1) (LT s134 1) (LT s173 1) (LT s118 1) (LT s142 1) (LT s114 1) (LT s168 1) (LT s126 1) (LT s98 1) (LT s150 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17636 reset in 689 ms.
Product exploration explored 100000 steps with 17469 reset in 469 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:08:21] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-15 01:08:21] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 01:08:22] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-15 01:08:22] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 01:08:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 01:08:23] [INFO ] After 699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 01:08:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:23] [INFO ] After 537ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 01:08:23] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-15 01:08:23] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2023-03-15 01:08:24] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2023-03-15 01:08:25] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2135 ms
[2023-03-15 01:08:26] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-15 01:08:26] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 0 ms to minimize.
[2023-03-15 01:08:26] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-15 01:08:26] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2023-03-15 01:08:26] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-03-15 01:08:27] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-15 01:08:28] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2023-03-15 01:08:28] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-15 01:08:28] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-15 01:08:28] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2023-03-15 01:08:28] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-15 01:08:28] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-15 01:08:28] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-15 01:08:28] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2648 ms
[2023-03-15 01:08:28] [INFO ] After 5836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 395 ms.
[2023-03-15 01:08:29] [INFO ] After 7054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 46 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 700032 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{0=1}
Probabilistic random walk after 700032 steps, saw 117372 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-15 01:08:32] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:32] [INFO ] Invariant cache hit.
[2023-03-15 01:08:32] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-15 01:08:32] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 01:08:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-15 01:08:33] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 01:08:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:34] [INFO ] After 536ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 01:08:34] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-15 01:08:34] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-15 01:08:34] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-15 01:08:34] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2023-03-15 01:08:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 517 ms
[2023-03-15 01:08:34] [INFO ] After 1380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 506 ms.
[2023-03-15 01:08:35] [INFO ] After 2468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 728376 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728376 steps, saw 122118 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 01:08:38] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:38] [INFO ] Invariant cache hit.
[2023-03-15 01:08:38] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-15 01:08:38] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 01:08:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 01:08:39] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 01:08:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:39] [INFO ] After 337ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 01:08:40] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-15 01:08:40] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2023-03-15 01:08:40] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-15 01:08:40] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2023-03-15 01:08:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 492 ms
[2023-03-15 01:08:40] [INFO ] After 1145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-15 01:08:40] [INFO ] After 2013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 179/179 places, 394/394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-15 01:08:40] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:40] [INFO ] Invariant cache hit.
[2023-03-15 01:08:40] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-15 01:08:40] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:40] [INFO ] Invariant cache hit.
[2023-03-15 01:08:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:41] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-15 01:08:41] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 01:08:41] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:41] [INFO ] Invariant cache hit.
[2023-03-15 01:08:41] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 901 ms. Remains : 179/179 places, 394/394 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 179 transition count 334
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 169 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 164 transition count 324
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 145 place count 164 transition count 264
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 185 place count 164 transition count 224
Reduce places removed 40 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 60 rules applied. Total rules applied 245 place count 124 transition count 204
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 265 place count 104 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 104 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 273 place count 100 transition count 200
Applied a total of 273 rules in 46 ms. Remains 100 /179 variables (removed 79) and now considering 200/394 (removed 194) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 100 cols
[2023-03-15 01:08:41] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-15 01:08:41] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-15 01:08:41] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 01:08:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-15 01:08:42] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 01:08:42] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-15 01:08:42] [INFO ] After 947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 295 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-15 01:08:43] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-15 01:08:43] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-15 01:08:43] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-15 01:08:43] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:43] [INFO ] Invariant cache hit.
[2023-03-15 01:08:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:44] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-15 01:08:44] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:44] [INFO ] Invariant cache hit.
[2023-03-15 01:08:44] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 806 ms. Remains : 179/179 places, 394/394 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 01:08:45] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:45] [INFO ] Invariant cache hit.
[2023-03-15 01:08:45] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 01:08:45] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 01:08:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-15 01:08:46] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 01:08:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:47] [INFO ] After 535ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 0 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2023-03-15 01:08:47] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2023-03-15 01:08:48] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2023-03-15 01:08:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1049 ms
[2023-03-15 01:08:48] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-15 01:08:48] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-15 01:08:48] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-15 01:08:48] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 0 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2023-03-15 01:08:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1512 ms
[2023-03-15 01:08:50] [INFO ] After 3540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 410 ms.
[2023-03-15 01:08:50] [INFO ] After 4753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Finished probabilistic random walk after 773782 steps, run visited all 2 properties in 2439 ms. (steps per millisecond=317 )
Probabilistic random walk after 773782 steps, saw 129645 distinct states, run finished after 2439 ms. (steps per millisecond=317 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17445 reset in 385 ms.
Product exploration explored 100000 steps with 17578 reset in 400 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-15 01:08:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 01:08:55] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:55] [INFO ] Invariant cache hit.
[2023-03-15 01:08:55] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 179/179 places, 394/394 transitions.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-15 01:08:55] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:55] [INFO ] Invariant cache hit.
[2023-03-15 01:08:55] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-15 01:08:55] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:55] [INFO ] Invariant cache hit.
[2023-03-15 01:08:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 01:08:56] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-15 01:08:56] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-15 01:08:56] [INFO ] Invariant cache hit.
[2023-03-15 01:08:56] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 179/179 places, 394/394 transitions.
Treatment of property Peterson-COL-4-LTLFireability-14 finished in 37330 ms.
[2023-03-15 01:08:56] [INFO ] Flatten gal took : 47 ms
[2023-03-15 01:08:56] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-15 01:08:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 4 ms.
Total runtime 266904 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-COL-4
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA Peterson-COL-4-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-4-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678842879482

--------------------
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 LTLFireability -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 15 (type EXCL) for 9 Peterson-COL-4-LTLFireability-08
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: FINISHED task # 15 (type EXCL) for Peterson-COL-4-LTLFireability-08
lola: result : true
lola: markings : 15010
lola: fired transitions : 35873
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 Peterson-COL-4-LTLFireability-14
lola: time limit : 898 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/898 2/32 Peterson-COL-4-LTLFireability-14 238951 m, 47790 m/sec, 661859 t fired, .

Time elapsed: 12 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 10/898 4/32 Peterson-COL-4-LTLFireability-14 497711 m, 51752 m/sec, 1382628 t fired, .

Time elapsed: 17 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 15/898 6/32 Peterson-COL-4-LTLFireability-14 751769 m, 50811 m/sec, 2104281 t fired, .

Time elapsed: 22 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 20/898 8/32 Peterson-COL-4-LTLFireability-14 1006085 m, 50863 m/sec, 2806773 t fired, .

Time elapsed: 27 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 25/898 10/32 Peterson-COL-4-LTLFireability-14 1264912 m, 51765 m/sec, 3514378 t fired, .

Time elapsed: 32 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 30/898 13/32 Peterson-COL-4-LTLFireability-14 1525467 m, 52111 m/sec, 4218809 t fired, .

Time elapsed: 37 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 35/898 15/32 Peterson-COL-4-LTLFireability-14 1780459 m, 50998 m/sec, 4905100 t fired, .

Time elapsed: 42 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 40/898 17/32 Peterson-COL-4-LTLFireability-14 2037116 m, 51331 m/sec, 5598374 t fired, .

Time elapsed: 47 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 45/898 19/32 Peterson-COL-4-LTLFireability-14 2291574 m, 50891 m/sec, 6281120 t fired, .

Time elapsed: 52 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 50/898 21/32 Peterson-COL-4-LTLFireability-14 2543819 m, 50449 m/sec, 6967112 t fired, .

Time elapsed: 57 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 55/898 23/32 Peterson-COL-4-LTLFireability-14 2798653 m, 50966 m/sec, 7654833 t fired, .

Time elapsed: 62 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 60/898 25/32 Peterson-COL-4-LTLFireability-14 3051665 m, 50602 m/sec, 8329076 t fired, .

Time elapsed: 67 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 65/898 27/32 Peterson-COL-4-LTLFireability-14 3300105 m, 49688 m/sec, 8999425 t fired, .

Time elapsed: 72 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 70/898 29/32 Peterson-COL-4-LTLFireability-14 3543100 m, 48599 m/sec, 9647482 t fired, .

Time elapsed: 77 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 75/898 31/32 Peterson-COL-4-LTLFireability-14 3795495 m, 50479 m/sec, 10323507 t fired, .

Time elapsed: 82 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 13 (type EXCL) for Peterson-COL-4-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 87 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 7 (type EXCL) for 6 Peterson-COL-4-LTLFireability-07
lola: time limit : 1171 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1171 2/32 Peterson-COL-4-LTLFireability-07 165869 m, 33173 m/sec, 369359 t fired, .

Time elapsed: 92 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1171 3/32 Peterson-COL-4-LTLFireability-07 328139 m, 32454 m/sec, 794912 t fired, .

Time elapsed: 97 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1171 4/32 Peterson-COL-4-LTLFireability-07 492821 m, 32936 m/sec, 1196126 t fired, .

Time elapsed: 102 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1171 5/32 Peterson-COL-4-LTLFireability-07 653473 m, 32130 m/sec, 1635942 t fired, .

Time elapsed: 107 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1171 6/32 Peterson-COL-4-LTLFireability-07 810088 m, 31323 m/sec, 2102830 t fired, .

Time elapsed: 112 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1171 7/32 Peterson-COL-4-LTLFireability-07 964941 m, 30970 m/sec, 2564745 t fired, .

Time elapsed: 117 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1171 8/32 Peterson-COL-4-LTLFireability-07 1121440 m, 31299 m/sec, 3017742 t fired, .

Time elapsed: 122 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1171 9/32 Peterson-COL-4-LTLFireability-07 1275911 m, 30894 m/sec, 3464539 t fired, .

Time elapsed: 127 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1171 10/32 Peterson-COL-4-LTLFireability-07 1432290 m, 31275 m/sec, 3916229 t fired, .

Time elapsed: 132 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1171 11/32 Peterson-COL-4-LTLFireability-07 1590693 m, 31680 m/sec, 4339252 t fired, .

Time elapsed: 137 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1171 12/32 Peterson-COL-4-LTLFireability-07 1745434 m, 30948 m/sec, 4791681 t fired, .

Time elapsed: 142 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/1171 13/32 Peterson-COL-4-LTLFireability-07 1899287 m, 30770 m/sec, 5244674 t fired, .

Time elapsed: 147 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 65/1171 14/32 Peterson-COL-4-LTLFireability-07 2064348 m, 33012 m/sec, 5649968 t fired, .

Time elapsed: 152 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 70/1171 15/32 Peterson-COL-4-LTLFireability-07 2224190 m, 31968 m/sec, 6093062 t fired, .

Time elapsed: 157 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 75/1171 16/32 Peterson-COL-4-LTLFireability-07 2377864 m, 30734 m/sec, 6547897 t fired, .

Time elapsed: 162 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 80/1171 17/32 Peterson-COL-4-LTLFireability-07 2520080 m, 28443 m/sec, 6989654 t fired, .

Time elapsed: 167 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 85/1171 18/32 Peterson-COL-4-LTLFireability-07 2667229 m, 29429 m/sec, 7533525 t fired, .

Time elapsed: 172 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 90/1171 19/32 Peterson-COL-4-LTLFireability-07 2799198 m, 26393 m/sec, 8098924 t fired, .

Time elapsed: 177 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 95/1171 20/32 Peterson-COL-4-LTLFireability-07 2923974 m, 24955 m/sec, 8675116 t fired, .

Time elapsed: 182 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 100/1171 21/32 Peterson-COL-4-LTLFireability-07 3050641 m, 25333 m/sec, 9246204 t fired, .

Time elapsed: 187 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 105/1171 22/32 Peterson-COL-4-LTLFireability-07 3178185 m, 25508 m/sec, 9813274 t fired, .

Time elapsed: 192 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 110/1171 22/32 Peterson-COL-4-LTLFireability-07 3310891 m, 26541 m/sec, 10360750 t fired, .

Time elapsed: 197 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 115/1171 23/32 Peterson-COL-4-LTLFireability-07 3446919 m, 27205 m/sec, 10880170 t fired, .

Time elapsed: 202 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 120/1171 24/32 Peterson-COL-4-LTLFireability-07 3593641 m, 29344 m/sec, 11322625 t fired, .

Time elapsed: 207 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 125/1171 25/32 Peterson-COL-4-LTLFireability-07 3740455 m, 29362 m/sec, 11759543 t fired, .

Time elapsed: 212 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 130/1171 26/32 Peterson-COL-4-LTLFireability-07 3885835 m, 29076 m/sec, 12188885 t fired, .

Time elapsed: 217 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 135/1171 27/32 Peterson-COL-4-LTLFireability-07 4015110 m, 25855 m/sec, 12730656 t fired, .

Time elapsed: 222 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 140/1171 28/32 Peterson-COL-4-LTLFireability-07 4139153 m, 24808 m/sec, 13310301 t fired, .

Time elapsed: 227 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 145/1171 29/32 Peterson-COL-4-LTLFireability-07 4286126 m, 29394 m/sec, 13740483 t fired, .

Time elapsed: 232 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 150/1171 30/32 Peterson-COL-4-LTLFireability-07 4429358 m, 28646 m/sec, 14188563 t fired, .

Time elapsed: 237 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 155/1171 31/32 Peterson-COL-4-LTLFireability-07 4556758 m, 25480 m/sec, 14744207 t fired, .

Time elapsed: 242 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 160/1171 32/32 Peterson-COL-4-LTLFireability-07 4701364 m, 28921 m/sec, 15189529 t fired, .

Time elapsed: 247 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for Peterson-COL-4-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 252 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 Peterson-COL-4-LTLFireability-02
lola: time limit : 1674 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1674 3/32 Peterson-COL-4-LTLFireability-02 265599 m, 53119 m/sec, 1109716 t fired, .

Time elapsed: 257 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1674 5/32 Peterson-COL-4-LTLFireability-02 515047 m, 49889 m/sec, 2212163 t fired, .

Time elapsed: 262 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1674 7/32 Peterson-COL-4-LTLFireability-02 748198 m, 46630 m/sec, 3322586 t fired, .

Time elapsed: 267 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1674 9/32 Peterson-COL-4-LTLFireability-02 999947 m, 50349 m/sec, 4373074 t fired, .

Time elapsed: 272 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1674 11/32 Peterson-COL-4-LTLFireability-02 1240814 m, 48173 m/sec, 5438421 t fired, .

Time elapsed: 277 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1674 13/32 Peterson-COL-4-LTLFireability-02 1478497 m, 47536 m/sec, 6493704 t fired, .

Time elapsed: 282 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1674 14/32 Peterson-COL-4-LTLFireability-02 1712031 m, 46706 m/sec, 7523776 t fired, .

Time elapsed: 287 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1674 16/32 Peterson-COL-4-LTLFireability-02 1942336 m, 46061 m/sec, 8555325 t fired, .

Time elapsed: 292 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1674 18/32 Peterson-COL-4-LTLFireability-02 2161764 m, 43885 m/sec, 9592977 t fired, .

Time elapsed: 297 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1674 20/32 Peterson-COL-4-LTLFireability-02 2404148 m, 48476 m/sec, 10594271 t fired, .

Time elapsed: 302 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1674 22/32 Peterson-COL-4-LTLFireability-02 2631798 m, 45530 m/sec, 11607735 t fired, .

Time elapsed: 307 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1674 24/32 Peterson-COL-4-LTLFireability-02 2860768 m, 45794 m/sec, 12610551 t fired, .

Time elapsed: 312 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1674 25/32 Peterson-COL-4-LTLFireability-02 3084703 m, 44787 m/sec, 13608518 t fired, .

Time elapsed: 317 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1674 27/32 Peterson-COL-4-LTLFireability-02 3308444 m, 44748 m/sec, 14597906 t fired, .

Time elapsed: 322 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1674 29/32 Peterson-COL-4-LTLFireability-02 3531140 m, 44539 m/sec, 15579254 t fired, .

Time elapsed: 327 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1674 31/32 Peterson-COL-4-LTLFireability-02 3752543 m, 44280 m/sec, 16561769 t fired, .

Time elapsed: 332 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1674 32/32 Peterson-COL-4-LTLFireability-02 3975454 m, 44582 m/sec, 17546806 t fired, .

Time elapsed: 337 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for Peterson-COL-4-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-08: F false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-4-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Peterson-COL-4-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
Peterson-COL-4-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 342 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-COL-4-LTLFireability-00
lola: time limit : 3258 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Peterson-COL-4-LTLFireability-00
lola: result : false
lola: markings : 530
lola: fired transitions : 632
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-4-LTLFireability-00: LTL false LTL model checker
Peterson-COL-4-LTLFireability-02: LTL unknown AGGR
Peterson-COL-4-LTLFireability-07: LTL unknown AGGR
Peterson-COL-4-LTLFireability-08: F false state space / EG
Peterson-COL-4-LTLFireability-14: LTL unknown AGGR


Time elapsed: 342 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-4"
export BK_EXAMINATION="LTLFireability"
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 Peterson-COL-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538400572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;