About the Execution of LoLa+red for HirschbergSinclair-PT-35
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 962.176 | 515739.00 | 553050.00 | 2370.10 | TF?FFT?TTFTFFTTT | 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.r199-smll-167840346000476.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 HirschbergSinclair-PT-35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840346000476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 26 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K 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 HirschbergSinclair-PT-35-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678549480987
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=HirschbergSinclair-PT-35
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 15:44:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 15:44:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:44:44] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2023-03-11 15:44:44] [INFO ] Transformed 998 places.
[2023-03-11 15:44:44] [INFO ] Transformed 922 transitions.
[2023-03-11 15:44:44] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HirschbergSinclair-PT-35-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 922/922 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 963 transition count 922
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 66 place count 932 transition count 891
Iterating global reduction 1 with 31 rules applied. Total rules applied 97 place count 932 transition count 891
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 128 place count 901 transition count 860
Iterating global reduction 1 with 31 rules applied. Total rules applied 159 place count 901 transition count 860
Applied a total of 159 rules in 583 ms. Remains 901 /998 variables (removed 97) and now considering 860/922 (removed 62) transitions.
// Phase 1: matrix 860 rows 901 cols
[2023-03-11 15:44:45] [INFO ] Computed 41 place invariants in 40 ms
[2023-03-11 15:44:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 15:44:46] [INFO ] Implicit Places using invariants in 968 ms returned []
[2023-03-11 15:44:46] [INFO ] Invariant cache hit.
[2023-03-11 15:44:49] [INFO ] Implicit Places using invariants and state equation in 2900 ms returned []
Implicit Place search using SMT with State Equation took 3940 ms to find 0 implicit places.
[2023-03-11 15:44:49] [INFO ] Invariant cache hit.
[2023-03-11 15:44:50] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/998 places, 860/922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5786 ms. Remains : 901/998 places, 860/922 transitions.
Support contains 42 out of 901 places after structural reductions.
[2023-03-11 15:44:51] [INFO ] Flatten gal took : 175 ms
[2023-03-11 15:44:51] [INFO ] Flatten gal took : 129 ms
[2023-03-11 15:44:51] [INFO ] Input system was already deterministic with 860 transitions.
Support contains 41 out of 901 places (down from 42) after GAL structural reductions.
Finished random walk after 898 steps, including 0 resets, run visited all 27 properties in 182 ms. (steps per millisecond=4 )
Computed a total of 901 stabilizing places and 860 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 901 transition count 860
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 166 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
// Phase 1: matrix 852 rows 893 cols
[2023-03-11 15:44:52] [INFO ] Computed 41 place invariants in 11 ms
[2023-03-11 15:44:53] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-11 15:44:53] [INFO ] Invariant cache hit.
[2023-03-11 15:44:56] [INFO ] Implicit Places using invariants and state equation in 3013 ms returned []
Implicit Place search using SMT with State Equation took 3732 ms to find 0 implicit places.
[2023-03-11 15:44:56] [INFO ] Invariant cache hit.
[2023-03-11 15:44:57] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5009 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 337 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s727 1) (AND (GEQ s3 1) (GEQ s259 1))), p0:(OR (LT s37 1) (LT s873 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 932 ms.
Product exploration explored 100000 steps with 33333 reset in 799 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-00 finished in 7697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X((p1&&G(p2))))))))'
Support contains 4 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 898 transition count 857
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 898 transition count 857
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 895 transition count 854
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 895 transition count 854
Applied a total of 12 rules in 128 ms. Remains 895 /901 variables (removed 6) and now considering 854/860 (removed 6) transitions.
// Phase 1: matrix 854 rows 895 cols
[2023-03-11 15:45:00] [INFO ] Computed 41 place invariants in 12 ms
[2023-03-11 15:45:00] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-11 15:45:00] [INFO ] Invariant cache hit.
[2023-03-11 15:45:04] [INFO ] Implicit Places using invariants and state equation in 4238 ms returned []
Implicit Place search using SMT with State Equation took 4880 ms to find 0 implicit places.
[2023-03-11 15:45:04] [INFO ] Invariant cache hit.
[2023-03-11 15:45:06] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 895/901 places, 854/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6144 ms. Remains : 895/901 places, 854/860 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s97 1), p1:(OR (LT s61 1) (LT s340 1)), p2:(GEQ s252 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-01 finished in 6454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 867 transition count 448
Reduce places removed 378 places and 0 transitions.
Iterating post reduction 1 with 378 rules applied. Total rules applied 756 place count 489 transition count 448
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 760 place count 485 transition count 444
Iterating global reduction 2 with 4 rules applied. Total rules applied 764 place count 485 transition count 444
Applied a total of 764 rules in 133 ms. Remains 485 /901 variables (removed 416) and now considering 444/860 (removed 416) transitions.
// Phase 1: matrix 444 rows 485 cols
[2023-03-11 15:45:06] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-11 15:45:07] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-11 15:45:07] [INFO ] Invariant cache hit.
[2023-03-11 15:45:09] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 2723 ms to find 0 implicit places.
[2023-03-11 15:45:09] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-11 15:45:09] [INFO ] Invariant cache hit.
[2023-03-11 15:45:10] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/901 places, 444/860 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3801 ms. Remains : 485/901 places, 444/860 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s32 1) (GEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 794 reset in 928 ms.
Product exploration explored 100000 steps with 794 reset in 606 ms.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 142 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2023-03-11 15:45:12] [INFO ] Invariant cache hit.
[2023-03-11 15:45:13] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 304 ms returned sat
[2023-03-11 15:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 15:45:16] [INFO ] [Real]Absence check using state equation in 3483 ms returned sat
[2023-03-11 15:45:17] [INFO ] Computed and/alt/rep : 364/372/364 causal constraints (skipped 14 transitions) in 54 ms.
[2023-03-11 15:45:18] [INFO ] Added : 25 causal constraints over 5 iterations in 1109 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 48 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-11 15:45:18] [INFO ] Invariant cache hit.
[2023-03-11 15:45:19] [INFO ] Implicit Places using invariants in 923 ms returned []
[2023-03-11 15:45:19] [INFO ] Invariant cache hit.
[2023-03-11 15:45:21] [INFO ] Implicit Places using invariants and state equation in 2556 ms returned []
Implicit Place search using SMT with State Equation took 3488 ms to find 0 implicit places.
[2023-03-11 15:45:21] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-11 15:45:21] [INFO ] Invariant cache hit.
[2023-03-11 15:45:22] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4217 ms. Remains : 485/485 places, 444/444 transitions.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 145 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
[2023-03-11 15:45:23] [INFO ] Invariant cache hit.
[2023-03-11 15:45:24] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 303 ms returned sat
[2023-03-11 15:45:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 15:45:27] [INFO ] [Real]Absence check using state equation in 3498 ms returned sat
[2023-03-11 15:45:28] [INFO ] Computed and/alt/rep : 364/372/364 causal constraints (skipped 14 transitions) in 45 ms.
[2023-03-11 15:45:28] [INFO ] Added : 25 causal constraints over 5 iterations in 834 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 794 reset in 704 ms.
Product exploration explored 100000 steps with 795 reset in 544 ms.
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 30 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-11 15:45:30] [INFO ] Invariant cache hit.
[2023-03-11 15:45:31] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-11 15:45:31] [INFO ] Invariant cache hit.
[2023-03-11 15:45:33] [INFO ] Implicit Places using invariants and state equation in 2188 ms returned []
Implicit Place search using SMT with State Equation took 2914 ms to find 0 implicit places.
[2023-03-11 15:45:33] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-11 15:45:33] [INFO ] Invariant cache hit.
[2023-03-11 15:45:33] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3620 ms. Remains : 485/485 places, 444/444 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-02 finished in 27815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 866 transition count 434
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 1 with 391 rules applied. Total rules applied 782 place count 475 transition count 434
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 786 place count 471 transition count 430
Iterating global reduction 2 with 4 rules applied. Total rules applied 790 place count 471 transition count 430
Applied a total of 790 rules in 97 ms. Remains 471 /901 variables (removed 430) and now considering 430/860 (removed 430) transitions.
// Phase 1: matrix 430 rows 471 cols
[2023-03-11 15:45:34] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-11 15:45:34] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-11 15:45:34] [INFO ] Invariant cache hit.
[2023-03-11 15:45:36] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 2761 ms to find 0 implicit places.
[2023-03-11 15:45:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:45:36] [INFO ] Invariant cache hit.
[2023-03-11 15:45:37] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 471/901 places, 430/860 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3662 ms. Remains : 471/901 places, 430/860 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11200 steps with 252 reset in 106 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-04 finished in 3883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)&&p1))||(X((F(p3)&&p2)) U p4))))'
Support contains 6 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 225 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
// Phase 1: matrix 852 rows 893 cols
[2023-03-11 15:45:38] [INFO ] Computed 41 place invariants in 10 ms
[2023-03-11 15:45:39] [INFO ] Implicit Places using invariants in 1119 ms returned []
[2023-03-11 15:45:39] [INFO ] Invariant cache hit.
[2023-03-11 15:45:43] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 4910 ms to find 0 implicit places.
[2023-03-11 15:45:43] [INFO ] Invariant cache hit.
[2023-03-11 15:45:44] [INFO ] Dead Transitions using invariants and state equation in 1241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6377 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 505 ms :[(OR (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p4))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (AND (NOT p3) (NOT p0)), true, (OR (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p4))), (NOT p0), (OR (NOT p3) (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4)))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p4), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND p4 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p4 p1 (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p4) (NOT p1) p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p4) p1 (NOT p0) p2), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND p4 p2 (NOT p3)), acceptance={0} source=7 dest: 1}, { cond=(NOT p2), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p4) p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND p4 (NOT p0) p2 (NOT p3)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p4) (NOT p0) p2), acceptance={0} source=8 dest: 8}]], initial=5, aps=[p4:(LT s353 1), p3:(GEQ s175 1), p1:(GEQ s387 1), p2:(AND (GEQ s13 1) (GEQ s532 1)), p0:(AND (GEQ s13 1) (GEQ s98 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 982 ms.
Product exploration explored 100000 steps with 50000 reset in 793 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p4 (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X p4), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p4) p1 (NOT p0) p2)))), (X (X (NOT (AND p4 p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p1) p2)))), (X (X (NOT (AND p4 (NOT p1) p2 (NOT p3))))), (F (G p4)), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p4)
Knowledge based reduction with 13 factoid took 277 ms. Reduced automaton from 9 states, 18 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-05 finished in 9387 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 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 207 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
[2023-03-11 15:45:47] [INFO ] Invariant cache hit.
[2023-03-11 15:45:48] [INFO ] Implicit Places using invariants in 780 ms returned []
[2023-03-11 15:45:48] [INFO ] Invariant cache hit.
[2023-03-11 15:45:51] [INFO ] Implicit Places using invariants and state equation in 3219 ms returned []
Implicit Place search using SMT with State Equation took 4006 ms to find 0 implicit places.
[2023-03-11 15:45:51] [INFO ] Invariant cache hit.
[2023-03-11 15:45:53] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5628 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s684 1) (AND (GEQ s59 1) (GEQ s286 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]]
Product exploration explored 100000 steps with 296 reset in 453 ms.
Product exploration explored 100000 steps with 296 reset in 556 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 334 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=47 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-11 15:45:55] [INFO ] Invariant cache hit.
[2023-03-11 15:45:56] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 171 ms returned sat
[2023-03-11 15:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 15:46:10] [INFO ] [Real]Absence check using state equation in 13780 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 374 rules applied. Total rules applied 374 place count 859 transition count 444
Reduce places removed 374 places and 0 transitions.
Iterating post reduction 1 with 374 rules applied. Total rules applied 748 place count 485 transition count 444
Applied a total of 748 rules in 65 ms. Remains 485 /893 variables (removed 408) and now considering 444/852 (removed 408) transitions.
// Phase 1: matrix 444 rows 485 cols
[2023-03-11 15:46:10] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-11 15:46:10] [INFO ] Implicit Places using invariants in 831 ms returned []
[2023-03-11 15:46:10] [INFO ] Invariant cache hit.
[2023-03-11 15:46:13] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
[2023-03-11 15:46:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:46:13] [INFO ] Invariant cache hit.
[2023-03-11 15:46:13] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/893 places, 444/852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3672 ms. Remains : 485/893 places, 444/852 transitions.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 173 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-11 15:46:14] [INFO ] Invariant cache hit.
[2023-03-11 15:46:15] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 209 ms returned sat
[2023-03-11 15:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 15:46:25] [INFO ] [Real]Absence check using state equation in 9917 ms returned sat
[2023-03-11 15:46:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 15:46:26] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 244 ms returned sat
[2023-03-11 15:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 15:46:29] [INFO ] [Nat]Absence check using state equation in 3160 ms returned sat
[2023-03-11 15:46:29] [INFO ] Computed and/alt/rep : 365/373/365 causal constraints (skipped 13 transitions) in 33 ms.
[2023-03-11 15:46:33] [INFO ] Added : 242 causal constraints over 49 iterations in 4487 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 135 ms :[(NOT p0)]
Product exploration explored 100000 steps with 624 reset in 683 ms.
Product exploration explored 100000 steps with 623 reset in 713 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 26 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-11 15:46:35] [INFO ] Invariant cache hit.
[2023-03-11 15:46:36] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-11 15:46:36] [INFO ] Invariant cache hit.
[2023-03-11 15:46:39] [INFO ] Implicit Places using invariants and state equation in 2803 ms returned []
Implicit Place search using SMT with State Equation took 3533 ms to find 0 implicit places.
[2023-03-11 15:46:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:46:39] [INFO ] Invariant cache hit.
[2023-03-11 15:46:39] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4187 ms. Remains : 485/485 places, 444/444 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-06 finished in 52351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(F((F(p1)&&G(!p2)))))||G((F(p1)&&F(G(!p2)))))))'
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 155 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
// Phase 1: matrix 852 rows 893 cols
[2023-03-11 15:46:39] [INFO ] Computed 41 place invariants in 13 ms
[2023-03-11 15:46:41] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2023-03-11 15:46:41] [INFO ] Invariant cache hit.
[2023-03-11 15:46:44] [INFO ] Implicit Places using invariants and state equation in 3305 ms returned []
Implicit Place search using SMT with State Equation took 4392 ms to find 0 implicit places.
[2023-03-11 15:46:44] [INFO ] Invariant cache hit.
[2023-03-11 15:46:45] [INFO ] Dead Transitions using invariants and state equation in 1072 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5621 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) p2), (NOT p1), p2, (OR (NOT p1) p2), p2]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s39 1) (GEQ s490 1)), p1:(LT s654 1), p2:(AND (GEQ s65 1) (GEQ s854 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 108 reset in 622 ms.
Product exploration explored 100000 steps with 108 reset in 470 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 11 factoid took 414 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-08 finished in 7799 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&&F(G(p1)))))'
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 164 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
[2023-03-11 15:46:47] [INFO ] Invariant cache hit.
[2023-03-11 15:46:48] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2023-03-11 15:46:48] [INFO ] Invariant cache hit.
[2023-03-11 15:46:52] [INFO ] Implicit Places using invariants and state equation in 3829 ms returned []
Implicit Place search using SMT with State Equation took 4913 ms to find 0 implicit places.
[2023-03-11 15:46:52] [INFO ] Invariant cache hit.
[2023-03-11 15:46:53] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5939 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s616 1), p1:(GEQ s308 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 918 steps with 0 reset in 5 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-09 finished in 6138 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)||F(p1)||G(p2)))'
Support contains 4 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 898 transition count 857
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 898 transition count 857
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 895 transition count 854
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 895 transition count 854
Applied a total of 12 rules in 147 ms. Remains 895 /901 variables (removed 6) and now considering 854/860 (removed 6) transitions.
// Phase 1: matrix 854 rows 895 cols
[2023-03-11 15:46:53] [INFO ] Computed 41 place invariants in 8 ms
[2023-03-11 15:46:54] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2023-03-11 15:46:54] [INFO ] Invariant cache hit.
[2023-03-11 15:46:58] [INFO ] Implicit Places using invariants and state equation in 3638 ms returned []
Implicit Place search using SMT with State Equation took 4703 ms to find 0 implicit places.
[2023-03-11 15:46:58] [INFO ] Invariant cache hit.
[2023-03-11 15:46:59] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 895/901 places, 854/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5727 ms. Remains : 895/901 places, 854/860 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s181 1), p0:(GEQ s16 1), p2:(AND (GEQ s65 1) (GEQ s270 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 14261 reset in 946 ms.
Product exploration explored 100000 steps with 14851 reset in 651 ms.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 8 factoid took 593 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 238 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 8 factoid took 588 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 895 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 854/854 transitions.
Applied a total of 0 rules in 51 ms. Remains 895 /895 variables (removed 0) and now considering 854/854 (removed 0) transitions.
[2023-03-11 15:47:03] [INFO ] Invariant cache hit.
[2023-03-11 15:47:04] [INFO ] Implicit Places using invariants in 887 ms returned []
[2023-03-11 15:47:04] [INFO ] Invariant cache hit.
[2023-03-11 15:47:07] [INFO ] Implicit Places using invariants and state equation in 3644 ms returned []
Implicit Place search using SMT with State Equation took 4538 ms to find 0 implicit places.
[2023-03-11 15:47:07] [INFO ] Invariant cache hit.
[2023-03-11 15:47:09] [INFO ] Dead Transitions using invariants and state equation in 1189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5782 ms. Remains : 895/895 places, 854/854 transitions.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 94 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 359 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14801 reset in 976 ms.
Product exploration explored 100000 steps with 14877 reset in 657 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 895 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 895/895 places, 854/854 transitions.
Performed 388 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 895 transition count 854
Deduced a syphon composed of 388 places in 5 ms
Applied a total of 388 rules in 171 ms. Remains 895 /895 variables (removed 0) and now considering 854/854 (removed 0) transitions.
[2023-03-11 15:47:12] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 854 rows 895 cols
[2023-03-11 15:47:12] [INFO ] Computed 41 place invariants in 9 ms
[2023-03-11 15:47:13] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 895/895 places, 854/854 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1336 ms. Remains : 895/895 places, 854/854 transitions.
Support contains 2 out of 895 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 854/854 transitions.
Applied a total of 0 rules in 37 ms. Remains 895 /895 variables (removed 0) and now considering 854/854 (removed 0) transitions.
// Phase 1: matrix 854 rows 895 cols
[2023-03-11 15:47:13] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-11 15:47:14] [INFO ] Implicit Places using invariants in 925 ms returned []
[2023-03-11 15:47:14] [INFO ] Invariant cache hit.
[2023-03-11 15:47:18] [INFO ] Implicit Places using invariants and state equation in 3846 ms returned []
Implicit Place search using SMT with State Equation took 4775 ms to find 0 implicit places.
[2023-03-11 15:47:18] [INFO ] Invariant cache hit.
[2023-03-11 15:47:19] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5889 ms. Remains : 895/895 places, 854/854 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-11 finished in 26084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 897 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 893 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 893 transition count 852
Applied a total of 16 rules in 113 ms. Remains 893 /901 variables (removed 8) and now considering 852/860 (removed 8) transitions.
// Phase 1: matrix 852 rows 893 cols
[2023-03-11 15:47:19] [INFO ] Computed 41 place invariants in 5 ms
[2023-03-11 15:47:20] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-11 15:47:20] [INFO ] Invariant cache hit.
[2023-03-11 15:47:24] [INFO ] Implicit Places using invariants and state equation in 3432 ms returned []
Implicit Place search using SMT with State Equation took 4250 ms to find 0 implicit places.
[2023-03-11 15:47:24] [INFO ] Invariant cache hit.
[2023-03-11 15:47:24] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/901 places, 852/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5209 ms. Remains : 893/901 places, 852/860 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s428 1) (AND (GEQ s67 1) (GEQ s294 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-12 finished in 5315 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)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 898 transition count 857
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 898 transition count 857
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 895 transition count 854
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 895 transition count 854
Applied a total of 12 rules in 103 ms. Remains 895 /901 variables (removed 6) and now considering 854/860 (removed 6) transitions.
// Phase 1: matrix 854 rows 895 cols
[2023-03-11 15:47:25] [INFO ] Computed 41 place invariants in 6 ms
[2023-03-11 15:47:25] [INFO ] Implicit Places using invariants in 782 ms returned []
[2023-03-11 15:47:25] [INFO ] Invariant cache hit.
[2023-03-11 15:47:27] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2023-03-11 15:47:27] [INFO ] Invariant cache hit.
[2023-03-11 15:47:28] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 895/901 places, 854/860 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3100 ms. Remains : 895/901 places, 854/860 transitions.
Stuttering acceptance computed with spot in 195 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 : HirschbergSinclair-PT-35-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s514 1)), p1:(LT s113 1), p2:(OR (LT s21 1) (LT s439 1))], nbAcceptance=2, 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 108 reset in 561 ms.
Product exploration explored 100000 steps with 108 reset in 405 ms.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 10 factoid took 318 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-14 finished in 4970 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 U (p1||G(p0))))))'
Support contains 2 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 866 transition count 435
Reduce places removed 390 places and 0 transitions.
Iterating post reduction 1 with 390 rules applied. Total rules applied 780 place count 476 transition count 435
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 783 place count 473 transition count 432
Iterating global reduction 2 with 3 rules applied. Total rules applied 786 place count 473 transition count 432
Applied a total of 786 rules in 48 ms. Remains 473 /901 variables (removed 428) and now considering 432/860 (removed 428) transitions.
// Phase 1: matrix 432 rows 473 cols
[2023-03-11 15:47:30] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-11 15:47:30] [INFO ] Implicit Places using invariants in 735 ms returned []
[2023-03-11 15:47:30] [INFO ] Invariant cache hit.
[2023-03-11 15:47:33] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 3061 ms to find 0 implicit places.
[2023-03-11 15:47:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:47:33] [INFO ] Invariant cache hit.
[2023-03-11 15:47:33] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 473/901 places, 432/860 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3731 ms. Remains : 473/901 places, 432/860 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s273 1) (LT s49 1)), p0:(LT s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 325 reset in 488 ms.
Product exploration explored 100000 steps with 316 reset in 376 ms.
Computed a total of 473 stabilizing places and 432 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 473 transition count 432
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-15 finished in 5150 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)))'
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)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-35-LTLFireability-06
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 901 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 901/901 places, 860/860 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 867 transition count 448
Reduce places removed 378 places and 0 transitions.
Iterating post reduction 1 with 378 rules applied. Total rules applied 756 place count 489 transition count 448
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 760 place count 485 transition count 444
Iterating global reduction 2 with 4 rules applied. Total rules applied 764 place count 485 transition count 444
Applied a total of 764 rules in 70 ms. Remains 485 /901 variables (removed 416) and now considering 444/860 (removed 416) transitions.
// Phase 1: matrix 444 rows 485 cols
[2023-03-11 15:47:35] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-11 15:47:36] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-11 15:47:36] [INFO ] Invariant cache hit.
[2023-03-11 15:47:39] [INFO ] Implicit Places using invariants and state equation in 2623 ms returned []
Implicit Place search using SMT with State Equation took 3597 ms to find 0 implicit places.
[2023-03-11 15:47:39] [INFO ] Invariant cache hit.
[2023-03-11 15:47:39] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 485/901 places, 444/860 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4192 ms. Remains : 485/901 places, 444/860 transitions.
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s360 1) (AND (GEQ s30 1) (GEQ s151 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 624 reset in 396 ms.
Product exploration explored 100000 steps with 623 reset in 457 ms.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 175 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-11 15:47:41] [INFO ] Invariant cache hit.
[2023-03-11 15:47:42] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 134 ms returned sat
[2023-03-11 15:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 15:47:51] [INFO ] [Real]Absence check using state equation in 9689 ms returned sat
[2023-03-11 15:47:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 15:47:52] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 259 ms returned sat
[2023-03-11 15:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 15:47:55] [INFO ] [Nat]Absence check using state equation in 3034 ms returned sat
[2023-03-11 15:47:55] [INFO ] Computed and/alt/rep : 365/373/365 causal constraints (skipped 13 transitions) in 33 ms.
[2023-03-11 15:48:00] [INFO ] Added : 242 causal constraints over 49 iterations in 4757 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 21 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-11 15:48:00] [INFO ] Invariant cache hit.
[2023-03-11 15:48:01] [INFO ] Implicit Places using invariants in 862 ms returned []
[2023-03-11 15:48:01] [INFO ] Invariant cache hit.
[2023-03-11 15:48:03] [INFO ] Implicit Places using invariants and state equation in 2222 ms returned []
Implicit Place search using SMT with State Equation took 3086 ms to find 0 implicit places.
[2023-03-11 15:48:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:48:03] [INFO ] Invariant cache hit.
[2023-03-11 15:48:04] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3731 ms. Remains : 485/485 places, 444/444 transitions.
Computed a total of 485 stabilizing places and 444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 485 transition count 444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 175 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 331 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2023-03-11 15:48:05] [INFO ] Invariant cache hit.
[2023-03-11 15:48:05] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 136 ms returned sat
[2023-03-11 15:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 15:48:15] [INFO ] [Real]Absence check using state equation in 9643 ms returned sat
[2023-03-11 15:48:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 15:48:16] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 242 ms returned sat
[2023-03-11 15:48:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 15:48:19] [INFO ] [Nat]Absence check using state equation in 3322 ms returned sat
[2023-03-11 15:48:19] [INFO ] Computed and/alt/rep : 365/373/365 causal constraints (skipped 13 transitions) in 31 ms.
[2023-03-11 15:48:24] [INFO ] Added : 242 causal constraints over 49 iterations in 4691 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 625 reset in 669 ms.
Product exploration explored 100000 steps with 623 reset in 455 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 444/444 transitions.
Applied a total of 0 rules in 24 ms. Remains 485 /485 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-11 15:48:25] [INFO ] Invariant cache hit.
[2023-03-11 15:48:26] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-11 15:48:26] [INFO ] Invariant cache hit.
[2023-03-11 15:48:28] [INFO ] Implicit Places using invariants and state equation in 2652 ms returned []
Implicit Place search using SMT with State Equation took 3362 ms to find 0 implicit places.
[2023-03-11 15:48:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:48:28] [INFO ] Invariant cache hit.
[2023-03-11 15:48:29] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4125 ms. Remains : 485/485 places, 444/444 transitions.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-06 finished in 54224 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)||F(p1)||G(p2)))'
[2023-03-11 15:48:29] [INFO ] Flatten gal took : 51 ms
[2023-03-11 15:48:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 15:48:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 901 places, 860 transitions and 2582 arcs took 9 ms.
Total runtime 225751 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HirschbergSinclair-PT-35
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability
FORMULA HirschbergSinclair-PT-35-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678549996726
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 HirschbergSinclair-PT-35-LTLFireability-02
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 1/32 HirschbergSinclair-PT-35-LTLFireability-02 114289 m, 22857 m/sec, 445889 t fired, .
Time elapsed: 5 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 2/32 HirschbergSinclair-PT-35-LTLFireability-02 225441 m, 22230 m/sec, 938473 t fired, .
Time elapsed: 10 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1200 3/32 HirschbergSinclair-PT-35-LTLFireability-02 336962 m, 22304 m/sec, 1430700 t fired, .
Time elapsed: 15 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1200 3/32 HirschbergSinclair-PT-35-LTLFireability-02 438848 m, 20377 m/sec, 1925731 t fired, .
Time elapsed: 20 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1200 4/32 HirschbergSinclair-PT-35-LTLFireability-02 549046 m, 22039 m/sec, 2416690 t fired, .
Time elapsed: 25 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1200 5/32 HirschbergSinclair-PT-35-LTLFireability-02 651386 m, 20468 m/sec, 2911293 t fired, .
Time elapsed: 30 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1200 5/32 HirschbergSinclair-PT-35-LTLFireability-02 758976 m, 21518 m/sec, 3398749 t fired, .
Time elapsed: 35 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1200 6/32 HirschbergSinclair-PT-35-LTLFireability-02 860912 m, 20387 m/sec, 3886684 t fired, .
Time elapsed: 40 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1200 7/32 HirschbergSinclair-PT-35-LTLFireability-02 961530 m, 20123 m/sec, 4375452 t fired, .
Time elapsed: 45 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1200 7/32 HirschbergSinclair-PT-35-LTLFireability-02 1057093 m, 19112 m/sec, 4866451 t fired, .
Time elapsed: 50 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/1200 8/32 HirschbergSinclair-PT-35-LTLFireability-02 1150477 m, 18676 m/sec, 5361079 t fired, .
Time elapsed: 55 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/1200 9/32 HirschbergSinclair-PT-35-LTLFireability-02 1248578 m, 19620 m/sec, 5854215 t fired, .
Time elapsed: 60 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/1200 9/32 HirschbergSinclair-PT-35-LTLFireability-02 1340095 m, 18303 m/sec, 6351939 t fired, .
Time elapsed: 65 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/1200 10/32 HirschbergSinclair-PT-35-LTLFireability-02 1448209 m, 21622 m/sec, 6837685 t fired, .
Time elapsed: 70 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/1200 11/32 HirschbergSinclair-PT-35-LTLFireability-02 1549481 m, 20254 m/sec, 7327154 t fired, .
Time elapsed: 75 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/1200 11/32 HirschbergSinclair-PT-35-LTLFireability-02 1648910 m, 19885 m/sec, 7817750 t fired, .
Time elapsed: 80 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/1200 12/32 HirschbergSinclair-PT-35-LTLFireability-02 1744780 m, 19174 m/sec, 8310889 t fired, .
Time elapsed: 85 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/1200 12/32 HirschbergSinclair-PT-35-LTLFireability-02 1839668 m, 18977 m/sec, 8805492 t fired, .
Time elapsed: 90 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/1200 13/32 HirschbergSinclair-PT-35-LTLFireability-02 1937279 m, 19522 m/sec, 9298199 t fired, .
Time elapsed: 95 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/1200 14/32 HirschbergSinclair-PT-35-LTLFireability-02 2027587 m, 18061 m/sec, 9795424 t fired, .
Time elapsed: 100 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/1200 14/32 HirschbergSinclair-PT-35-LTLFireability-02 2137585 m, 21999 m/sec, 10284402 t fired, .
Time elapsed: 105 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/1200 15/32 HirschbergSinclair-PT-35-LTLFireability-02 2239214 m, 20325 m/sec, 10777418 t fired, .
Time elapsed: 110 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/1200 16/32 HirschbergSinclair-PT-35-LTLFireability-02 2340149 m, 20187 m/sec, 11270955 t fired, .
Time elapsed: 115 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/1200 16/32 HirschbergSinclair-PT-35-LTLFireability-02 2434193 m, 18808 m/sec, 11768926 t fired, .
Time elapsed: 120 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/1200 17/32 HirschbergSinclair-PT-35-LTLFireability-02 2531840 m, 19529 m/sec, 12264665 t fired, .
Time elapsed: 125 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/1200 18/32 HirschbergSinclair-PT-35-LTLFireability-02 2629234 m, 19478 m/sec, 12763767 t fired, .
Time elapsed: 130 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/1200 18/32 HirschbergSinclair-PT-35-LTLFireability-02 2722919 m, 18737 m/sec, 13261430 t fired, .
Time elapsed: 135 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/1200 19/32 HirschbergSinclair-PT-35-LTLFireability-02 2820621 m, 19540 m/sec, 13752298 t fired, .
Time elapsed: 140 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/1200 19/32 HirschbergSinclair-PT-35-LTLFireability-02 2912365 m, 18348 m/sec, 14248600 t fired, .
Time elapsed: 145 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/1200 20/32 HirschbergSinclair-PT-35-LTLFireability-02 3004539 m, 18434 m/sec, 14746533 t fired, .
Time elapsed: 150 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/1200 21/32 HirschbergSinclair-PT-35-LTLFireability-02 3092353 m, 17562 m/sec, 15243403 t fired, .
Time elapsed: 155 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/1200 21/32 HirschbergSinclair-PT-35-LTLFireability-02 3178770 m, 17283 m/sec, 15741341 t fired, .
Time elapsed: 160 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/1200 22/32 HirschbergSinclair-PT-35-LTLFireability-02 3269565 m, 18159 m/sec, 16244424 t fired, .
Time elapsed: 165 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 170/1200 22/32 HirschbergSinclair-PT-35-LTLFireability-02 3355146 m, 17116 m/sec, 16748325 t fired, .
Time elapsed: 170 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 175/1200 23/32 HirschbergSinclair-PT-35-LTLFireability-02 3459249 m, 20820 m/sec, 17237433 t fired, .
Time elapsed: 175 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 180/1200 24/32 HirschbergSinclair-PT-35-LTLFireability-02 3561021 m, 20354 m/sec, 17724857 t fired, .
Time elapsed: 180 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 185/1200 24/32 HirschbergSinclair-PT-35-LTLFireability-02 3663555 m, 20506 m/sec, 18223949 t fired, .
Time elapsed: 185 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 190/1200 25/32 HirschbergSinclair-PT-35-LTLFireability-02 3759928 m, 19274 m/sec, 18718995 t fired, .
Time elapsed: 190 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 195/1200 26/32 HirschbergSinclair-PT-35-LTLFireability-02 3854483 m, 18911 m/sec, 19218012 t fired, .
Time elapsed: 195 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 200/1200 26/32 HirschbergSinclair-PT-35-LTLFireability-02 3953599 m, 19823 m/sec, 19716252 t fired, .
Time elapsed: 200 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 205/1200 27/32 HirschbergSinclair-PT-35-LTLFireability-02 4045353 m, 18350 m/sec, 20220114 t fired, .
Time elapsed: 205 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 210/1200 27/32 HirschbergSinclair-PT-35-LTLFireability-02 4146473 m, 20224 m/sec, 20715466 t fired, .
Time elapsed: 210 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 215/1200 28/32 HirschbergSinclair-PT-35-LTLFireability-02 4239796 m, 18664 m/sec, 21213454 t fired, .
Time elapsed: 215 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 220/1200 29/32 HirschbergSinclair-PT-35-LTLFireability-02 4332163 m, 18473 m/sec, 21707175 t fired, .
Time elapsed: 220 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 225/1200 29/32 HirschbergSinclair-PT-35-LTLFireability-02 4421437 m, 17854 m/sec, 22208104 t fired, .
Time elapsed: 225 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 230/1200 30/32 HirschbergSinclair-PT-35-LTLFireability-02 4506432 m, 16999 m/sec, 22715889 t fired, .
Time elapsed: 230 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 235/1200 30/32 HirschbergSinclair-PT-35-LTLFireability-02 4599625 m, 18638 m/sec, 23218985 t fired, .
Time elapsed: 235 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 240/1200 31/32 HirschbergSinclair-PT-35-LTLFireability-02 4685048 m, 17084 m/sec, 23716629 t fired, .
Time elapsed: 240 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 245/1200 32/32 HirschbergSinclair-PT-35-LTLFireability-02 4779789 m, 18948 m/sec, 24216384 t fired, .
Time elapsed: 245 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 250/1200 32/32 HirschbergSinclair-PT-35-LTLFireability-02 4876656 m, 19373 m/sec, 24713482 t fired, .
Time elapsed: 250 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for HirschbergSinclair-PT-35-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
HirschbergSinclair-PT-35-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 255 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 HirschbergSinclair-PT-35-LTLFireability-11
lola: time limit : 1672 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for HirschbergSinclair-PT-35-LTLFireability-11
lola: result : false
lola: markings : 1024
lola: fired transitions : 1024
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 HirschbergSinclair-PT-35-LTLFireability-06
lola: time limit : 3345 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-35-LTLFireability-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3345 7/32 HirschbergSinclair-PT-35-LTLFireability-06 263496 m, 52699 m/sec, 811174 t fired, .
Time elapsed: 260 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-35-LTLFireability-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3345 12/32 HirschbergSinclair-PT-35-LTLFireability-06 494925 m, 46285 m/sec, 1621154 t fired, .
Time elapsed: 265 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-35-LTLFireability-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3345 17/32 HirschbergSinclair-PT-35-LTLFireability-06 715423 m, 44099 m/sec, 2420450 t fired, .
Time elapsed: 270 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-35-LTLFireability-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3345 22/32 HirschbergSinclair-PT-35-LTLFireability-06 937867 m, 44488 m/sec, 3221293 t fired, .
Time elapsed: 275 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-35-LTLFireability-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3345 27/32 HirschbergSinclair-PT-35-LTLFireability-06 1159805 m, 44387 m/sec, 4019461 t fired, .
Time elapsed: 280 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for HirschbergSinclair-PT-35-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-35-LTLFireability-11: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HirschbergSinclair-PT-35-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
HirschbergSinclair-PT-35-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 285 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HirschbergSinclair-PT-35-LTLFireability-02: LTL unknown AGGR
HirschbergSinclair-PT-35-LTLFireability-06: LTL unknown AGGR
HirschbergSinclair-PT-35-LTLFireability-11: LTL false LTL model checker
Time elapsed: 285 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="HirschbergSinclair-PT-35"
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 HirschbergSinclair-PT-35, 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 r199-smll-167840346000476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 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 '
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 ;