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.r103-tall-167814478300460.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 DES-PT-40a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 83K Mar 5 18:22 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 DES-PT-40a-LTLFireability-00
FORMULA_NAME DES-PT-40a-LTLFireability-01
FORMULA_NAME DES-PT-40a-LTLFireability-02
FORMULA_NAME DES-PT-40a-LTLFireability-03
FORMULA_NAME DES-PT-40a-LTLFireability-04
FORMULA_NAME DES-PT-40a-LTLFireability-05
FORMULA_NAME DES-PT-40a-LTLFireability-06
FORMULA_NAME DES-PT-40a-LTLFireability-07
FORMULA_NAME DES-PT-40a-LTLFireability-08
FORMULA_NAME DES-PT-40a-LTLFireability-09
FORMULA_NAME DES-PT-40a-LTLFireability-10
FORMULA_NAME DES-PT-40a-LTLFireability-11
FORMULA_NAME DES-PT-40a-LTLFireability-12
FORMULA_NAME DES-PT-40a-LTLFireability-13
FORMULA_NAME DES-PT-40a-LTLFireability-14
FORMULA_NAME DES-PT-40a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678252930945

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=DES-PT-40a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:22:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:22:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:22:12] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 05:22:12] [INFO ] Transformed 274 places.
[2023-03-08 05:22:12] [INFO ] Transformed 231 transitions.
[2023-03-08 05:22:12] [INFO ] Found NUPN structural information;
[2023-03-08 05:22:12] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Applied a total of 0 rules in 32 ms. Remains 274 /274 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 05:22:12] [INFO ] Computed 59 place invariants in 24 ms
[2023-03-08 05:22:13] [INFO ] Implicit Places using invariants in 525 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/274 places, 217/217 transitions.
Applied a total of 0 rules in 15 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 273/274 places, 217/217 transitions.
Support contains 55 out of 273 places after structural reductions.
[2023-03-08 05:22:13] [INFO ] Flatten gal took : 47 ms
[2023-03-08 05:22:13] [INFO ] Flatten gal took : 22 ms
[2023-03-08 05:22:13] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 53 out of 273 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 05:22:14] [INFO ] Computed 58 place invariants in 15 ms
[2023-03-08 05:22:14] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 05:22:14] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 05:22:14] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-08 05:22:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 05:22:14] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-08 05:22:19] [INFO ] After 4715ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2023-03-08 05:22:22] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 4 ms to minimize.
[2023-03-08 05:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-08 05:22:24] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-08 05:22:24] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-08 05:22:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-08 05:22:24] [INFO ] After 9262ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 5355 ms.
[2023-03-08 05:22:29] [INFO ] After 15362ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 14 properties in 981 ms.
Support contains 21 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 272 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 272 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 39 ms. Remains 272 /273 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 845176 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 845176 steps, saw 120457 distinct states, run finished after 3008 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:22:34] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 05:22:34] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 05:22:34] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 05:22:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2023-03-08 05:22:34] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 05:22:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:22:35] [INFO ] After 194ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 05:22:35] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-08 05:22:35] [INFO ] After 1188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 305 ms.
Support contains 21 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 05:22:35] [INFO ] Invariant cache hit.
[2023-03-08 05:22:36] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 05:22:36] [INFO ] Invariant cache hit.
[2023-03-08 05:22:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:22:36] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-08 05:22:36] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-08 05:22:36] [INFO ] Invariant cache hit.
[2023-03-08 05:22:36] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 594 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-08 05:22:36] [INFO ] Invariant cache hit.
[2023-03-08 05:22:36] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 05:22:36] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 05:22:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 67 ms returned sat
[2023-03-08 05:22:37] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 05:22:37] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-08 05:22:37] [INFO ] After 1018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA DES-PT-40a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 176 stabilizing places and 171 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(!p0)&&((!p1 U (p2||G(!p1))) U p3)) U G(p1)))'
Support contains 9 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 6 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:22:37] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 05:22:38] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 05:22:38] [INFO ] Invariant cache hit.
[2023-03-08 05:22:38] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-08 05:22:38] [INFO ] Invariant cache hit.
[2023-03-08 05:22:38] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p1), p0, (NOT p1), (AND p1 (NOT p2)), (NOT p3), (AND p0 (NOT p1)), true]
Running random walk in product with property : DES-PT-40a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND p1 p3 p0) (AND p1 p2 p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s82 1) (EQ s188 1)), p3:(AND (EQ s161 1) (EQ s173 1)), p2:(AND (NOT (AND (EQ s48 1) (EQ s267 1))) (NOT (AND (EQ s82 1) (EQ s188 1)))), p0:(AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1332 steps with 330 reset in 32 ms.
FORMULA DES-PT-40a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-00 finished in 1012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))&&X(G(p2))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 6 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:22:38] [INFO ] Invariant cache hit.
[2023-03-08 05:22:39] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-08 05:22:39] [INFO ] Invariant cache hit.
[2023-03-08 05:22:39] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-08 05:22:39] [INFO ] Invariant cache hit.
[2023-03-08 05:22:39] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DES-PT-40a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s44 0) (EQ s267 0)), p1:(OR (EQ s44 0) (EQ s267 0)), p2:(AND (EQ s204 1) (EQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-02 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p1))) U (F(p3)&&X(F(p1))&&p2)))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 6 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:22:39] [INFO ] Invariant cache hit.
[2023-03-08 05:22:39] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 05:22:39] [INFO ] Invariant cache hit.
[2023-03-08 05:22:40] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-08 05:22:40] [INFO ] Invariant cache hit.
[2023-03-08 05:22:40] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (NOT p1), (NOT p3), (NOT p1), true]
Running random walk in product with property : DES-PT-40a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 2}, { cond=p2, acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s220 1) (EQ s236 1)), p0:(AND (EQ s257 1) (EQ s266 1)), p3:(AND (EQ s136 1) (EQ s164 1)), p1:(AND (EQ s220 1) (EQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-03 finished in 721 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 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 271 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 215
Applied a total of 2 rules in 22 ms. Remains 271 /273 variables (removed 2) and now considering 215/217 (removed 2) transitions.
// Phase 1: matrix 215 rows 271 cols
[2023-03-08 05:22:40] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 05:22:40] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 05:22:40] [INFO ] Invariant cache hit.
[2023-03-08 05:22:40] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-08 05:22:40] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 05:22:40] [INFO ] Invariant cache hit.
[2023-03-08 05:22:40] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/273 places, 215/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 271/273 places, 215/217 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s190 1) (EQ s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 2 ms.
FORMULA DES-PT-40a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-05 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 9 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:22:41] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:22:41] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 05:22:41] [INFO ] Invariant cache hit.
[2023-03-08 05:22:41] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-08 05:22:41] [INFO ] Invariant cache hit.
[2023-03-08 05:22:41] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s175 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 416 ms.
Product exploration explored 100000 steps with 33333 reset in 371 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 46 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLFireability-07 finished in 1531 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)||(G(p1) U X(G(p2))))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Applied a total of 0 rules in 20 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 05:22:42] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:22:42] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-08 05:22:42] [INFO ] Invariant cache hit.
[2023-03-08 05:22:43] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2023-03-08 05:22:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:22:43] [INFO ] Invariant cache hit.
[2023-03-08 05:22:43] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 273/273 places, 217/217 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-40a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s87 0) (EQ s188 0)), p2:(AND (EQ s172 1) (EQ s246 1))], nbAcceptance=2, 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 2239 reset in 262 ms.
Product exploration explored 100000 steps with 2211 reset in 356 ms.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/273 stabilizing places and 171/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 347 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:22:45] [INFO ] Invariant cache hit.
[2023-03-08 05:22:45] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:45] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:22:45] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:22:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:45] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 05:22:46] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:22:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-03-08 05:22:46] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-08 05:22:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-08 05:22:46] [INFO ] After 931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-08 05:22:46] [INFO ] After 1201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 ms.
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 272 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 272 transition count 214
Applied a total of 9 rules in 20 ms. Remains 272 /273 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1116080 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :{}
Probabilistic random walk after 1116080 steps, saw 156186 distinct states, run finished after 3001 ms. (steps per millisecond=371 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:22:49] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-08 05:22:49] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 05:22:49] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:22:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 69 ms returned sat
[2023-03-08 05:22:49] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:22:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:22:50] [INFO ] After 66ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:22:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-08 05:22:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 05:22:50] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-08 05:22:50] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 05:22:50] [INFO ] Invariant cache hit.
[2023-03-08 05:22:50] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-08 05:22:50] [INFO ] Invariant cache hit.
[2023-03-08 05:22:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:22:50] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-08 05:22:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:50] [INFO ] Invariant cache hit.
[2023-03-08 05:22:50] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 687 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 05:22:50] [INFO ] Invariant cache hit.
[2023-03-08 05:22:51] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:22:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-08 05:22:51] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:22:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 05:22:51] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:22:51] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-08 05:22:51] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 10 factoid took 310 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p2) (NOT p0))]
Support contains 4 out of 273 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Applied a total of 0 rules in 16 ms. Remains 273 /273 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 273 cols
[2023-03-08 05:22:52] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:22:52] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-08 05:22:52] [INFO ] Invariant cache hit.
[2023-03-08 05:22:53] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-08 05:22:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:22:53] [INFO ] Invariant cache hit.
[2023-03-08 05:22:53] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1338 ms. Remains : 273/273 places, 217/217 transitions.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/273 stabilizing places and 171/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 314 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:22:54] [INFO ] Invariant cache hit.
[2023-03-08 05:22:54] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:54] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:22:54] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:22:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:54] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 05:22:54] [INFO ] After 684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:22:55] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-03-08 05:22:55] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-08 05:22:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-08 05:22:55] [INFO ] After 950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-08 05:22:55] [INFO ] After 1244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 54 ms.
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 272 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 272 transition count 214
Applied a total of 9 rules in 24 ms. Remains 272 /273 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 272/273 places, 214/217 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1201708 steps, run timeout after 3001 ms. (steps per millisecond=400 ) properties seen :{}
Probabilistic random walk after 1201708 steps, saw 168295 distinct states, run finished after 3001 ms. (steps per millisecond=400 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:22:58] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 05:22:58] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:22:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 05:22:58] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:22:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:22:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 05:22:59] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:22:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:22:59] [INFO ] After 62ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:22:59] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2023-03-08 05:22:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-08 05:22:59] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-08 05:22:59] [INFO ] After 643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 60 ms.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 05:22:59] [INFO ] Invariant cache hit.
[2023-03-08 05:22:59] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 05:22:59] [INFO ] Invariant cache hit.
[2023-03-08 05:22:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:22:59] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2023-03-08 05:22:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:22:59] [INFO ] Invariant cache hit.
[2023-03-08 05:23:00] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 687 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 05:23:00] [INFO ] Invariant cache hit.
[2023-03-08 05:23:00] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:23:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 05:23:00] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:23:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:23:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 05:23:00] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:23:00] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 05:23:00] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 10 factoid took 585 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2223 reset in 236 ms.
Product exploration explored 100000 steps with 2222 reset in 253 ms.
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 12 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:23:02] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:23:02] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 05:23:02] [INFO ] Invariant cache hit.
[2023-03-08 05:23:02] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-08 05:23:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:23:02] [INFO ] Invariant cache hit.
[2023-03-08 05:23:02] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 586 ms. Remains : 272/273 places, 216/217 transitions.
Treatment of property DES-PT-40a-LTLFireability-09 finished in 20184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p2)&&p1))&&p0)))'
Support contains 8 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 10 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:23:02] [INFO ] Invariant cache hit.
[2023-03-08 05:23:03] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-08 05:23:03] [INFO ] Invariant cache hit.
[2023-03-08 05:23:03] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-08 05:23:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:23:03] [INFO ] Invariant cache hit.
[2023-03-08 05:23:03] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 789 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-40a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s260 1) (EQ s262 1) (EQ s99 1) (EQ s188 1)), p1:(AND (EQ s109 1) (EQ s188 1)), p2:(OR (EQ s8 0) (EQ s191 0) (EQ s193 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-10 finished in 936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 15 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:23:03] [INFO ] Invariant cache hit.
[2023-03-08 05:23:03] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 05:23:03] [INFO ] Invariant cache hit.
[2023-03-08 05:23:04] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-08 05:23:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:23:04] [INFO ] Invariant cache hit.
[2023-03-08 05:23:04] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 558 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-11 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 (EQ s49 1) (EQ s267 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 38 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-11 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 15 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:23:04] [INFO ] Invariant cache hit.
[2023-03-08 05:23:04] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 05:23:04] [INFO ] Invariant cache hit.
[2023-03-08 05:23:04] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-08 05:23:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:23:04] [INFO ] Invariant cache hit.
[2023-03-08 05:23:04] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 536 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s212 1) (EQ s229 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-12 finished in 613 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((F(p0)&&X(p1)))||X(G(p2))))'
Support contains 5 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 5 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:23:04] [INFO ] Invariant cache hit.
[2023-03-08 05:23:05] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 05:23:05] [INFO ] Invariant cache hit.
[2023-03-08 05:23:05] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-08 05:23:05] [INFO ] Invariant cache hit.
[2023-03-08 05:23:05] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-40a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s129 1) (EQ s164 1)), p2:(OR (EQ s143 0) (EQ s164 0)), p1:(AND (EQ s116 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2198 reset in 217 ms.
Product exploration explored 100000 steps with 2223 reset in 234 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 755 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 686873 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 686873 steps, saw 106516 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-08 05:23:10] [INFO ] Invariant cache hit.
[2023-03-08 05:23:10] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 05:23:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:10] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 05:23:11] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 05:23:11] [INFO ] After 938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-08 05:23:12] [INFO ] After 1447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 474 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 272 transition count 214
Applied a total of 6 rules in 11 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:23:12] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:23:13] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 05:23:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 104 ms returned sat
[2023-03-08 05:23:13] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 05:23:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:23:13] [INFO ] After 156ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 05:23:14] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2023-03-08 05:23:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 05:23:14] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-08 05:23:14] [INFO ] After 1367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 117 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 272/272 places, 214/214 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 797466 steps, run timeout after 3001 ms. (steps per millisecond=265 ) properties seen :{}
Probabilistic random walk after 797466 steps, saw 114073 distinct states, run finished after 3001 ms. (steps per millisecond=265 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-08 05:23:17] [INFO ] Invariant cache hit.
[2023-03-08 05:23:18] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 05:23:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-08 05:23:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 75 ms returned sat
[2023-03-08 05:23:18] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 05:23:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:23:18] [INFO ] After 182ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 05:23:19] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-08 05:23:19] [INFO ] After 1130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 138 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 05:23:19] [INFO ] Invariant cache hit.
[2023-03-08 05:23:19] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 05:23:19] [INFO ] Invariant cache hit.
[2023-03-08 05:23:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:23:19] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-08 05:23:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:23:19] [INFO ] Invariant cache hit.
[2023-03-08 05:23:20] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 684 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-08 05:23:20] [INFO ] Invariant cache hit.
[2023-03-08 05:23:20] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 05:23:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 74 ms returned sat
[2023-03-08 05:23:20] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 05:23:20] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-08 05:23:20] [INFO ] After 777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 17 factoid took 727 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:23:22] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:23:22] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 05:23:22] [INFO ] Invariant cache hit.
[2023-03-08 05:23:22] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-08 05:23:22] [INFO ] Invariant cache hit.
[2023-03-08 05:23:22] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 272/272 places, 216/216 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 855 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 606251 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 606251 steps, saw 95803 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-08 05:23:27] [INFO ] Invariant cache hit.
[2023-03-08 05:23:27] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 05:23:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-08 05:23:28] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 05:23:28] [INFO ] After 949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-08 05:23:28] [INFO ] After 1432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 4 properties in 403 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 272 transition count 214
Applied a total of 6 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 817990 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :{}
Probabilistic random walk after 817990 steps, saw 116666 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:23:32] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 05:23:32] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 05:23:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:23:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 102 ms returned sat
[2023-03-08 05:23:33] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 05:23:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:23:33] [INFO ] After 157ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 05:23:33] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2023-03-08 05:23:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 05:23:33] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-08 05:23:34] [INFO ] After 1312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 163 ms.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 05:23:34] [INFO ] Invariant cache hit.
[2023-03-08 05:23:34] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 05:23:34] [INFO ] Invariant cache hit.
[2023-03-08 05:23:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:23:34] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2023-03-08 05:23:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:23:34] [INFO ] Invariant cache hit.
[2023-03-08 05:23:34] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-08 05:23:34] [INFO ] Invariant cache hit.
[2023-03-08 05:23:34] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 05:23:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-08 05:23:35] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 05:23:35] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-08 05:23:35] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (AND (NOT p0) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 17 factoid took 743 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2240 reset in 220 ms.
Product exploration explored 100000 steps with 2227 reset in 242 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 30 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 05:23:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:23:37] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:23:38] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 272/272 places, 216/216 transitions.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 05:23:38] [INFO ] Invariant cache hit.
[2023-03-08 05:23:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 05:23:38] [INFO ] Invariant cache hit.
[2023-03-08 05:23:38] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-08 05:23:38] [INFO ] Invariant cache hit.
[2023-03-08 05:23:38] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 272/272 places, 216/216 transitions.
Treatment of property DES-PT-40a-LTLFireability-13 finished in 33774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(G(p1))&&p0) U (!p2&&F(!p3))))))'
Support contains 6 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 272 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 272 transition count 216
Applied a total of 2 rules in 28 ms. Remains 272 /273 variables (removed 1) and now considering 216/217 (removed 1) transitions.
[2023-03-08 05:23:38] [INFO ] Invariant cache hit.
[2023-03-08 05:23:38] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-08 05:23:38] [INFO ] Invariant cache hit.
[2023-03-08 05:23:39] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-08 05:23:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:23:39] [INFO ] Invariant cache hit.
[2023-03-08 05:23:39] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/273 places, 216/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 667 ms. Remains : 272/273 places, 216/217 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR p2 p3), p3, (AND p3 (NOT p1)), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR p2 p3)]
Running random walk in product with property : DES-PT-40a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 4}], [{ cond=p3, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p3 p1), acceptance={1} source=2 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s147 1) (EQ s164 1)), p0:(AND (EQ s124 1) (EQ s164 1)), p3:(AND (EQ s137 1) (EQ s164 1)), p1:(AND (EQ s210 1) (EQ s227 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2190 reset in 226 ms.
Product exploration explored 100000 steps with 2239 reset in 252 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p3)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p0)))), (X (OR (NOT p2) p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1139 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR p2 p3), p3, (AND p3 (NOT p1)), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR p2 p3)]
Incomplete random walk after 10000 steps, including 216 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-08 05:23:42] [INFO ] Invariant cache hit.
[2023-03-08 05:23:42] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:42] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:23:42] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 05:23:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:23:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 108 ms returned sat
[2023-03-08 05:23:42] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-08 05:23:43] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-08 05:23:43] [INFO ] After 1130ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 730754 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 730754 steps, saw 104993 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:23:47] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 05:23:47] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 05:23:47] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 05:23:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:23:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-08 05:23:47] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 05:23:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:23:48] [INFO ] After 220ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 05:23:48] [INFO ] After 476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-08 05:23:48] [INFO ] After 1234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 289 ms.
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 05:23:48] [INFO ] Invariant cache hit.
[2023-03-08 05:23:48] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 05:23:48] [INFO ] Invariant cache hit.
[2023-03-08 05:23:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:23:49] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-08 05:23:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:23:49] [INFO ] Invariant cache hit.
[2023-03-08 05:23:49] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 629 ms. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 13 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:23:49] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:23:49] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 05:23:49] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 05:23:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2023-03-08 05:23:50] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 05:23:50] [INFO ] After 585ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-08 05:23:50] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p3)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p0)))), (X (OR (NOT p2) p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p3)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 22 factoid took 1001 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 90 ms :[(OR p2 p3), p3]
Support contains 3 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:23:51] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:23:51] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 05:23:51] [INFO ] Invariant cache hit.
[2023-03-08 05:23:52] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-08 05:23:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:23:52] [INFO ] Invariant cache hit.
[2023-03-08 05:23:52] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 559 ms. Remains : 272/272 places, 216/216 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR p2 p3), p3]
Incomplete random walk after 10000 steps, including 217 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1100680 steps, run timeout after 3001 ms. (steps per millisecond=366 ) properties seen :{}
Probabilistic random walk after 1100680 steps, saw 156690 distinct states, run finished after 3001 ms. (steps per millisecond=366 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 05:23:55] [INFO ] Invariant cache hit.
[2023-03-08 05:23:55] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:55] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 05:23:55] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:23:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:23:56] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-08 05:23:56] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:23:56] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 05:23:56] [INFO ] After 625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1144742 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1144742 steps, saw 160382 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:23:59] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 05:24:00] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:24:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 05:24:00] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:24:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:24:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2023-03-08 05:24:00] [INFO ] After 733ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:24:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:24:01] [INFO ] After 403ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 05:24:01] [INFO ] After 603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 464 ms.
[2023-03-08 05:24:02] [INFO ] After 1972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 101 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-08 05:24:02] [INFO ] Invariant cache hit.
[2023-03-08 05:24:02] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 05:24:02] [INFO ] Invariant cache hit.
[2023-03-08 05:24:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:24:02] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-08 05:24:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:24:02] [INFO ] Invariant cache hit.
[2023-03-08 05:24:02] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 639 ms. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 214 rows 272 cols
[2023-03-08 05:24:02] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 05:24:02] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:24:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 05:24:02] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:24:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:24:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2023-03-08 05:24:03] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:24:03] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2023-03-08 05:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 05:24:03] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-08 05:24:04] [INFO ] After 1162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 74 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 63 ms :[(OR p2 p3), p3]
Product exploration explored 100000 steps with 2253 reset in 218 ms.
Product exploration explored 100000 steps with 2231 reset in 235 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2023-03-08 05:24:04] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 05:24:05] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-08 05:24:05] [INFO ] Invariant cache hit.
[2023-03-08 05:24:05] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-08 05:24:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:24:05] [INFO ] Invariant cache hit.
[2023-03-08 05:24:05] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 272/272 places, 216/216 transitions.
Treatment of property DES-PT-40a-LTLFireability-15 finished in 26832 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)||(G(p1) U X(G(p2))))))'
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((F(p0)&&X(p1)))||X(G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(G(p1))&&p0) U (!p2&&F(!p3))))))'
[2023-03-08 05:24:05] [INFO ] Flatten gal took : 20 ms
[2023-03-08 05:24:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 05:24:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 217 transitions and 1049 arcs took 3 ms.
Total runtime 113395 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-40a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678253272191

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-40a-LTLFireability-09
lola: time limit : 1200 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 3/32 DES-PT-40a-LTLFireability-09 297520 m, 59504 m/sec, 3201068 t fired, .

Time elapsed: 5 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 4/32 DES-PT-40a-LTLFireability-09 537246 m, 47945 m/sec, 6460764 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1200 6/32 DES-PT-40a-LTLFireability-09 749951 m, 42541 m/sec, 9689882 t fired, .

Time elapsed: 15 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1200 7/32 DES-PT-40a-LTLFireability-09 962997 m, 42609 m/sec, 12890276 t fired, .

Time elapsed: 20 secs. Pages in use: 7
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1200 9/32 DES-PT-40a-LTLFireability-09 1178933 m, 43187 m/sec, 16110113 t fired, .

Time elapsed: 25 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1200 10/32 DES-PT-40a-LTLFireability-09 1369165 m, 38046 m/sec, 19288032 t fired, .

Time elapsed: 30 secs. Pages in use: 10
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1200 11/32 DES-PT-40a-LTLFireability-09 1562733 m, 38713 m/sec, 22425787 t fired, .

Time elapsed: 35 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1200 13/32 DES-PT-40a-LTLFireability-09 1770398 m, 41533 m/sec, 25614767 t fired, .

Time elapsed: 40 secs. Pages in use: 13
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1200 14/32 DES-PT-40a-LTLFireability-09 1956817 m, 37283 m/sec, 28756748 t fired, .

Time elapsed: 45 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1200 16/32 DES-PT-40a-LTLFireability-09 2152746 m, 39185 m/sec, 31848931 t fired, .

Time elapsed: 50 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/1200 17/32 DES-PT-40a-LTLFireability-09 2345521 m, 38555 m/sec, 34942780 t fired, .

Time elapsed: 55 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/1200 18/32 DES-PT-40a-LTLFireability-09 2525471 m, 35990 m/sec, 38001379 t fired, .

Time elapsed: 60 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/1200 20/32 DES-PT-40a-LTLFireability-09 2715470 m, 37999 m/sec, 41172736 t fired, .

Time elapsed: 65 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/1200 21/32 DES-PT-40a-LTLFireability-09 2889033 m, 34712 m/sec, 44353826 t fired, .

Time elapsed: 70 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/1200 22/32 DES-PT-40a-LTLFireability-09 3053816 m, 32956 m/sec, 47457823 t fired, .

Time elapsed: 75 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/1200 23/32 DES-PT-40a-LTLFireability-09 3237348 m, 36706 m/sec, 50650561 t fired, .

Time elapsed: 80 secs. Pages in use: 23
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/1200 24/32 DES-PT-40a-LTLFireability-09 3413154 m, 35161 m/sec, 53835115 t fired, .

Time elapsed: 85 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/1200 26/32 DES-PT-40a-LTLFireability-09 3579273 m, 33223 m/sec, 56968242 t fired, .

Time elapsed: 90 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/1200 27/32 DES-PT-40a-LTLFireability-09 3770641 m, 38273 m/sec, 60131227 t fired, .

Time elapsed: 95 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/1200 28/32 DES-PT-40a-LTLFireability-09 3955253 m, 36922 m/sec, 63308676 t fired, .

Time elapsed: 100 secs. Pages in use: 28
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/1200 30/32 DES-PT-40a-LTLFireability-09 4132225 m, 35394 m/sec, 66403473 t fired, .

Time elapsed: 105 secs. Pages in use: 30
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/1200 31/32 DES-PT-40a-LTLFireability-09 4294656 m, 32486 m/sec, 69550613 t fired, .

Time elapsed: 110 secs. Pages in use: 31
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/1200 32/32 DES-PT-40a-LTLFireability-09 4510433 m, 43155 m/sec, 72700554 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for DES-PT-40a-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 1 0 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-40a-LTLFireability-13
lola: time limit : 1740 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1740 3/32 DES-PT-40a-LTLFireability-13 382688 m, 76537 m/sec, 3265398 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1740 5/32 DES-PT-40a-LTLFireability-13 679478 m, 59358 m/sec, 6498898 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1740 7/32 DES-PT-40a-LTLFireability-13 964974 m, 57099 m/sec, 9693177 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1740 9/32 DES-PT-40a-LTLFireability-13 1250694 m, 57144 m/sec, 12933989 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1740 11/32 DES-PT-40a-LTLFireability-13 1498910 m, 49643 m/sec, 16115710 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1740 13/32 DES-PT-40a-LTLFireability-13 1781932 m, 56604 m/sec, 19357759 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1740 15/32 DES-PT-40a-LTLFireability-13 2035344 m, 50682 m/sec, 22611239 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1740 17/32 DES-PT-40a-LTLFireability-13 2310162 m, 54963 m/sec, 25742795 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1740 18/32 DES-PT-40a-LTLFireability-13 2553047 m, 48577 m/sec, 28848789 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1740 20/32 DES-PT-40a-LTLFireability-13 2808706 m, 51131 m/sec, 32113455 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1740 22/32 DES-PT-40a-LTLFireability-13 3038931 m, 46045 m/sec, 35372333 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1740 24/32 DES-PT-40a-LTLFireability-13 3283335 m, 48880 m/sec, 38587900 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1740 25/32 DES-PT-40a-LTLFireability-13 3514781 m, 46289 m/sec, 41804315 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1740 27/32 DES-PT-40a-LTLFireability-13 3758889 m, 48821 m/sec, 44969108 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1740 29/32 DES-PT-40a-LTLFireability-13 4003710 m, 48964 m/sec, 48090103 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1740 30/32 DES-PT-40a-LTLFireability-13 4228214 m, 44900 m/sec, 51189815 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1740 32/32 DES-PT-40a-LTLFireability-13 4494078 m, 53172 m/sec, 54348342 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for DES-PT-40a-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 DES-PT-40a-LTLFireability-15
lola: time limit : 3390 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3390 13/32 DES-PT-40a-LTLFireability-15 1573717 m, 314743 m/sec, 2035578 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# 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
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3390 25/32 DES-PT-40a-LTLFireability-15 3115754 m, 308407 m/sec, 4050909 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for DES-PT-40a-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0
DES-PT-40a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 225 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
DES-PT-40a-LTLFireability-09: LTL unknown AGGR
DES-PT-40a-LTLFireability-13: LTL unknown AGGR
DES-PT-40a-LTLFireability-15: LTL unknown AGGR


Time elapsed: 225 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="DES-PT-40a"
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 DES-PT-40a, 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 r103-tall-167814478300460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;