Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 14K Feb 26 14:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 14:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 26 14:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Feb 26 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Feb 26 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 239K Feb 26 14:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 14:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678859440912

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=PolyORBLF-PT-S04J04T06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 05:50:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 05:50:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:50:42] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2023-03-15 05:50:42] [INFO ] Transformed 554 places.
[2023-03-15 05:50:42] [INFO ] Transformed 2998 transitions.
[2023-03-15 05:50:42] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2023-03-15 05:50:42] [INFO ] Reduced 36 identical enabling conditions.
[2023-03-15 05:50:42] [INFO ] Reduced 36 identical enabling conditions.
[2023-03-15 05:50:42] [INFO ] Reduced 36 identical enabling conditions.
[2023-03-15 05:50:42] [INFO ] Reduced 36 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 130 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Applied a total of 0 rules in 71 ms. Remains 554 /554 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2023-03-15 05:50:43] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2023-03-15 05:50:43] [INFO ] Computed 50 place invariants in 100 ms
[2023-03-15 05:50:44] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 324 transitions.
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2023-03-15 05:50:44] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 554 cols
[2023-03-15 05:50:44] [INFO ] Computed 50 place invariants in 54 ms
[2023-03-15 05:50:45] [INFO ] Implicit Places using invariants in 431 ms returned [90, 246, 277, 386, 484]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 448 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 549/554 places, 1048/1372 transitions.
Applied a total of 0 rules in 29 ms. Remains 549 /549 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2046 ms. Remains : 549/554 places, 1048/1372 transitions.
Support contains 130 out of 549 places after structural reductions.
[2023-03-15 05:50:45] [INFO ] Flatten gal took : 113 ms
[2023-03-15 05:50:45] [INFO ] Flatten gal took : 85 ms
[2023-03-15 05:50:45] [INFO ] Input system was already deterministic with 1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 23) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 05:50:46] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 549 cols
[2023-03-15 05:50:46] [INFO ] Computed 45 place invariants in 24 ms
[2023-03-15 05:50:46] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-15 05:50:46] [INFO ] [Real]Absence check using 13 positive and 32 generalized place invariants in 33 ms returned sat
[2023-03-15 05:50:46] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(p0 U p1)||G(!p1)))'
Support contains 55 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 545 transition count 1048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 539 transition count 1042
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 539 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 533 transition count 1036
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 533 transition count 1036
Applied a total of 28 rules in 61 ms. Remains 533 /549 variables (removed 16) and now considering 1036/1048 (removed 12) transitions.
[2023-03-15 05:50:46] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 533 cols
[2023-03-15 05:50:46] [INFO ] Computed 41 place invariants in 15 ms
[2023-03-15 05:50:47] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
[2023-03-15 05:50:47] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:50:47] [INFO ] Invariant cache hit.
[2023-03-15 05:50:48] [INFO ] Implicit Places using invariants in 456 ms returned [353]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 465 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/549 places, 1036/1048 transitions.
Applied a total of 0 rules in 19 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1557 ms. Remains : 532/549 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), false, false, (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s190 1) (GEQ s501 1) (GEQ s126 1) (GEQ s342 1) (GEQ s280 1) (GEQ s313 1) (GEQ s73 1) (GEQ s382 1) (GEQ s527 1) (GEQ s378 1) (GEQ s47 1) (GEQ s...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 1297 reset in 598 ms.
Product exploration explored 100000 steps with 1295 reset in 529 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 75 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 55 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2023-03-15 05:50:50] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2023-03-15 05:50:50] [INFO ] Computed 40 place invariants in 25 ms
[2023-03-15 05:50:51] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
[2023-03-15 05:50:51] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:50:51] [INFO ] Invariant cache hit.
[2023-03-15 05:50:52] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-15 05:50:52] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:50:52] [INFO ] Invariant cache hit.
[2023-03-15 05:50:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:50:58] [INFO ] Implicit Places using invariants and state equation in 6614 ms returned []
Implicit Place search using SMT with State Equation took 7062 ms to find 0 implicit places.
[2023-03-15 05:50:58] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:50:58] [INFO ] Invariant cache hit.
[2023-03-15 05:50:59] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9061 ms. Remains : 532/532 places, 1036/1036 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1291 reset in 515 ms.
Product exploration explored 100000 steps with 1296 reset in 527 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 55 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 532 transition count 1036
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 36 place count 532 transition count 1084
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 72 place count 532 transition count 1084
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 84 place count 520 transition count 1072
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 96 place count 520 transition count 1072
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 126 places in 2 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 162 place count 520 transition count 1072
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 182 place count 500 transition count 1052
Deduced a syphon composed of 108 places in 2 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 202 place count 500 transition count 1052
Deduced a syphon composed of 108 places in 2 ms
Applied a total of 202 rules in 132 ms. Remains 500 /532 variables (removed 32) and now considering 1052/1036 (removed -16) transitions.
[2023-03-15 05:51:02] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
// Phase 1: matrix 1028 rows 500 cols
[2023-03-15 05:51:02] [INFO ] Computed 40 place invariants in 14 ms
[2023-03-15 05:51:03] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
[2023-03-15 05:51:03] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-15 05:51:03] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
[2023-03-15 05:51:03] [INFO ] Invariant cache hit.
[2023-03-15 05:51:03] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/532 places, 1052/1036 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1737 ms. Remains : 500/532 places, 1052/1036 transitions.
Support contains 55 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2023-03-15 05:51:03] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2023-03-15 05:51:03] [INFO ] Computed 40 place invariants in 24 ms
[2023-03-15 05:51:04] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
[2023-03-15 05:51:04] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:51:04] [INFO ] Invariant cache hit.
[2023-03-15 05:51:05] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-15 05:51:05] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:51:05] [INFO ] Invariant cache hit.
[2023-03-15 05:51:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:51:13] [INFO ] Implicit Places using invariants and state equation in 8054 ms returned []
Implicit Place search using SMT with State Equation took 8509 ms to find 0 implicit places.
[2023-03-15 05:51:13] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:51:13] [INFO ] Invariant cache hit.
[2023-03-15 05:51:14] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10561 ms. Remains : 532/532 places, 1036/1036 transitions.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-01 finished in 27725 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(p0))||(!p0 U X(G(p0)))))'
Support contains 11 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 545 transition count 1048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 539 transition count 1042
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 539 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 533 transition count 1036
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 533 transition count 1036
Applied a total of 28 rules in 27 ms. Remains 533 /549 variables (removed 16) and now considering 1036/1048 (removed 12) transitions.
[2023-03-15 05:51:14] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 533 cols
[2023-03-15 05:51:14] [INFO ] Computed 41 place invariants in 21 ms
[2023-03-15 05:51:15] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
[2023-03-15 05:51:15] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:51:15] [INFO ] Invariant cache hit.
[2023-03-15 05:51:16] [INFO ] Implicit Places using invariants in 456 ms returned [353]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 459 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/549 places, 1036/1048 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1449 ms. Remains : 532/549 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 6}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=(NOT p0), acceptance={} source=7 dest: 2}, { cond=p0, acceptance={} source=7 dest: 3}]], initial=4, aps=[p0:(AND (OR (LT s112 8) (LT s176 2) (LT s518 1)) (OR (LT s66 2) (LT s112 8) (LT s465 1)) (OR (LT s26 1) (LT s112 8) (LT s176 1) (LT s472 1)) (OR (LT s10 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 708 ms.
Product exploration explored 100000 steps with 33333 reset in 710 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 8 states, 12 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-02 finished in 3294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 18 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 545 transition count 1000
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 497 transition count 1000
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 497 transition count 940
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 437 transition count 940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 218 place count 435 transition count 938
Iterating global reduction 2 with 2 rules applied. Total rules applied 220 place count 435 transition count 938
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 304 place count 393 transition count 896
Applied a total of 304 rules in 59 ms. Remains 393 /549 variables (removed 156) and now considering 896/1048 (removed 152) transitions.
[2023-03-15 05:51:17] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
// Phase 1: matrix 872 rows 393 cols
[2023-03-15 05:51:17] [INFO ] Computed 41 place invariants in 11 ms
[2023-03-15 05:51:18] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
[2023-03-15 05:51:18] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:18] [INFO ] Invariant cache hit.
[2023-03-15 05:51:19] [INFO ] Implicit Places using invariants in 396 ms returned [253]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 398 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/549 places, 896/1048 transitions.
Applied a total of 0 rules in 24 ms. Remains 392 /392 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1183 ms. Remains : 392/549 places, 896/1048 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s380 1) (GEQ s115 1) (GEQ s77 1) (GEQ s375 1) (GEQ s362 1) (GEQ s283 1)), p0:(OR (AND (GEQ s98 1) (GEQ s223 1)) (AND (GEQ s207 1) (GEQ s326 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9891 steps with 0 reset in 129 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-07 finished in 1508 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 U (X(F(p2))&&p1)))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 545 transition count 1048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 539 transition count 1042
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 539 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 533 transition count 1036
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 533 transition count 1036
Applied a total of 28 rules in 24 ms. Remains 533 /549 variables (removed 16) and now considering 1036/1048 (removed 12) transitions.
[2023-03-15 05:51:19] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 533 cols
[2023-03-15 05:51:19] [INFO ] Computed 41 place invariants in 30 ms
[2023-03-15 05:51:20] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
[2023-03-15 05:51:20] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:51:20] [INFO ] Invariant cache hit.
[2023-03-15 05:51:20] [INFO ] Implicit Places using invariants in 445 ms returned [353]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 451 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/549 places, 1036/1048 transitions.
Applied a total of 0 rules in 6 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1542 ms. Remains : 532/549 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s277 1) (GEQ s376 1)), p0:(AND (GEQ s363 10) (GEQ s496 1) (GEQ s502 1)), p2:(LT s471 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-08 finished in 2001 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(G(p0))&&F(p1))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 546 transition count 1000
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 498 transition count 1000
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 498 transition count 940
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 438 transition count 940
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 218 place count 436 transition count 938
Iterating global reduction 2 with 2 rules applied. Total rules applied 220 place count 436 transition count 938
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 316 place count 388 transition count 890
Applied a total of 316 rules in 68 ms. Remains 388 /549 variables (removed 161) and now considering 890/1048 (removed 158) transitions.
[2023-03-15 05:51:21] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 388 cols
[2023-03-15 05:51:21] [INFO ] Computed 42 place invariants in 19 ms
[2023-03-15 05:51:22] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
[2023-03-15 05:51:22] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
[2023-03-15 05:51:22] [INFO ] Invariant cache hit.
[2023-03-15 05:51:22] [INFO ] Implicit Places using invariants in 374 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 376 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 387/549 places, 890/1048 transitions.
Applied a total of 0 rules in 25 ms. Remains 387 /387 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1066 ms. Remains : 387/549 places, 890/1048 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s231 1) (GEQ s259 1)), p1:(AND (GEQ s83 1) (GEQ s180 1) (GEQ s361 1) (GEQ s378 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8128 steps with 0 reset in 36 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-10 finished in 1240 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&&F((p1||(p0 U X(p2)))))))))'
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 545 transition count 1048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 539 transition count 1042
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 539 transition count 1042
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 534 transition count 1037
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 534 transition count 1037
Applied a total of 26 rules in 26 ms. Remains 534 /549 variables (removed 15) and now considering 1037/1048 (removed 11) transitions.
[2023-03-15 05:51:22] [INFO ] Flow matrix only has 1013 transitions (discarded 24 similar events)
// Phase 1: matrix 1013 rows 534 cols
[2023-03-15 05:51:22] [INFO ] Computed 41 place invariants in 21 ms
[2023-03-15 05:51:23] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
[2023-03-15 05:51:23] [INFO ] Flow matrix only has 1013 transitions (discarded 24 similar events)
[2023-03-15 05:51:23] [INFO ] Invariant cache hit.
[2023-03-15 05:51:24] [INFO ] Implicit Places using invariants in 422 ms returned [353]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 533/549 places, 1037/1048 transitions.
Applied a total of 0 rules in 11 ms. Remains 533 /533 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1515 ms. Remains : 533/549 places, 1037/1048 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s487 1), p1:(AND (GEQ s10 1) (GEQ s66 1) (GEQ s112 8) (GEQ s145 1)), p2:(AND (GEQ s363 10) (GEQ s497 1) (GEQ s503 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-11 finished in 1730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 5 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 545 transition count 994
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 491 transition count 994
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 108 place count 491 transition count 935
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 226 place count 432 transition count 935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 228 place count 430 transition count 933
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 430 transition count 933
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 348 place count 371 transition count 874
Applied a total of 348 rules in 50 ms. Remains 371 /549 variables (removed 178) and now considering 874/1048 (removed 174) transitions.
[2023-03-15 05:51:24] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 371 cols
[2023-03-15 05:51:24] [INFO ] Computed 41 place invariants in 11 ms
[2023-03-15 05:51:24] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2023-03-15 05:51:24] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
[2023-03-15 05:51:24] [INFO ] Invariant cache hit.
[2023-03-15 05:51:25] [INFO ] Implicit Places using invariants in 358 ms returned [238]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 370/549 places, 874/1048 transitions.
Applied a total of 0 rules in 21 ms. Remains 370 /370 variables (removed 0) and now considering 874/874 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1022 ms. Remains : 370/549 places, 874/1048 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s254 1) (GEQ s305 1)), p0:(OR (LT s24 1) (LT s66 1) (LT s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12 reset in 398 ms.
Stack based approach found an accepted trace after 1639 steps with 0 reset with depth 1640 and stack size 1640 in 8 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-12 finished in 1530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 5 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 545 transition count 1048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 539 transition count 1042
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 539 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 533 transition count 1036
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 533 transition count 1036
Applied a total of 28 rules in 18 ms. Remains 533 /549 variables (removed 16) and now considering 1036/1048 (removed 12) transitions.
[2023-03-15 05:51:25] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 533 cols
[2023-03-15 05:51:25] [INFO ] Computed 41 place invariants in 15 ms
[2023-03-15 05:51:26] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
[2023-03-15 05:51:26] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
[2023-03-15 05:51:26] [INFO ] Invariant cache hit.
[2023-03-15 05:51:27] [INFO ] Implicit Places using invariants in 434 ms returned [353]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 445 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/549 places, 1036/1048 transitions.
Applied a total of 0 rules in 6 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1506 ms. Remains : 532/549 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s104 1) (GEQ s171 1) (GEQ s277 1)), p0:(AND (GEQ s133 1) (GEQ s410 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-14 finished in 1644 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))||(p0 U p1)||G(!p1)))'
Found a Shortening insensitive property : PolyORBLF-PT-S04J04T06-LTLFireability-01
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), false, false, (AND (NOT p0) p1)]
Support contains 55 out of 549 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 549/549 places, 1048/1048 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 545 transition count 994
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 491 transition count 994
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 491 transition count 934
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 431 transition count 934
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 429 transition count 932
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 429 transition count 932
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 304 place count 393 transition count 896
Applied a total of 304 rules in 39 ms. Remains 393 /549 variables (removed 156) and now considering 896/1048 (removed 152) transitions.
[2023-03-15 05:51:27] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
// Phase 1: matrix 872 rows 393 cols
[2023-03-15 05:51:27] [INFO ] Computed 41 place invariants in 14 ms
[2023-03-15 05:51:28] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
[2023-03-15 05:51:28] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:28] [INFO ] Invariant cache hit.
[2023-03-15 05:51:28] [INFO ] Implicit Places using invariants in 388 ms returned [253]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 390 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 392/549 places, 896/1048 transitions.
Applied a total of 0 rules in 11 ms. Remains 392 /392 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1197 ms. Remains : 392/549 places, 896/1048 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s135 1) (GEQ s368 1) (GEQ s93 1) (GEQ s245 1) (GEQ s203 1) (GEQ s224 1) (GEQ s56 1) (GEQ s275 1) (GEQ s388 1) (GEQ s271 1) (GEQ s35 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1795 reset in 567 ms.
Product exploration explored 100000 steps with 1793 reset in 586 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 51 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 55 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 896/896 transitions.
Applied a total of 0 rules in 2 ms. Remains 392 /392 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-15 05:51:31] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
// Phase 1: matrix 872 rows 392 cols
[2023-03-15 05:51:31] [INFO ] Computed 40 place invariants in 13 ms
[2023-03-15 05:51:31] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
[2023-03-15 05:51:31] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:31] [INFO ] Invariant cache hit.
[2023-03-15 05:51:32] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-15 05:51:32] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:32] [INFO ] Invariant cache hit.
[2023-03-15 05:51:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:51:38] [INFO ] Implicit Places using invariants and state equation in 6054 ms returned []
Implicit Place search using SMT with State Equation took 6460 ms to find 0 implicit places.
[2023-03-15 05:51:38] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:38] [INFO ] Invariant cache hit.
[2023-03-15 05:51:38] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7695 ms. Remains : 392/392 places, 896/896 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 47 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1789 reset in 579 ms.
Product exploration explored 100000 steps with 1795 reset in 584 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 55 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 896/896 transitions.
Applied a total of 0 rules in 11 ms. Remains 392 /392 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-15 05:51:40] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:40] [INFO ] Invariant cache hit.
[2023-03-15 05:51:41] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
[2023-03-15 05:51:41] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 05:51:41] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:41] [INFO ] Invariant cache hit.
[2023-03-15 05:51:42] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1332 ms. Remains : 392/392 places, 896/896 transitions.
Support contains 55 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 896/896 transitions.
Applied a total of 0 rules in 2 ms. Remains 392 /392 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2023-03-15 05:51:42] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:42] [INFO ] Invariant cache hit.
[2023-03-15 05:51:42] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
[2023-03-15 05:51:42] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:42] [INFO ] Invariant cache hit.
[2023-03-15 05:51:43] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-15 05:51:43] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:43] [INFO ] Invariant cache hit.
[2023-03-15 05:51:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-15 05:51:52] [INFO ] Implicit Places using invariants and state equation in 8759 ms returned []
Implicit Place search using SMT with State Equation took 9130 ms to find 0 implicit places.
[2023-03-15 05:51:52] [INFO ] Flow matrix only has 872 transitions (discarded 24 similar events)
[2023-03-15 05:51:52] [INFO ] Invariant cache hit.
[2023-03-15 05:51:52] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10364 ms. Remains : 392/392 places, 896/896 transitions.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-01 finished in 25210 ms.
[2023-03-15 05:51:52] [INFO ] Flatten gal took : 75 ms
[2023-03-15 05:51:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 05:51:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 549 places, 1048 transitions and 4718 arcs took 8 ms.
Total runtime 70528 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-PT-S04J04T06
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678859544600

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBLF-PT-S04J04T06-LTLFireability-01
lola: time limit : 3599 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
PolyORBLF-PT-S04J04T06-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 8/32 PolyORBLF-PT-S04J04T06-LTLFireability-01 716862 m, 143372 m/sec, 1020681 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S04J04T06-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 15/32 PolyORBLF-PT-S04J04T06-LTLFireability-01 1420857 m, 140799 m/sec, 2087397 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S04J04T06-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3599 20/32 PolyORBLF-PT-S04J04T06-LTLFireability-01 2068151 m, 129458 m/sec, 3078511 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S04J04T06-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3599 26/32 PolyORBLF-PT-S04J04T06-LTLFireability-01 2749888 m, 136347 m/sec, 4076143 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S04J04T06-LTLFireability-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3599 32/32 PolyORBLF-PT-S04J04T06-LTLFireability-01 3417050 m, 133432 m/sec, 5100828 t fired, .

Time elapsed: 26 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for PolyORBLF-PT-S04J04T06-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S04J04T06-LTLFireability-01: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-PT-S04J04T06-LTLFireability-01: LTL unknown AGGR


Time elapsed: 31 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="PolyORBLF-PT-S04J04T06"
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 PolyORBLF-PT-S04J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873948000540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T06.tgz
mv PolyORBLF-PT-S04J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;