Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948200668.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 PolyORBNT-COL-S05J80, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948200668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 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 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K 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 PolyORBNT-COL-S05J80-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J80-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678884374215

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=PolyORBNT-COL-S05J80
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 12:46:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 12:46:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:46:15] [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 12:46:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 12:46:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 691 ms
[2023-03-15 12:46:16] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 12:46:16] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 13 ms.
[2023-03-15 12:46:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10003 steps, including 798 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 12:46:17] [INFO ] Computed 13 place invariants in 10 ms
[2023-03-15 12:46:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-15 12:46:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-15 12:46:17] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 12:46:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:46:17] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 12:46:17] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
[2023-03-15 12:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-15 12:46:17] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:46:17] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:46:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-15 12:46:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 12:46:17] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:46:17] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:46:17] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2023-03-15 12:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-15 12:46:17] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-15 12:46:17] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
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 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 39 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 39 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 36 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 35 transition count 27
Applied a total of 25 rules in 17 ms. Remains 35 /48 variables (removed 13) and now considering 27/38 (removed 11) transitions.
// Phase 1: matrix 27 rows 35 cols
[2023-03-15 12:46:17] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-15 12:46:17] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 35/48 places, 27/38 transitions.
Incomplete random walk after 10004 steps, including 1169 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 308 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Probably explored full state space saw : 361 states, properties seen :0
Probabilistic random walk after 961 steps, saw 361 distinct states, run finished after 30 ms. (steps per millisecond=32 ) properties seen :0
Explored full state space saw : 361 states, properties seen :0
Exhaustive walk after 961 steps, saw 361 distinct states, run finished after 4 ms. (steps per millisecond=240 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2023-03-15 12:46:17] [INFO ] Flatten gal took : 19 ms
[2023-03-15 12:46:17] [INFO ] Flatten gal took : 8 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 12:46:17] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 50 ms.
[2023-03-15 12:46:17] [INFO ] Unfolded 9 HLPN properties in 0 ms.
[2023-03-15 12:46:17] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 12:46:17] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 12:46:17] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-15 12:46:17] [INFO ] Reduced 555 identical enabling conditions.
Deduced a syphon composed of 80 places in 11 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 602 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1188 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1188 transition count 1694
Applied a total of 2 rules in 121 ms. Remains 1188 /1189 variables (removed 1) and now considering 1694/1695 (removed 1) transitions.
[2023-03-15 12:46:18] [INFO ] Flow matrix only has 1690 transitions (discarded 4 similar events)
// Phase 1: matrix 1690 rows 1188 cols
[2023-03-15 12:46:18] [INFO ] Computed 182 place invariants in 164 ms
[2023-03-15 12:46:20] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-15 12:46:20] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-15 12:46:20] [INFO ] Computed 182 place invariants in 72 ms
[2023-03-15 12:46:20] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-15 12:46:20] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:46:20] [INFO ] Invariant cache hit.
[2023-03-15 12:46:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:46:28] [INFO ] Implicit Places using invariants and state equation in 7257 ms returned []
Implicit Place search using SMT with State Equation took 8103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1188/1189 places, 1599/1695 transitions.
Applied a total of 0 rules in 22 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10163 ms. Remains : 1188/1189 places, 1599/1695 transitions.
Support contains 602 out of 1188 places after structural reductions.
[2023-03-15 12:46:28] [INFO ] Flatten gal took : 182 ms
[2023-03-15 12:46:28] [INFO ] Flatten gal took : 145 ms
[2023-03-15 12:46:28] [INFO ] Input system was already deterministic with 1599 transitions.
Incomplete random walk after 10000 steps, including 697 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-15 12:46:29] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:46:29] [INFO ] Invariant cache hit.
[2023-03-15 12:46:29] [INFO ] [Real]Absence check using 175 positive place invariants in 54 ms returned sat
[2023-03-15 12:46:29] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 12:46:29] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:46:29] [INFO ] [Nat]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-15 12:46:29] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2023-03-15 12:46:30] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:46:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:46:31] [INFO ] After 262ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:46:31] [INFO ] Deduced a trap composed of 486 places in 432 ms of which 1 ms to minimize.
[2023-03-15 12:46:32] [INFO ] Deduced a trap composed of 501 places in 410 ms of which 1 ms to minimize.
[2023-03-15 12:46:32] [INFO ] Deduced a trap composed of 501 places in 415 ms of which 1 ms to minimize.
[2023-03-15 12:46:33] [INFO ] Deduced a trap composed of 492 places in 399 ms of which 1 ms to minimize.
[2023-03-15 12:46:34] [INFO ] Deduced a trap composed of 498 places in 420 ms of which 2 ms to minimize.
[2023-03-15 12:46:34] [INFO ] Deduced a trap composed of 495 places in 421 ms of which 1 ms to minimize.
[2023-03-15 12:46:35] [INFO ] Deduced a trap composed of 489 places in 404 ms of which 1 ms to minimize.
[2023-03-15 12:46:35] [INFO ] Deduced a trap composed of 492 places in 420 ms of which 1 ms to minimize.
[2023-03-15 12:46:36] [INFO ] Deduced a trap composed of 471 places in 430 ms of which 2 ms to minimize.
[2023-03-15 12:46:36] [INFO ] Deduced a trap composed of 495 places in 400 ms of which 1 ms to minimize.
[2023-03-15 12:46:37] [INFO ] Deduced a trap composed of 471 places in 398 ms of which 1 ms to minimize.
[2023-03-15 12:46:38] [INFO ] Deduced a trap composed of 489 places in 445 ms of which 1 ms to minimize.
[2023-03-15 12:46:38] [INFO ] Deduced a trap composed of 492 places in 395 ms of which 1 ms to minimize.
[2023-03-15 12:46:40] [INFO ] Deduced a trap composed of 498 places in 421 ms of which 1 ms to minimize.
[2023-03-15 12:46:40] [INFO ] Deduced a trap composed of 486 places in 457 ms of which 1 ms to minimize.
[2023-03-15 12:46:41] [INFO ] Deduced a trap composed of 513 places in 440 ms of which 1 ms to minimize.
[2023-03-15 12:46:41] [INFO ] Deduced a trap composed of 477 places in 430 ms of which 1 ms to minimize.
[2023-03-15 12:46:42] [INFO ] Deduced a trap composed of 504 places in 453 ms of which 1 ms to minimize.
[2023-03-15 12:46:42] [INFO ] Deduced a trap composed of 501 places in 415 ms of which 1 ms to minimize.
[2023-03-15 12:46:43] [INFO ] Deduced a trap composed of 498 places in 432 ms of which 1 ms to minimize.
[2023-03-15 12:46:43] [INFO ] Deduced a trap composed of 483 places in 418 ms of which 1 ms to minimize.
[2023-03-15 12:46:44] [INFO ] Deduced a trap composed of 492 places in 436 ms of which 1 ms to minimize.
[2023-03-15 12:46:46] [INFO ] Deduced a trap composed of 522 places in 425 ms of which 1 ms to minimize.
[2023-03-15 12:46:46] [INFO ] Deduced a trap composed of 492 places in 416 ms of which 1 ms to minimize.
[2023-03-15 12:46:47] [INFO ] Deduced a trap composed of 495 places in 405 ms of which 1 ms to minimize.
[2023-03-15 12:46:47] [INFO ] Deduced a trap composed of 492 places in 410 ms of which 0 ms to minimize.
[2023-03-15 12:46:48] [INFO ] Deduced a trap composed of 504 places in 421 ms of which 1 ms to minimize.
[2023-03-15 12:46:48] [INFO ] Deduced a trap composed of 492 places in 424 ms of which 1 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 489 places in 428 ms of which 1 ms to minimize.
[2023-03-15 12:46:49] [INFO ] Deduced a trap composed of 486 places in 442 ms of which 1 ms to minimize.
[2023-03-15 12:46:50] [INFO ] Deduced a trap composed of 489 places in 426 ms of which 2 ms to minimize.
[2023-03-15 12:46:51] [INFO ] Deduced a trap composed of 489 places in 401 ms of which 1 ms to minimize.
[2023-03-15 12:46:52] [INFO ] Deduced a trap composed of 495 places in 446 ms of which 1 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 486 places in 439 ms of which 1 ms to minimize.
[2023-03-15 12:46:53] [INFO ] Deduced a trap composed of 504 places in 420 ms of which 1 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 480 places in 436 ms of which 1 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Deduced a trap composed of 513 places in 414 ms of which 2 ms to minimize.
[2023-03-15 12:46:54] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 23542 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
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 12:46:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 12:46:54] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 82 out of 1188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
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 9 rules applied. Total rules applied 9 place count 1183 transition count 1595
Reduce places removed 4 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 1 with 85 rules applied. Total rules applied 94 place count 1179 transition count 1514
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 175 place count 1098 transition count 1514
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 175 place count 1098 transition count 1510
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 1094 transition count 1510
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 1091 transition count 1507
Applied a total of 189 rules in 192 ms. Remains 1091 /1188 variables (removed 97) and now considering 1507/1599 (removed 92) transitions.
[2023-03-15 12:46:54] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
// Phase 1: matrix 1503 rows 1091 cols
[2023-03-15 12:46:55] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-15 12:46:56] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1529 ms. Remains : 1091/1188 places, 1507/1599 transitions.
Incomplete random walk after 10000 steps, including 490 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 233573 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233573 steps, saw 68918 distinct states, run finished after 3004 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 12:46:59] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-15 12:46:59] [INFO ] Invariant cache hit.
[2023-03-15 12:46:59] [INFO ] [Real]Absence check using 171 positive place invariants in 54 ms returned sat
[2023-03-15 12:46:59] [INFO ] [Real]Absence check using 171 positive and 6 generalized place invariants in 31 ms returned sat
[2023-03-15 12:46:59] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:46:59] [INFO ] [Nat]Absence check using 171 positive place invariants in 40 ms returned sat
[2023-03-15 12:46:59] [INFO ] [Nat]Absence check using 171 positive and 6 generalized place invariants in 23 ms returned sat
[2023-03-15 12:47:00] [INFO ] After 824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:47:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:47:01] [INFO ] After 1197ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:47:03] [INFO ] Deduced a trap composed of 384 places in 373 ms of which 1 ms to minimize.
[2023-03-15 12:47:03] [INFO ] Deduced a trap composed of 393 places in 380 ms of which 1 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Deduced a trap composed of 381 places in 387 ms of which 1 ms to minimize.
[2023-03-15 12:47:04] [INFO ] Deduced a trap composed of 402 places in 371 ms of which 1 ms to minimize.
[2023-03-15 12:47:05] [INFO ] Deduced a trap composed of 378 places in 382 ms of which 1 ms to minimize.
[2023-03-15 12:47:05] [INFO ] Deduced a trap composed of 402 places in 387 ms of which 1 ms to minimize.
[2023-03-15 12:47:06] [INFO ] Deduced a trap composed of 378 places in 381 ms of which 1 ms to minimize.
[2023-03-15 12:47:06] [INFO ] Deduced a trap composed of 396 places in 369 ms of which 1 ms to minimize.
[2023-03-15 12:47:07] [INFO ] Deduced a trap composed of 384 places in 380 ms of which 0 ms to minimize.
[2023-03-15 12:47:07] [INFO ] Deduced a trap composed of 381 places in 381 ms of which 1 ms to minimize.
[2023-03-15 12:47:08] [INFO ] Deduced a trap composed of 384 places in 375 ms of which 2 ms to minimize.
[2023-03-15 12:47:08] [INFO ] Deduced a trap composed of 372 places in 396 ms of which 1 ms to minimize.
[2023-03-15 12:47:09] [INFO ] Deduced a trap composed of 396 places in 389 ms of which 1 ms to minimize.
[2023-03-15 12:47:09] [INFO ] Deduced a trap composed of 375 places in 378 ms of which 1 ms to minimize.
[2023-03-15 12:47:10] [INFO ] Deduced a trap composed of 378 places in 364 ms of which 0 ms to minimize.
[2023-03-15 12:47:10] [INFO ] Deduced a trap composed of 384 places in 372 ms of which 0 ms to minimize.
[2023-03-15 12:47:11] [INFO ] Deduced a trap composed of 387 places in 376 ms of which 5 ms to minimize.
[2023-03-15 12:47:11] [INFO ] Deduced a trap composed of 402 places in 394 ms of which 1 ms to minimize.
[2023-03-15 12:47:12] [INFO ] Deduced a trap composed of 399 places in 394 ms of which 1 ms to minimize.
[2023-03-15 12:47:13] [INFO ] Deduced a trap composed of 396 places in 383 ms of which 1 ms to minimize.
[2023-03-15 12:47:16] [INFO ] Deduced a trap composed of 363 places in 381 ms of which 1 ms to minimize.
[2023-03-15 12:47:24] [INFO ] Trap strengthening (SAT) tested/added 21/21 trap constraints in 22020 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
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 12:47:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 12:47:24] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 82 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 50 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1507/1507 transitions.
Applied a total of 0 rules in 45 ms. Remains 1091 /1091 variables (removed 0) and now considering 1507/1507 (removed 0) transitions.
[2023-03-15 12:47:24] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-15 12:47:24] [INFO ] Invariant cache hit.
[2023-03-15 12:47:26] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2023-03-15 12:47:26] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-15 12:47:26] [INFO ] Invariant cache hit.
[2023-03-15 12:47:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:47:38] [INFO ] Implicit Places using invariants and state equation in 12093 ms returned []
Implicit Place search using SMT with State Equation took 13527 ms to find 0 implicit places.
[2023-03-15 12:47:38] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-15 12:47:38] [INFO ] Flow matrix only has 1503 transitions (discarded 4 similar events)
[2023-03-15 12:47:38] [INFO ] Invariant cache hit.
[2023-03-15 12:47:39] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14989 ms. Remains : 1091/1091 places, 1507/1507 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1091 transition count 1503
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1091 transition count 1502
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1090 transition count 1502
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1090 transition count 1501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1089 transition count 1501
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1089 transition count 1496
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1084 transition count 1496
Applied a total of 18 rules in 143 ms. Remains 1084 /1091 variables (removed 7) and now considering 1496/1507 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1496 rows 1084 cols
[2023-03-15 12:47:40] [INFO ] Computed 177 place invariants in 41 ms
[2023-03-15 12:47:40] [INFO ] [Real]Absence check using 171 positive place invariants in 92 ms returned sat
[2023-03-15 12:47:40] [INFO ] [Real]Absence check using 171 positive and 6 generalized place invariants in 22 ms returned sat
[2023-03-15 12:47:40] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:47:40] [INFO ] [Nat]Absence check using 171 positive place invariants in 41 ms returned sat
[2023-03-15 12:47:40] [INFO ] [Nat]Absence check using 171 positive and 6 generalized place invariants in 22 ms returned sat
[2023-03-15 12:47:47] [INFO ] After 6766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:47:47] [INFO ] Deduced a trap composed of 385 places in 401 ms of which 1 ms to minimize.
[2023-03-15 12:47:48] [INFO ] Deduced a trap composed of 385 places in 398 ms of which 1 ms to minimize.
[2023-03-15 12:47:48] [INFO ] Deduced a trap composed of 400 places in 411 ms of which 2 ms to minimize.
[2023-03-15 12:47:49] [INFO ] Deduced a trap composed of 376 places in 389 ms of which 1 ms to minimize.
[2023-03-15 12:47:49] [INFO ] Deduced a trap composed of 397 places in 382 ms of which 3 ms to minimize.
[2023-03-15 12:47:51] [INFO ] Deduced a trap composed of 385 places in 387 ms of which 1 ms to minimize.
[2023-03-15 12:48:00] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 13166 ms
[2023-03-15 12:48:00] [INFO ] After 20092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 12:48:00] [INFO ] After 20303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((!p1||X(p1)) U p2)||p0))))'
Support contains 82 out of 1188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 27 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-15 12:48:00] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-15 12:48:01] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-15 12:48:02] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
[2023-03-15 12:48:02] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:48:02] [INFO ] Invariant cache hit.
[2023-03-15 12:48:04] [INFO ] Implicit Places using invariants in 1496 ms returned []
[2023-03-15 12:48:04] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:48:04] [INFO ] Invariant cache hit.
[2023-03-15 12:48:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:48:12] [INFO ] Implicit Places using invariants and state equation in 8064 ms returned []
Implicit Place search using SMT with State Equation took 9562 ms to find 0 implicit places.
[2023-03-15 12:48:12] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:48:12] [INFO ] Invariant cache hit.
[2023-03-15 12:48:13] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12569 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s64 1) (GEQ s3 1) (GEQ s66 1) (GEQ s5 1) (GEQ s68 1) (GEQ s7 1) (GEQ s70 1) (GEQ s9 1) (GEQ s72 1) (GEQ s11 1) (GEQ s74 1) (GEQ s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 5 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-01 finished in 12814 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 8 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1183 transition count 1515
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1099 transition count 1515
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 168 place count 1099 transition count 1432
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 334 place count 1016 transition count 1432
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 1014 transition count 1430
Applied a total of 338 rules in 147 ms. Remains 1014 /1188 variables (removed 174) and now considering 1430/1599 (removed 169) transitions.
[2023-03-15 12:48:13] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1014 cols
[2023-03-15 12:48:13] [INFO ] Computed 177 place invariants in 45 ms
[2023-03-15 12:48:15] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
[2023-03-15 12:48:15] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:15] [INFO ] Invariant cache hit.
[2023-03-15 12:48:16] [INFO ] Implicit Places using invariants in 1170 ms returned []
[2023-03-15 12:48:16] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:16] [INFO ] Invariant cache hit.
[2023-03-15 12:48:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:48:22] [INFO ] Implicit Places using invariants and state equation in 6725 ms returned []
Implicit Place search using SMT with State Equation took 7912 ms to find 0 implicit places.
[2023-03-15 12:48:23] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-15 12:48:23] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:23] [INFO ] Invariant cache hit.
[2023-03-15 12:48:24] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1014/1188 places, 1430/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10669 ms. Remains : 1014/1188 places, 1430/1599 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1011 1) (OR (LT s499 1) (LT s502 1) (LT s505 9)) (OR (LT s499 1) (LT s503 1) (LT s505 9)) (OR (LT s499 1) (LT s504 1) (LT s505 9)) (OR (LT s4...], 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 5592 reset in 649 ms.
Product exploration explored 100000 steps with 5425 reset in 653 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)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-15 12:48:26] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:26] [INFO ] Invariant cache hit.
[2023-03-15 12:48:27] [INFO ] [Real]Absence check using 170 positive place invariants in 137 ms returned sat
[2023-03-15 12:48:27] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 57 ms returned sat
[2023-03-15 12:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:48:30] [INFO ] [Real]Absence check using state equation in 2925 ms returned sat
[2023-03-15 12:48:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:48:31] [INFO ] [Nat]Absence check using 170 positive place invariants in 181 ms returned sat
[2023-03-15 12:48:31] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 134 ms returned sat
[2023-03-15 12:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:48:35] [INFO ] [Nat]Absence check using state equation in 4051 ms returned sat
[2023-03-15 12:48:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:48:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 88 ms returned sat
[2023-03-15 12:48:35] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 115 ms.
[2023-03-15 12:48:36] [INFO ] Added : 25 causal constraints over 5 iterations in 686 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 43 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 12:48:36] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:36] [INFO ] Invariant cache hit.
[2023-03-15 12:48:37] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
[2023-03-15 12:48:37] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:37] [INFO ] Invariant cache hit.
[2023-03-15 12:48:39] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2023-03-15 12:48:39] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:39] [INFO ] Invariant cache hit.
[2023-03-15 12:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:48:49] [INFO ] Implicit Places using invariants and state equation in 10360 ms returned []
Implicit Place search using SMT with State Equation took 11514 ms to find 0 implicit places.
[2023-03-15 12:48:49] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 12:48:49] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:49] [INFO ] Invariant cache hit.
[2023-03-15 12:48:50] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14304 ms. Remains : 1014/1014 places, 1430/1430 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)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-15 12:48:51] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:48:51] [INFO ] Invariant cache hit.
[2023-03-15 12:48:52] [INFO ] [Real]Absence check using 170 positive place invariants in 130 ms returned sat
[2023-03-15 12:48:52] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 56 ms returned sat
[2023-03-15 12:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:48:55] [INFO ] [Real]Absence check using state equation in 2920 ms returned sat
[2023-03-15 12:48:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:48:56] [INFO ] [Nat]Absence check using 170 positive place invariants in 175 ms returned sat
[2023-03-15 12:48:56] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 135 ms returned sat
[2023-03-15 12:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:49:00] [INFO ] [Nat]Absence check using state equation in 4255 ms returned sat
[2023-03-15 12:49:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:49:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2023-03-15 12:49:01] [INFO ] Computed and/alt/rep : 684/2379/684 causal constraints (skipped 736 transitions) in 113 ms.
[2023-03-15 12:49:01] [INFO ] Added : 25 causal constraints over 5 iterations in 738 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5564 reset in 581 ms.
Product exploration explored 100000 steps with 5515 reset in 634 ms.
Support contains 8 out of 1014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1014/1014 places, 1430/1430 transitions.
Applied a total of 0 rules in 41 ms. Remains 1014 /1014 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 12:49:03] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:49:03] [INFO ] Invariant cache hit.
[2023-03-15 12:49:04] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
[2023-03-15 12:49:04] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:49:04] [INFO ] Invariant cache hit.
[2023-03-15 12:49:05] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2023-03-15 12:49:05] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:49:05] [INFO ] Invariant cache hit.
[2023-03-15 12:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:49:12] [INFO ] Implicit Places using invariants and state equation in 7180 ms returned []
Implicit Place search using SMT with State Equation took 8376 ms to find 0 implicit places.
[2023-03-15 12:49:12] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 12:49:12] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:49:12] [INFO ] Invariant cache hit.
[2023-03-15 12:49:14] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11171 ms. Remains : 1014/1014 places, 1430/1430 transitions.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-03 finished in 60657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(G(p1))&&F(p2)))))))'
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 18 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-15 12:49:14] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-15 12:49:14] [INFO ] Computed 182 place invariants in 34 ms
[2023-03-15 12:49:15] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
[2023-03-15 12:49:15] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:15] [INFO ] Invariant cache hit.
[2023-03-15 12:49:17] [INFO ] Implicit Places using invariants in 1398 ms returned []
[2023-03-15 12:49:17] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:17] [INFO ] Invariant cache hit.
[2023-03-15 12:49:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:49:27] [INFO ] Implicit Places using invariants and state equation in 10569 ms returned []
Implicit Place search using SMT with State Equation took 11972 ms to find 0 implicit places.
[2023-03-15 12:49:27] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:27] [INFO ] Invariant cache hit.
[2023-03-15 12:49:29] [INFO ] Dead Transitions using invariants and state equation in 1542 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14930 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1187 1), p1:(AND (OR (LT s509 1) (LT s1008 1) (LT s1013 1) (LT s1016 1)) (OR (LT s509 1) (LT s1006 1) (LT s1011 1) (LT s1016 1)) (OR (LT s509 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10321 reset in 638 ms.
Product exploration explored 100000 steps with 10308 reset in 622 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 p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 259 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 3182 steps, including 217 resets, run visited all 4 properties in 25 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 349 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-15 12:49:31] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:31] [INFO ] Invariant cache hit.
[2023-03-15 12:49:33] [INFO ] [Real]Absence check using 175 positive place invariants in 185 ms returned sat
[2023-03-15 12:49:33] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 61 ms returned sat
[2023-03-15 12:49:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:49:37] [INFO ] [Real]Absence check using state equation in 4418 ms returned sat
[2023-03-15 12:49:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:49:39] [INFO ] [Nat]Absence check using 175 positive place invariants in 246 ms returned sat
[2023-03-15 12:49:39] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 293 ms returned sat
[2023-03-15 12:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:49:44] [INFO ] [Nat]Absence check using state equation in 4398 ms returned sat
[2023-03-15 12:49:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:49:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2023-03-15 12:49:44] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 152 ms.
[2023-03-15 12:49:45] [INFO ] Added : 33 causal constraints over 7 iterations in 985 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 22 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-15 12:49:45] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:45] [INFO ] Invariant cache hit.
[2023-03-15 12:49:46] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
[2023-03-15 12:49:46] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:46] [INFO ] Invariant cache hit.
[2023-03-15 12:49:48] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2023-03-15 12:49:48] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:48] [INFO ] Invariant cache hit.
[2023-03-15 12:49:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:49:56] [INFO ] Implicit Places using invariants and state equation in 7901 ms returned []
Implicit Place search using SMT with State Equation took 9307 ms to find 0 implicit places.
[2023-03-15 12:49:56] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:56] [INFO ] Invariant cache hit.
[2023-03-15 12:49:57] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12414 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 300 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1957 steps, including 134 resets, run visited all 4 properties in 15 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-15 12:49:59] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:49:59] [INFO ] Invariant cache hit.
[2023-03-15 12:50:00] [INFO ] [Real]Absence check using 175 positive place invariants in 198 ms returned sat
[2023-03-15 12:50:00] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 62 ms returned sat
[2023-03-15 12:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:50:05] [INFO ] [Real]Absence check using state equation in 4407 ms returned sat
[2023-03-15 12:50:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:50:06] [INFO ] [Nat]Absence check using 175 positive place invariants in 253 ms returned sat
[2023-03-15 12:50:07] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 291 ms returned sat
[2023-03-15 12:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:50:11] [INFO ] [Nat]Absence check using state equation in 4525 ms returned sat
[2023-03-15 12:50:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:50:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2023-03-15 12:50:11] [INFO ] Computed and/alt/rep : 854/1914/854 causal constraints (skipped 735 transitions) in 91 ms.
[2023-03-15 12:50:12] [INFO ] Added : 33 causal constraints over 7 iterations in 904 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10336 reset in 536 ms.
Product exploration explored 100000 steps with 10339 reset in 578 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1188 transition count 1599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 82 place count 1188 transition count 1600
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 1188 transition count 1600
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 169 place count 1188 transition count 1600
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 252 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 335 place count 1105 transition count 1517
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 335 rules in 247 ms. Remains 1105 /1188 variables (removed 83) and now considering 1517/1599 (removed 82) transitions.
[2023-03-15 12:50:14] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
// Phase 1: matrix 1513 rows 1105 cols
[2023-03-15 12:50:14] [INFO ] Computed 182 place invariants in 35 ms
[2023-03-15 12:50:16] [INFO ] Dead Transitions using invariants and state equation in 1834 ms found 0 transitions.
[2023-03-15 12:50:16] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 12:50:16] [INFO ] Flow matrix only has 1513 transitions (discarded 4 similar events)
[2023-03-15 12:50:16] [INFO ] Invariant cache hit.
[2023-03-15 12:50:17] [INFO ] Dead Transitions using invariants and state equation in 1685 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1105/1188 places, 1517/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3803 ms. Remains : 1105/1188 places, 1517/1599 transitions.
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Applied a total of 0 rules in 29 ms. Remains 1188 /1188 variables (removed 0) and now considering 1599/1599 (removed 0) transitions.
[2023-03-15 12:50:17] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1188 cols
[2023-03-15 12:50:17] [INFO ] Computed 182 place invariants in 34 ms
[2023-03-15 12:50:19] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
[2023-03-15 12:50:19] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:50:19] [INFO ] Invariant cache hit.
[2023-03-15 12:50:20] [INFO ] Implicit Places using invariants in 1402 ms returned []
[2023-03-15 12:50:20] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:50:20] [INFO ] Invariant cache hit.
[2023-03-15 12:50:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:50:29] [INFO ] Implicit Places using invariants and state equation in 8491 ms returned []
Implicit Place search using SMT with State Equation took 9896 ms to find 0 implicit places.
[2023-03-15 12:50:29] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:50:29] [INFO ] Invariant cache hit.
[2023-03-15 12:50:30] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12915 ms. Remains : 1188/1188 places, 1599/1599 transitions.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-04 finished in 76547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 170 place count 1098 transition count 1430
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 338 place count 1014 transition count 1430
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 342 place count 1012 transition count 1428
Applied a total of 342 rules in 81 ms. Remains 1012 /1188 variables (removed 176) and now considering 1428/1599 (removed 171) transitions.
[2023-03-15 12:50:31] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2023-03-15 12:50:31] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 12:50:32] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
[2023-03-15 12:50:32] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-15 12:50:32] [INFO ] Invariant cache hit.
[2023-03-15 12:50:33] [INFO ] Implicit Places using invariants in 1261 ms returned []
[2023-03-15 12:50:33] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-15 12:50:33] [INFO ] Invariant cache hit.
[2023-03-15 12:50:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:50:40] [INFO ] Implicit Places using invariants and state equation in 7274 ms returned []
Implicit Place search using SMT with State Equation took 8536 ms to find 0 implicit places.
[2023-03-15 12:50:40] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 12:50:40] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
[2023-03-15 12:50:40] [INFO ] Invariant cache hit.
[2023-03-15 12:50:41] [INFO ] Dead Transitions using invariants and state equation in 1164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1012/1188 places, 1428/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10841 ms. Remains : 1012/1188 places, 1428/1599 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1009 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-05 finished in 10900 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))||(F(p1)&&G(F(p2)))))'
Support contains 171 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1183 transition count 1596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1180 transition count 1596
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1180 transition count 1593
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1177 transition count 1593
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 1174 transition count 1590
Applied a total of 18 rules in 76 ms. Remains 1174 /1188 variables (removed 14) and now considering 1590/1599 (removed 9) transitions.
[2023-03-15 12:50:41] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
// Phase 1: matrix 1586 rows 1174 cols
[2023-03-15 12:50:41] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-15 12:50:43] [INFO ] Dead Transitions using invariants and state equation in 1459 ms found 0 transitions.
[2023-03-15 12:50:43] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-15 12:50:43] [INFO ] Invariant cache hit.
[2023-03-15 12:50:44] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2023-03-15 12:50:44] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-15 12:50:44] [INFO ] Invariant cache hit.
[2023-03-15 12:50:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:50:59] [INFO ] Implicit Places using invariants and state equation in 14194 ms returned []
Implicit Place search using SMT with State Equation took 15624 ms to find 0 implicit places.
[2023-03-15 12:50:59] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 12:50:59] [INFO ] Flow matrix only has 1586 transitions (discarded 4 similar events)
[2023-03-15 12:50:59] [INFO ] Invariant cache hit.
[2023-03-15 12:51:00] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1174/1188 places, 1590/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18606 ms. Remains : 1174/1188 places, 1590/1599 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s499 1) (LT s502 1) (LT s505 9)) (OR (LT s499 1) (LT s503 1) (LT s505 9)) (OR (LT s499 1) (LT s504 1) (LT s505 9)) (OR (LT s499 1) (LT s50...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-07 finished in 18786 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((G(p0)||F(p1)))))'
Support contains 8 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 29 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-15 12:51:00] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-15 12:51:00] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-15 12:51:02] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
[2023-03-15 12:51:02] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:51:02] [INFO ] Invariant cache hit.
[2023-03-15 12:51:03] [INFO ] Implicit Places using invariants in 1496 ms returned []
[2023-03-15 12:51:03] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:51:03] [INFO ] Invariant cache hit.
[2023-03-15 12:51:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:51:13] [INFO ] Implicit Places using invariants and state equation in 9849 ms returned []
Implicit Place search using SMT with State Equation took 11363 ms to find 0 implicit places.
[2023-03-15 12:51:13] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:51:13] [INFO ] Invariant cache hit.
[2023-03-15 12:51:15] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14379 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s501 1), p1:(OR (AND (GEQ s503 1) (GEQ s505 1) (GEQ s506 1) (GEQ s509 8)) (AND (GEQ s503 1) (GEQ s507 2) (GEQ s509 8)) (AND (GEQ s503 1) (GEQ s504...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-08 finished in 14500 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)||p0)))'
Support contains 169 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1098 transition count 1429
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 340 place count 1013 transition count 1429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 346 place count 1010 transition count 1426
Applied a total of 346 rules in 87 ms. Remains 1010 /1188 variables (removed 178) and now considering 1426/1599 (removed 173) transitions.
[2023-03-15 12:51:15] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 12:51:15] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-15 12:51:16] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
[2023-03-15 12:51:16] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:16] [INFO ] Invariant cache hit.
[2023-03-15 12:51:16] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-15 12:51:16] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:16] [INFO ] Invariant cache hit.
[2023-03-15 12:51:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:51:20] [INFO ] Implicit Places using invariants and state equation in 3672 ms returned []
Implicit Place search using SMT with State Equation took 4289 ms to find 0 implicit places.
[2023-03-15 12:51:20] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 12:51:20] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:20] [INFO ] Invariant cache hit.
[2023-03-15 12:51:21] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1188 places, 1426/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6418 ms. Remains : 1010/1188 places, 1426/1599 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s912 1) (LT s974 1)) (OR (LT s913 1) (LT s923 1)) (OR (LT s910 1) (LT s946 1)) (OR (LT s913 1) (LT s988 1)) (OR (LT s911 1) (LT s960 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10252 reset in 3790 ms.
Product exploration explored 100000 steps with 10268 reset in 3801 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Support contains 169 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 32 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 12:51:29] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:29] [INFO ] Invariant cache hit.
[2023-03-15 12:51:30] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
[2023-03-15 12:51:30] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:30] [INFO ] Invariant cache hit.
[2023-03-15 12:51:31] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-15 12:51:31] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:31] [INFO ] Invariant cache hit.
[2023-03-15 12:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:51:35] [INFO ] Implicit Places using invariants and state equation in 4000 ms returned []
Implicit Place search using SMT with State Equation took 4640 ms to find 0 implicit places.
[2023-03-15 12:51:35] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-15 12:51:35] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:35] [INFO ] Invariant cache hit.
[2023-03-15 12:51:36] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6696 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10297 reset in 4085 ms.
Product exploration explored 100000 steps with 10268 reset in 4125 ms.
Support contains 169 out of 1010 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 30 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 12:51:45] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:45] [INFO ] Invariant cache hit.
[2023-03-15 12:51:46] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
[2023-03-15 12:51:46] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:46] [INFO ] Invariant cache hit.
[2023-03-15 12:51:46] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-15 12:51:46] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:46] [INFO ] Invariant cache hit.
[2023-03-15 12:51:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:51:50] [INFO ] Implicit Places using invariants and state equation in 3238 ms returned []
Implicit Place search using SMT with State Equation took 3874 ms to find 0 implicit places.
[2023-03-15 12:51:50] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 12:51:50] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:51:50] [INFO ] Invariant cache hit.
[2023-03-15 12:51:51] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5958 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-10 finished in 36122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 9 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1183 transition count 1599
Applied a total of 5 rules in 32 ms. Remains 1183 /1188 variables (removed 5) and now considering 1599/1599 (removed 0) transitions.
[2023-03-15 12:51:51] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
// Phase 1: matrix 1595 rows 1183 cols
[2023-03-15 12:51:51] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-15 12:51:52] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
[2023-03-15 12:51:52] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:51:52] [INFO ] Invariant cache hit.
[2023-03-15 12:51:54] [INFO ] Implicit Places using invariants in 1508 ms returned []
[2023-03-15 12:51:54] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:51:54] [INFO ] Invariant cache hit.
[2023-03-15 12:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:52:06] [INFO ] Implicit Places using invariants and state equation in 12393 ms returned []
Implicit Place search using SMT with State Equation took 13903 ms to find 0 implicit places.
[2023-03-15 12:52:06] [INFO ] Flow matrix only has 1595 transitions (discarded 4 similar events)
[2023-03-15 12:52:06] [INFO ] Invariant cache hit.
[2023-03-15 12:52:08] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1188 places, 1599/1599 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16929 ms. Remains : 1183/1188 places, 1599/1599 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(GEQ s502 1), p0:(OR (AND (GEQ s503 1) (GEQ s504 1) (GEQ s506 1) (GEQ s507 1) (GEQ s508 1) (GEQ s509 6)) (AND (GEQ s503 1) (GEQ s507 4) (GEQ s509 6)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-12 finished in 17204 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 166 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1183 transition count 1514
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 1098 transition count 1514
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 170 place count 1098 transition count 1429
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 340 place count 1013 transition count 1429
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 346 place count 1010 transition count 1426
Applied a total of 346 rules in 64 ms. Remains 1010 /1188 variables (removed 178) and now considering 1426/1599 (removed 173) transitions.
[2023-03-15 12:52:08] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 12:52:08] [INFO ] Computed 177 place invariants in 51 ms
[2023-03-15 12:52:09] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
[2023-03-15 12:52:09] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:52:09] [INFO ] Invariant cache hit.
[2023-03-15 12:52:10] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2023-03-15 12:52:10] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:52:10] [INFO ] Invariant cache hit.
[2023-03-15 12:52:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:52:16] [INFO ] Implicit Places using invariants and state equation in 6015 ms returned []
Implicit Place search using SMT with State Equation took 7253 ms to find 0 implicit places.
[2023-03-15 12:52:16] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 12:52:16] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 12:52:16] [INFO ] Invariant cache hit.
[2023-03-15 12:52:17] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1188 places, 1426/1599 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9408 ms. Remains : 1010/1188 places, 1426/1599 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s127 1) (GEQ s411 1)) (AND (GEQ s0 1) (GEQ s137 1) (GEQ s411 1)) (AND (GEQ s0 1) (GEQ s156 1) (GEQ s411 1)) (AND (GEQ s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J80-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-15 finished in 9462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(G(p1))&&F(p2)))))))'
Found a Shortening insensitive property : PolyORBNT-COL-S05J80-LTLFireability-04
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1188/1188 places, 1599/1599 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1188 transition count 1517
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 1106 transition count 1517
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 164 place count 1106 transition count 1432
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 334 place count 1021 transition count 1432
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 1019 transition count 1430
Applied a total of 338 rules in 87 ms. Remains 1019 /1188 variables (removed 169) and now considering 1430/1599 (removed 169) transitions.
[2023-03-15 12:52:18] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
// Phase 1: matrix 1426 rows 1019 cols
[2023-03-15 12:52:18] [INFO ] Computed 182 place invariants in 32 ms
[2023-03-15 12:52:19] [INFO ] Dead Transitions using invariants and state equation in 1357 ms found 0 transitions.
[2023-03-15 12:52:19] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:19] [INFO ] Invariant cache hit.
[2023-03-15 12:52:20] [INFO ] Implicit Places using invariants in 1193 ms returned []
[2023-03-15 12:52:20] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:20] [INFO ] Invariant cache hit.
[2023-03-15 12:52:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:52:28] [INFO ] Implicit Places using invariants and state equation in 7148 ms returned []
Implicit Place search using SMT with State Equation took 8343 ms to find 0 implicit places.
[2023-03-15 12:52:28] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:28] [INFO ] Invariant cache hit.
[2023-03-15 12:52:29] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1019/1188 places, 1430/1599 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10946 ms. Remains : 1019/1188 places, 1430/1599 transitions.
Running random walk in product with property : PolyORBNT-COL-S05J80-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1018 1), p1:(AND (OR (LT s505 1) (LT s1004 1) (LT s1009 1) (LT s1012 1)) (OR (LT s505 1) (LT s1002 1) (LT s1007 1) (LT s1012 1)) (OR (LT s505 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14804 reset in 599 ms.
Product exploration explored 100000 steps with 14813 reset in 640 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 p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 152 steps, including 11 resets, run visited all 4 properties in 3 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p1 (NOT p0))), (F p0), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 350 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-15 12:52:31] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:31] [INFO ] Invariant cache hit.
[2023-03-15 12:52:32] [INFO ] [Real]Absence check using 174 positive place invariants in 206 ms returned sat
[2023-03-15 12:52:33] [INFO ] [Real]Absence check using 174 positive and 8 generalized place invariants in 150 ms returned sat
[2023-03-15 12:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:52:36] [INFO ] [Real]Absence check using state equation in 3141 ms returned sat
[2023-03-15 12:52:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:52:37] [INFO ] [Nat]Absence check using 174 positive place invariants in 185 ms returned sat
[2023-03-15 12:52:37] [INFO ] [Nat]Absence check using 174 positive and 8 generalized place invariants in 109 ms returned sat
[2023-03-15 12:52:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:52:41] [INFO ] [Nat]Absence check using state equation in 3635 ms returned sat
[2023-03-15 12:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:52:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 392 ms returned sat
[2023-03-15 12:52:41] [INFO ] Computed and/alt/rep : 685/2383/685 causal constraints (skipped 735 transitions) in 87 ms.
[2023-03-15 12:52:43] [INFO ] Added : 21 causal constraints over 5 iterations in 2046 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 23 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 12:52:43] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:43] [INFO ] Invariant cache hit.
[2023-03-15 12:52:45] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
[2023-03-15 12:52:45] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:45] [INFO ] Invariant cache hit.
[2023-03-15 12:52:46] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2023-03-15 12:52:46] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:46] [INFO ] Invariant cache hit.
[2023-03-15 12:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:52:52] [INFO ] Implicit Places using invariants and state equation in 6727 ms returned []
Implicit Place search using SMT with State Equation took 7941 ms to find 0 implicit places.
[2023-03-15 12:52:52] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:52] [INFO ] Invariant cache hit.
[2023-03-15 12:52:54] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10263 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 291 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 49 steps, including 2 resets, run visited all 4 properties in 3 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p0), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-15 12:52:55] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:52:55] [INFO ] Invariant cache hit.
[2023-03-15 12:52:56] [INFO ] [Real]Absence check using 174 positive place invariants in 202 ms returned sat
[2023-03-15 12:52:56] [INFO ] [Real]Absence check using 174 positive and 8 generalized place invariants in 163 ms returned sat
[2023-03-15 12:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:52:59] [INFO ] [Real]Absence check using state equation in 3190 ms returned sat
[2023-03-15 12:52:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:53:01] [INFO ] [Nat]Absence check using 174 positive place invariants in 189 ms returned sat
[2023-03-15 12:53:01] [INFO ] [Nat]Absence check using 174 positive and 8 generalized place invariants in 111 ms returned sat
[2023-03-15 12:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:53:05] [INFO ] [Nat]Absence check using state equation in 3670 ms returned sat
[2023-03-15 12:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:53:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 405 ms returned sat
[2023-03-15 12:53:05] [INFO ] Computed and/alt/rep : 685/2383/685 causal constraints (skipped 735 transitions) in 75 ms.
[2023-03-15 12:53:07] [INFO ] Added : 21 causal constraints over 5 iterations in 2071 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14790 reset in 651 ms.
Product exploration explored 100000 steps with 14759 reset in 686 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 40 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 12:53:09] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:53:09] [INFO ] Invariant cache hit.
[2023-03-15 12:53:10] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
[2023-03-15 12:53:10] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-15 12:53:10] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:53:10] [INFO ] Invariant cache hit.
[2023-03-15 12:53:11] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2384 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Support contains 96 out of 1019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1019/1019 places, 1430/1430 transitions.
Applied a total of 0 rules in 15 ms. Remains 1019 /1019 variables (removed 0) and now considering 1430/1430 (removed 0) transitions.
[2023-03-15 12:53:11] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:53:11] [INFO ] Invariant cache hit.
[2023-03-15 12:53:12] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
[2023-03-15 12:53:12] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:53:12] [INFO ] Invariant cache hit.
[2023-03-15 12:53:14] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2023-03-15 12:53:14] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:53:14] [INFO ] Invariant cache hit.
[2023-03-15 12:53:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 12:53:22] [INFO ] Implicit Places using invariants and state equation in 8186 ms returned []
Implicit Place search using SMT with State Equation took 9378 ms to find 0 implicit places.
[2023-03-15 12:53:22] [INFO ] Flow matrix only has 1426 transitions (discarded 4 similar events)
[2023-03-15 12:53:22] [INFO ] Invariant cache hit.
[2023-03-15 12:53:23] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11705 ms. Remains : 1019/1019 places, 1430/1430 transitions.
Treatment of property PolyORBNT-COL-S05J80-LTLFireability-04 finished in 65508 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)||p0)))'
[2023-03-15 12:53:23] [INFO ] Flatten gal took : 75 ms
[2023-03-15 12:53:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-15 12:53:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1188 places, 1599 transitions and 7962 arcs took 8 ms.
Total runtime 428067 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-COL-S05J80
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA PolyORBNT-COL-S05J80-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678885033712

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
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: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type EXCL) for 6 PolyORBNT-COL-S05J80-LTLFireability-10
lola: time limit : 1195 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1195 2/32 PolyORBNT-COL-S05J80-LTLFireability-10 124076 m, 24815 m/sec, 326176 t fired, .

