fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r103-tall-167814478400492
Last Updated
May 14, 2023

About the Execution of LoLa+red for DES-PT-60a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
724.607 154757.00 172968.00 1117.20 FTFFFFFT?TFTTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478400492.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-60a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478400492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 110K 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-60a-LTLFireability-00
FORMULA_NAME DES-PT-60a-LTLFireability-01
FORMULA_NAME DES-PT-60a-LTLFireability-02
FORMULA_NAME DES-PT-60a-LTLFireability-03
FORMULA_NAME DES-PT-60a-LTLFireability-04
FORMULA_NAME DES-PT-60a-LTLFireability-05
FORMULA_NAME DES-PT-60a-LTLFireability-06
FORMULA_NAME DES-PT-60a-LTLFireability-07
FORMULA_NAME DES-PT-60a-LTLFireability-08
FORMULA_NAME DES-PT-60a-LTLFireability-09
FORMULA_NAME DES-PT-60a-LTLFireability-10
FORMULA_NAME DES-PT-60a-LTLFireability-11
FORMULA_NAME DES-PT-60a-LTLFireability-12
FORMULA_NAME DES-PT-60a-LTLFireability-13
FORMULA_NAME DES-PT-60a-LTLFireability-14
FORMULA_NAME DES-PT-60a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678255272848

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-60a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 06:01:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 06:01:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:01:14] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-08 06:01:14] [INFO ] Transformed 354 places.
[2023-03-08 06:01:14] [INFO ] Transformed 311 transitions.
[2023-03-08 06:01:14] [INFO ] Found NUPN structural information;
[2023-03-08 06:01:14] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 126 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 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 297/297 transitions.
Applied a total of 0 rules in 45 ms. Remains 354 /354 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 354 cols
[2023-03-08 06:01:14] [INFO ] Computed 59 place invariants in 28 ms
[2023-03-08 06:01:15] [INFO ] Implicit Places using invariants in 523 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 548 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 297/297 transitions.
Applied a total of 0 rules in 11 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 605 ms. Remains : 353/354 places, 297/297 transitions.
Support contains 43 out of 353 places after structural reductions.
[2023-03-08 06:01:15] [INFO ] Flatten gal took : 239 ms
[2023-03-08 06:01:15] [INFO ] Flatten gal took : 28 ms
[2023-03-08 06:01:15] [INFO ] Input system was already deterministic with 297 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 297 rows 353 cols
[2023-03-08 06:01:16] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 06:01:16] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 06:01:16] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 06:01:17] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-08 06:01:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 06:01:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 85 ms returned sat
[2023-03-08 06:01:42] [INFO ] After 23133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-08 06:01:42] [INFO ] After 23138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-08 06:01:42] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 22 Parikh solutions to 12 different solutions.
Parikh walk visited 18 properties in 451 ms.
Support contains 10 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 297/297 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 353 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 352 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 61 ms. Remains 352 /353 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 352/353 places, 294/297 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 889768 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 889768 steps, saw 126795 distinct states, run finished after 3002 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-08 06:01:45] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 06:01:46] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 06:01:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-08 06:01:46] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 06:01:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 06:01:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2023-03-08 06:01:46] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 06:01:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 06:01:46] [INFO ] After 251ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 06:01:47] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-08 06:01:47] [INFO ] After 1442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 296 ms.
Support contains 10 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 17 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-08 06:01:47] [INFO ] Invariant cache hit.
[2023-03-08 06:01:48] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 06:01:48] [INFO ] Invariant cache hit.
[2023-03-08 06:01:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 06:01:48] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2023-03-08 06:01:48] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 06:01:48] [INFO ] Invariant cache hit.
[2023-03-08 06:01:48] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 840 ms. Remains : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-08 06:01:48] [INFO ] Invariant cache hit.
[2023-03-08 06:01:48] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 06:01:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-08 06:01:48] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 06:01:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 06:01:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 196 ms returned sat
[2023-03-08 06:01:50] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 06:01:50] [INFO ] After 1316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 401 ms.
[2023-03-08 06:01:50] [INFO ] After 2060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-60a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 256 stabilizing places and 251 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(X(F(p0))))'
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 10 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 06:01:51] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 06:01:51] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-08 06:01:51] [INFO ] Invariant cache hit.
[2023-03-08 06:01:51] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-08 06:01:51] [INFO ] Invariant cache hit.
[2023-03-08 06:01:51] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 749 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-00 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:(AND (EQ s50 1) (EQ s271 1) (EQ s273 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]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 2 ms.
FORMULA DES-PT-60a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-00 finished in 1127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 8 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2023-03-08 06:01:52] [INFO ] Invariant cache hit.
[2023-03-08 06:01:52] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-08 06:01:52] [INFO ] Invariant cache hit.
[2023-03-08 06:01:52] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-08 06:01:52] [INFO ] Invariant cache hit.
[2023-03-08 06:01:53] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 728 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s271 1) (EQ s273 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][false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA DES-PT-60a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-02 finished in 810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 13 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2023-03-08 06:01:53] [INFO ] Invariant cache hit.
[2023-03-08 06:01:53] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 06:01:53] [INFO ] Invariant cache hit.
[2023-03-08 06:01:53] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2023-03-08 06:01:53] [INFO ] Invariant cache hit.
[2023-03-08 06:01:53] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 768 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s139 1) (EQ s268 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][false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 2 ms.
FORMULA DES-PT-60a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-03 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((X(p1) U p2))||G(p1))))'
Support contains 7 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 14 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2023-03-08 06:01:53] [INFO ] Invariant cache hit.
[2023-03-08 06:01:54] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 06:01:54] [INFO ] Invariant cache hit.
[2023-03-08 06:01:54] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2023-03-08 06:01:54] [INFO ] Invariant cache hit.
[2023-03-08 06:01:54] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 737 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : DES-PT-60a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=0 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s208 1) (EQ s244 1)), p0:(OR (NOT (AND (EQ s66 1) (EQ s347 1))) (AND (EQ s152 1) (EQ s268 1))), p2:(AND (EQ s215 1) (EQ s244 1))], nbAcceptance=2, 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 34 steps with 0 reset in 2 ms.
FORMULA DES-PT-60a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-04 finished in 1032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((!p0&&F(!p1))) U p0)))'
Support contains 13 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 28 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2023-03-08 06:01:55] [INFO ] Invariant cache hit.
[2023-03-08 06:01:55] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 06:01:55] [INFO ] Invariant cache hit.
[2023-03-08 06:01:55] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-08 06:01:55] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-08 06:01:55] [INFO ] Invariant cache hit.
[2023-03-08 06:01:55] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 762 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), p1]
Running random walk in product with property : DES-PT-60a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s97 1) (EQ s347 1)), p1:(OR (AND (EQ s311 1) (EQ s313 1) (EQ s315 1) (EQ s317 1) (EQ s319 1) (EQ s321 1) (EQ s323 1) (EQ s325 1)) (AND (EQ s7 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-05 finished in 902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&F((G(F(!p1))||(!p0&&F(!p1))))))))'
Support contains 4 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 15 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2023-03-08 06:01:55] [INFO ] Invariant cache hit.
[2023-03-08 06:01:56] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-08 06:01:56] [INFO ] Invariant cache hit.
[2023-03-08 06:01:56] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2023-03-08 06:01:56] [INFO ] Invariant cache hit.
[2023-03-08 06:01:56] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 779 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), p1, p1]
Running random walk in product with property : DES-PT-60a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s174 1) (EQ s268 1)), p1:(AND (EQ s216 1) (EQ s244 1))], 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 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-06 finished in 1091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 5 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 14 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2023-03-08 06:01:57] [INFO ] Invariant cache hit.
[2023-03-08 06:01:57] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 06:01:57] [INFO ] Invariant cache hit.
[2023-03-08 06:01:57] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-08 06:01:57] [INFO ] Invariant cache hit.
[2023-03-08 06:01:57] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 713 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-60a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s44 1) (EQ s271 1) (EQ s273 1)), p0:(OR (EQ s205 0) (EQ s244 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 516 ms.
Product exploration explored 100000 steps with 50000 reset in 460 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 6 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-07 finished in 2112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(X(p2)||p1)))))'
Support contains 4 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 8 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 353 cols
[2023-03-08 06:01:59] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 06:01:59] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-03-08 06:01:59] [INFO ] Invariant cache hit.
[2023-03-08 06:01:59] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2023-03-08 06:01:59] [INFO ] Invariant cache hit.
[2023-03-08 06:02:00] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1058 ms. Remains : 353/353 places, 297/297 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s224 0) (EQ s244 0)), p0:(OR (EQ s276 0) (EQ s346 0)), p2:(OR (EQ s224 0) (EQ s244 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2259 reset in 257 ms.
Product exploration explored 100000 steps with 2258 reset in 350 ms.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 353 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 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 17 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2023-03-08 06:02:01] [INFO ] Invariant cache hit.
[2023-03-08 06:02:01] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-08 06:02:01] [INFO ] Invariant cache hit.
[2023-03-08 06:02:02] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2023-03-08 06:02:02] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 06:02:02] [INFO ] Invariant cache hit.
[2023-03-08 06:02:02] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1134 ms. Remains : 353/353 places, 297/297 transitions.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2257 reset in 222 ms.
Product exploration explored 100000 steps with 2234 reset in 249 ms.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 11 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2023-03-08 06:02:03] [INFO ] Invariant cache hit.
[2023-03-08 06:02:03] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-08 06:02:03] [INFO ] Invariant cache hit.
[2023-03-08 06:02:04] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-08 06:02:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 06:02:04] [INFO ] Invariant cache hit.
[2023-03-08 06:02:04] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1309 ms. Remains : 353/353 places, 297/297 transitions.
Treatment of property DES-PT-60a-LTLFireability-08 finished in 5813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 8 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 13 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 06:02:04] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 06:02:05] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-08 06:02:05] [INFO ] Invariant cache hit.
[2023-03-08 06:02:05] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-08 06:02:05] [INFO ] Invariant cache hit.
[2023-03-08 06:02:05] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-60a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s275 0) (EQ s277 0) (EQ s334 0) (EQ s104 0) (EQ s347 0)), p1:(AND (EQ s58 1) (EQ s271 1) (EQ s273 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 50000 reset in 428 ms.
Product exploration explored 100000 steps with 50000 reset in 426 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 128 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-11 finished in 1823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||G(p2)||X(p3))))'
Support contains 9 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 353 cols
[2023-03-08 06:02:06] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 06:02:06] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-08 06:02:06] [INFO ] Invariant cache hit.
[2023-03-08 06:02:07] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2023-03-08 06:02:07] [INFO ] Invariant cache hit.
[2023-03-08 06:02:07] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 974 ms. Remains : 353/353 places, 297/297 transitions.
Stuttering acceptance computed with spot in 472 ms :[true, (NOT p3), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-60a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p2), acceptance={} source=9 dest: 9}]], initial=2, aps=[p3:(OR (EQ s276 0) (EQ s346 0)), p0:(AND (EQ s104 1) (EQ s348 1)), p1:(OR (EQ s24 0) (EQ s271 0) (EQ s273 0)), p2:(AND (EQ s150 1) (EQ s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 364 ms.
Product exploration explored 100000 steps with 33333 reset in 372 ms.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Detected a total of 256/353 stabilizing places and 251/297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p3))
Knowledge based reduction with 17 factoid took 243 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-60a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-60a-LTLFireability-12 finished in 2449 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)))'
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 11 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 06:02:09] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 06:02:09] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-08 06:02:09] [INFO ] Invariant cache hit.
[2023-03-08 06:02:09] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2023-03-08 06:02:09] [INFO ] Invariant cache hit.
[2023-03-08 06:02:09] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-60a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s245 0) (EQ s266 0)), p1:(OR (EQ s245 0) (EQ s266 0))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-13 finished in 861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U !p1) U p2))'
Support contains 7 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 23 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
[2023-03-08 06:02:10] [INFO ] Invariant cache hit.
[2023-03-08 06:02:10] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-08 06:02:10] [INFO ] Invariant cache hit.
[2023-03-08 06:02:10] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2023-03-08 06:02:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 06:02:10] [INFO ] Invariant cache hit.
[2023-03-08 06:02:10] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/353 places, 296/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 352/353 places, 296/297 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), true, (NOT p0), p1]
Running random walk in product with property : DES-PT-60a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s26 1) (EQ s271 1) (EQ s273 1)), p1:(AND (EQ s99 1) (EQ s347 1)), p0:(AND (EQ s192 1) (EQ s244 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLFireability-14 finished in 854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(X(p2)||p1)))))'
Found a Shortening insensitive property : DES-PT-60a-LTLFireability-08
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 353 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 14 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 353 cols
[2023-03-08 06:02:11] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 06:02:11] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-08 06:02:11] [INFO ] Invariant cache hit.
[2023-03-08 06:02:12] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2023-03-08 06:02:12] [INFO ] Invariant cache hit.
[2023-03-08 06:02:12] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1063 ms. Remains : 353/353 places, 297/297 transitions.
Running random walk in product with property : DES-PT-60a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s224 0) (EQ s244 0)), p0:(OR (EQ s276 0) (EQ s346 0)), p2:(OR (EQ s224 0) (EQ s244 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2221 reset in 212 ms.
Product exploration explored 100000 steps with 2211 reset in 237 ms.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 46 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 353 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 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 15 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2023-03-08 06:02:13] [INFO ] Invariant cache hit.
[2023-03-08 06:02:13] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-08 06:02:13] [INFO ] Invariant cache hit.
[2023-03-08 06:02:14] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-08 06:02:14] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 06:02:14] [INFO ] Invariant cache hit.
[2023-03-08 06:02:14] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1117 ms. Remains : 353/353 places, 297/297 transitions.
Computed a total of 256 stabilizing places and 251 stable transitions
Computed a total of 256 stabilizing places and 251 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 45 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2230 reset in 228 ms.
Product exploration explored 100000 steps with 2249 reset in 243 ms.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2023-03-08 06:02:15] [INFO ] Invariant cache hit.
[2023-03-08 06:02:15] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-08 06:02:15] [INFO ] Invariant cache hit.
[2023-03-08 06:02:16] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
[2023-03-08 06:02:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 06:02:16] [INFO ] Invariant cache hit.
[2023-03-08 06:02:16] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1215 ms. Remains : 353/353 places, 297/297 transitions.
Treatment of property DES-PT-60a-LTLFireability-08 finished in 5598 ms.
[2023-03-08 06:02:16] [INFO ] Flatten gal took : 25 ms
[2023-03-08 06:02:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 06:02:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 353 places, 297 transitions and 1429 arcs took 3 ms.
Total runtime 62231 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-60a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678255427605

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-60a-LTLFireability-08
lola: time limit : 3600 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-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 DES-PT-60a-LTLFireability-08 356760 m, 71352 m/sec, 2490100 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 6/32 DES-PT-60a-LTLFireability-08 689367 m, 66521 m/sec, 4963880 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 8/32 DES-PT-60a-LTLFireability-08 1008212 m, 63769 m/sec, 7459107 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 10/32 DES-PT-60a-LTLFireability-08 1308828 m, 60123 m/sec, 10003612 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 13/32 DES-PT-60a-LTLFireability-08 1590831 m, 56400 m/sec, 12452165 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 15/32 DES-PT-60a-LTLFireability-08 1863471 m, 54528 m/sec, 14928942 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 17/32 DES-PT-60a-LTLFireability-08 2157056 m, 58717 m/sec, 17395813 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 19/32 DES-PT-60a-LTLFireability-08 2442105 m, 57009 m/sec, 19892695 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 20/32 DES-PT-60a-LTLFireability-08 2630355 m, 37650 m/sec, 22409305 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 22/32 DES-PT-60a-LTLFireability-08 2805894 m, 35107 m/sec, 24916882 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 23/32 DES-PT-60a-LTLFireability-08 2970178 m, 32856 m/sec, 27400220 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 24/32 DES-PT-60a-LTLFireability-08 3131584 m, 32281 m/sec, 29870398 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 25/32 DES-PT-60a-LTLFireability-08 3321531 m, 37989 m/sec, 32412972 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 26/32 DES-PT-60a-LTLFireability-08 3485972 m, 32888 m/sec, 34938381 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 27/32 DES-PT-60a-LTLFireability-08 3670275 m, 36860 m/sec, 37536025 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 29/32 DES-PT-60a-LTLFireability-08 3838251 m, 33595 m/sec, 40112514 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3600 31/32 DES-PT-60a-LTLFireability-08 4152102 m, 62770 m/sec, 42645742 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-60a-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-60a-LTLFireability-08: LTL unknown AGGR


Time elapsed: 90 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-60a"
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-60a, 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-167814478400492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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