Time elapsed: 19 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1195 3/32 PolyORBNT-COL-S05J80-LTLFireability-10 254337 m, 26052 m/sec, 688100 t fired, .

Time elapsed: 24 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1195 5/32 PolyORBNT-COL-S05J80-LTLFireability-10 384605 m, 26053 m/sec, 1050256 t fired, .

Time elapsed: 29 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1195 6/32 PolyORBNT-COL-S05J80-LTLFireability-10 514415 m, 25962 m/sec, 1407975 t fired, .

Time elapsed: 34 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1195 8/32 PolyORBNT-COL-S05J80-LTLFireability-10 641290 m, 25375 m/sec, 1762766 t fired, .

Time elapsed: 39 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1195 9/32 PolyORBNT-COL-S05J80-LTLFireability-10 767888 m, 25319 m/sec, 2117110 t fired, .

Time elapsed: 44 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1195 11/32 PolyORBNT-COL-S05J80-LTLFireability-10 894714 m, 25365 m/sec, 2471818 t fired, .

Time elapsed: 49 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1195 12/32 PolyORBNT-COL-S05J80-LTLFireability-10 1020925 m, 25242 m/sec, 2825387 t fired, .

Time elapsed: 54 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1195 14/32 PolyORBNT-COL-S05J80-LTLFireability-10 1141429 m, 24100 m/sec, 3221211 t fired, .

Time elapsed: 59 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1195 15/32 PolyORBNT-COL-S05J80-LTLFireability-10 1254211 m, 22556 m/sec, 3579644 t fired, .

Time elapsed: 64 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1195 16/32 PolyORBNT-COL-S05J80-LTLFireability-10 1366295 m, 22416 m/sec, 3951870 t fired, .

Time elapsed: 69 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/1195 17/32 PolyORBNT-COL-S05J80-LTLFireability-10 1479183 m, 22577 m/sec, 4323366 t fired, .

Time elapsed: 74 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 65/1195 18/32 PolyORBNT-COL-S05J80-LTLFireability-10 1593712 m, 22905 m/sec, 4689191 t fired, .

Time elapsed: 79 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 70/1195 19/32 PolyORBNT-COL-S05J80-LTLFireability-10 1709624 m, 23182 m/sec, 5071036 t fired, .

Time elapsed: 84 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 75/1195 20/32 PolyORBNT-COL-S05J80-LTLFireability-10 1828427 m, 23760 m/sec, 5460089 t fired, .

Time elapsed: 89 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 80/1195 21/32 PolyORBNT-COL-S05J80-LTLFireability-10 1947731 m, 23860 m/sec, 5850382 t fired, .

Time elapsed: 94 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 85/1195 22/32 PolyORBNT-COL-S05J80-LTLFireability-10 2067515 m, 23956 m/sec, 6241568 t fired, .

Time elapsed: 99 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 90/1195 24/32 PolyORBNT-COL-S05J80-LTLFireability-10 2187833 m, 24063 m/sec, 6633125 t fired, .

Time elapsed: 104 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 95/1195 25/32 PolyORBNT-COL-S05J80-LTLFireability-10 2309752 m, 24383 m/sec, 7020645 t fired, .

Time elapsed: 109 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 100/1195 26/32 PolyORBNT-COL-S05J80-LTLFireability-10 2429302 m, 23910 m/sec, 7402711 t fired, .

Time elapsed: 114 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 105/1195 27/32 PolyORBNT-COL-S05J80-LTLFireability-10 2547080 m, 23555 m/sec, 7788273 t fired, .

Time elapsed: 119 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 110/1195 29/32 PolyORBNT-COL-S05J80-LTLFireability-10 2665674 m, 23718 m/sec, 8175541 t fired, .

Time elapsed: 124 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 115/1195 29/32 PolyORBNT-COL-S05J80-LTLFireability-10 2692989 m, 5463 m/sec, 8972652 t fired, .

Time elapsed: 129 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 120/1195 29/32 PolyORBNT-COL-S05J80-LTLFireability-10 2742102 m, 9822 m/sec, 9699499 t fired, .

Time elapsed: 134 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 125/1195 31/32 PolyORBNT-COL-S05J80-LTLFireability-10 2879385 m, 27456 m/sec, 10055308 t fired, .

Time elapsed: 139 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for PolyORBNT-COL-S05J80-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 144 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 PolyORBNT-COL-S05J80-LTLFireability-04
lola: time limit : 1728 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for PolyORBNT-COL-S05J80-LTLFireability-04
lola: result : true
lola: markings : 450
lola: fired transitions : 2384
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBNT-COL-S05J80-LTLFireability-03
lola: time limit : 3456 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3456 3/32 PolyORBNT-COL-S05J80-LTLFireability-03 143891 m, 28778 m/sec, 240999 t fired, .

Time elapsed: 149 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3456 5/32 PolyORBNT-COL-S05J80-LTLFireability-03 280881 m, 27398 m/sec, 470891 t fired, .

Time elapsed: 154 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3456 7/32 PolyORBNT-COL-S05J80-LTLFireability-03 417665 m, 27356 m/sec, 756642 t fired, .

Time elapsed: 159 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3456 9/32 PolyORBNT-COL-S05J80-LTLFireability-03 575914 m, 31649 m/sec, 1010040 t fired, .

Time elapsed: 164 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3456 11/32 PolyORBNT-COL-S05J80-LTLFireability-03 732038 m, 31224 m/sec, 1264450 t fired, .

Time elapsed: 169 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3456 13/32 PolyORBNT-COL-S05J80-LTLFireability-03 883932 m, 30378 m/sec, 1519171 t fired, .

Time elapsed: 174 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3456 16/32 PolyORBNT-COL-S05J80-LTLFireability-03 1034875 m, 30188 m/sec, 1773639 t fired, .

Time elapsed: 179 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3456 17/32 PolyORBNT-COL-S05J80-LTLFireability-03 1179291 m, 28883 m/sec, 2016881 t fired, .

Time elapsed: 184 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3456 19/32 PolyORBNT-COL-S05J80-LTLFireability-03 1301870 m, 24515 m/sec, 2303031 t fired, .

Time elapsed: 189 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3456 21/32 PolyORBNT-COL-S05J80-LTLFireability-03 1417029 m, 23031 m/sec, 2536548 t fired, .

Time elapsed: 194 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3456 22/32 PolyORBNT-COL-S05J80-LTLFireability-03 1528941 m, 22382 m/sec, 2773083 t fired, .

Time elapsed: 199 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3456 24/32 PolyORBNT-COL-S05J80-LTLFireability-03 1637665 m, 21744 m/sec, 3003904 t fired, .

Time elapsed: 204 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3456 25/32 PolyORBNT-COL-S05J80-LTLFireability-03 1754626 m, 23392 m/sec, 3259473 t fired, .

Time elapsed: 209 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3456 27/32 PolyORBNT-COL-S05J80-LTLFireability-03 1893632 m, 27801 m/sec, 3492684 t fired, .

Time elapsed: 214 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3456 29/32 PolyORBNT-COL-S05J80-LTLFireability-03 2027285 m, 26730 m/sec, 3716482 t fired, .

Time elapsed: 219 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3456 31/32 PolyORBNT-COL-S05J80-LTLFireability-03 2168202 m, 28183 m/sec, 4004573 t fired, .

Time elapsed: 224 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for PolyORBNT-COL-S05J80-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S05J80-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
PolyORBNT-COL-S05J80-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 229 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S05J80-LTLFireability-03: LTL unknown AGGR
PolyORBNT-COL-S05J80-LTLFireability-04: LTL true LTL model checker
PolyORBNT-COL-S05J80-LTLFireability-10: LTL unknown AGGR


Time elapsed: 229 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="PolyORBNT-COL-S05J80"
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 PolyORBNT-COL-S05J80, 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 r295-tall-167873948200668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 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 ;