About the Execution of LTSMin+red for PolyORBNT-PT-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 835.739 | 360490.00 | 391746.00 | 1326.40 | FFFFTFFTFT?FFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950900740.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 ltsminxred
Input is PolyORBNT-PT-S05J60, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900740
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 39K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 154K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 663K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.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 PolyORBNT-PT-S05J60-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J60-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679631332210
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 04:15:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 04:15:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 04:15:34] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-24 04:15:34] [INFO ] Transformed 909 places.
[2023-03-24 04:15:34] [INFO ] Transformed 1970 transitions.
[2023-03-24 04:15:34] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-24 04:15:34] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 04:15:34] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-24 04:15:34] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-24 04:15:34] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 764 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 905 transition count 1315
Applied a total of 4 rules in 62 ms. Remains 905 /909 variables (removed 4) and now considering 1315/1315 (removed 0) transitions.
[2023-03-24 04:15:35] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 905 cols
[2023-03-24 04:15:35] [INFO ] Computed 138 place invariants in 105 ms
[2023-03-24 04:15:38] [INFO ] Dead Transitions using invariants and state equation in 3043 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-24 04:15:38] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 905 cols
[2023-03-24 04:15:38] [INFO ] Computed 138 place invariants in 91 ms
[2023-03-24 04:15:39] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2023-03-24 04:15:39] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-24 04:15:39] [INFO ] Invariant cache hit.
[2023-03-24 04:15:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:15:46] [INFO ] Implicit Places using invariants and state equation in 7602 ms returned []
Implicit Place search using SMT with State Equation took 8696 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 905/909 places, 1220/1315 transitions.
Applied a total of 0 rules in 29 ms. Remains 905 /905 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11886 ms. Remains : 905/909 places, 1220/1315 transitions.
Support contains 764 out of 905 places after structural reductions.
[2023-03-24 04:15:47] [INFO ] Flatten gal took : 185 ms
[2023-03-24 04:15:47] [INFO ] Flatten gal took : 113 ms
[2023-03-24 04:15:47] [INFO ] Input system was already deterministic with 1220 transitions.
Support contains 641 out of 905 places (down from 764) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
[2023-03-24 04:15:48] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-24 04:15:48] [INFO ] Invariant cache hit.
[2023-03-24 04:15:48] [INFO ] [Real]Absence check using 112 positive place invariants in 20 ms returned sat
[2023-03-24 04:15:48] [INFO ] [Real]Absence check using 112 positive and 26 generalized place invariants in 39 ms returned sat
[2023-03-24 04:15:48] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 04:15:48] [INFO ] [Nat]Absence check using 112 positive place invariants in 21 ms returned sat
[2023-03-24 04:15:48] [INFO ] [Nat]Absence check using 112 positive and 26 generalized place invariants in 41 ms returned sat
[2023-03-24 04:15:50] [INFO ] After 1653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 04:15:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:15:50] [INFO ] After 530ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 04:15:51] [INFO ] Deduced a trap composed of 523 places in 472 ms of which 7 ms to minimize.
[2023-03-24 04:15:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1836 ms
[2023-03-24 04:15:53] [INFO ] After 2931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 731 ms.
[2023-03-24 04:15:54] [INFO ] After 5509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1155
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 839 transition count 1154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 838 transition count 1154
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 133 place count 838 transition count 1090
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 261 place count 774 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 262 place count 773 transition count 1089
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 773 transition count 1089
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 267 place count 771 transition count 1087
Applied a total of 267 rules in 255 ms. Remains 771 /905 variables (removed 134) and now considering 1087/1220 (removed 133) transitions.
[2023-03-24 04:15:54] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 04:15:54] [INFO ] Computed 137 place invariants in 19 ms
[2023-03-24 04:15:55] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1578 ms. Remains : 771/905 places, 1087/1220 transitions.
Finished random walk after 536 steps, including 24 resets, run visited all 1 properties in 10 ms. (steps per millisecond=53 )
FORMULA PolyORBNT-PT-S05J60-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(X(G(p0)))&&F(p1)))'
Support contains 63 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Applied a total of 1 rules in 26 ms. Remains 904 /905 variables (removed 1) and now considering 1220/1220 (removed 0) transitions.
[2023-03-24 04:15:56] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 904 cols
[2023-03-24 04:15:56] [INFO ] Computed 137 place invariants in 20 ms
[2023-03-24 04:15:58] [INFO ] Dead Transitions using invariants and state equation in 2062 ms found 0 transitions.
[2023-03-24 04:15:58] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-24 04:15:58] [INFO ] Invariant cache hit.
[2023-03-24 04:15:59] [INFO ] Implicit Places using invariants in 1704 ms returned []
[2023-03-24 04:15:59] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-24 04:15:59] [INFO ] Invariant cache hit.
[2023-03-24 04:16:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:16:15] [INFO ] Implicit Places using invariants and state equation in 15792 ms returned []
Implicit Place search using SMT with State Equation took 17511 ms to find 0 implicit places.
[2023-03-24 04:16:15] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-24 04:16:15] [INFO ] Invariant cache hit.
[2023-03-24 04:16:17] [INFO ] Dead Transitions using invariants and state equation in 1925 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/905 places, 1220/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21532 ms. Remains : 904/905 places, 1220/1220 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s350 1), p0:(OR (AND (GEQ s33 1) (GEQ s261 1)) (AND (GEQ s261 1) (GEQ s467 1)) (AND (GEQ s261 1) (GEQ s865 1)) (AND (GEQ s13 1) (GEQ s261 1)) (AND...], 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-00 finished in 21919 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)||G(p1))))'
Support contains 62 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 47 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 04:16:18] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-24 04:16:18] [INFO ] Computed 137 place invariants in 20 ms
[2023-03-24 04:16:20] [INFO ] Dead Transitions using invariants and state equation in 2220 ms found 0 transitions.
[2023-03-24 04:16:20] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:16:20] [INFO ] Invariant cache hit.
[2023-03-24 04:16:21] [INFO ] Implicit Places using invariants in 1692 ms returned []
[2023-03-24 04:16:21] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:16:21] [INFO ] Invariant cache hit.
[2023-03-24 04:16:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:16:39] [INFO ] Implicit Places using invariants and state equation in 17264 ms returned []
Implicit Place search using SMT with State Equation took 18959 ms to find 0 implicit places.
[2023-03-24 04:16:39] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:16:39] [INFO ] Invariant cache hit.
[2023-03-24 04:16:41] [INFO ] Dead Transitions using invariants and state equation in 2074 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23311 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s489 2), p0:(OR (GEQ s489 2) (GEQ s445 1) (GEQ s133 1) (GEQ s131 1) (GEQ s765 1) (GEQ s135 1) (GEQ s639 1) (GEQ s453 1) (GEQ s893 1) (GEQ s325 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-01 finished in 23495 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)||F(G(p1))))'
Support contains 429 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 899 transition count 1215
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 10 place count 899 transition count 1150
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 140 place count 834 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 833 transition count 1149
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 833 transition count 1149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 831 transition count 1147
Applied a total of 146 rules in 197 ms. Remains 831 /905 variables (removed 74) and now considering 1147/1220 (removed 73) transitions.
[2023-03-24 04:16:41] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
// Phase 1: matrix 1143 rows 831 cols
[2023-03-24 04:16:41] [INFO ] Computed 137 place invariants in 37 ms
[2023-03-24 04:16:43] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
[2023-03-24 04:16:43] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-24 04:16:43] [INFO ] Invariant cache hit.
[2023-03-24 04:16:44] [INFO ] Implicit Places using invariants in 995 ms returned []
[2023-03-24 04:16:44] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-24 04:16:44] [INFO ] Invariant cache hit.
[2023-03-24 04:16:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:16:50] [INFO ] Implicit Places using invariants and state equation in 6502 ms returned []
Implicit Place search using SMT with State Equation took 7542 ms to find 0 implicit places.
[2023-03-24 04:16:51] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-24 04:16:51] [INFO ] Flow matrix only has 1143 transitions (discarded 4 similar events)
[2023-03-24 04:16:51] [INFO ] Invariant cache hit.
[2023-03-24 04:16:52] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 831/905 places, 1147/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10937 ms. Remains : 831/905 places, 1147/1220 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s483 1)) (AND (GEQ s77 1) (GEQ s671 1)) (AND (GEQ s245 1) (GEQ s681 1)) (AND (GEQ s296 1) (GEQ s465 1)) (AND (GEQ s208 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-02 finished in 11119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 91 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 04:16:52] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-24 04:16:52] [INFO ] Computed 137 place invariants in 39 ms
[2023-03-24 04:16:54] [INFO ] Dead Transitions using invariants and state equation in 2179 ms found 0 transitions.
[2023-03-24 04:16:54] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:16:54] [INFO ] Invariant cache hit.
[2023-03-24 04:16:56] [INFO ] Implicit Places using invariants in 1660 ms returned []
[2023-03-24 04:16:56] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:16:56] [INFO ] Invariant cache hit.
[2023-03-24 04:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:17:14] [INFO ] Implicit Places using invariants and state equation in 17951 ms returned []
Implicit Place search using SMT with State Equation took 19622 ms to find 0 implicit places.
[2023-03-24 04:17:14] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:17:14] [INFO ] Invariant cache hit.
[2023-03-24 04:17:16] [INFO ] Dead Transitions using invariants and state equation in 2065 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23973 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s119 1) (GEQ s212 2) (GEQ s528 1) (GEQ s710 7)) (AND (GEQ s119 1) (GEQ s528 1) (GEQ s536 1) (GEQ s710 7) (GEQ s819 1)) (AND (GEQ s119 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-03 finished in 24069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 68 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 04:17:16] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:17:16] [INFO ] Invariant cache hit.
[2023-03-24 04:17:18] [INFO ] Dead Transitions using invariants and state equation in 2284 ms found 0 transitions.
[2023-03-24 04:17:19] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:17:19] [INFO ] Invariant cache hit.
[2023-03-24 04:17:20] [INFO ] Implicit Places using invariants in 1639 ms returned []
[2023-03-24 04:17:20] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:17:20] [INFO ] Invariant cache hit.
[2023-03-24 04:17:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:17:38] [INFO ] Implicit Places using invariants and state equation in 17822 ms returned []
Implicit Place search using SMT with State Equation took 19486 ms to find 0 implicit places.
[2023-03-24 04:17:38] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:17:38] [INFO ] Invariant cache hit.
[2023-03-24 04:17:40] [INFO ] Dead Transitions using invariants and state equation in 2202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24048 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s119 1) (LT s457 1) (LT s536 2) (LT s710 6) (LT s819 1)) (OR (LT s119 1) (LT s212 1) (LT s457 2) (LT s528 1) (LT s710 6)) (OR (LT s119 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1355 ms.
Product exploration explored 100000 steps with 50000 reset in 1264 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-04 finished in 26955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (X(!X((!F(p2) U X(p3)))) U p3)))'
Support contains 73 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 50 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 04:17:43] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:17:43] [INFO ] Invariant cache hit.
[2023-03-24 04:17:45] [INFO ] Dead Transitions using invariants and state equation in 2098 ms found 0 transitions.
[2023-03-24 04:17:45] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:17:45] [INFO ] Invariant cache hit.
[2023-03-24 04:17:47] [INFO ] Implicit Places using invariants in 1522 ms returned []
[2023-03-24 04:17:47] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:17:47] [INFO ] Invariant cache hit.
[2023-03-24 04:17:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:18:06] [INFO ] Implicit Places using invariants and state equation in 18898 ms returned []
Implicit Place search using SMT with State Equation took 20431 ms to find 0 implicit places.
[2023-03-24 04:18:06] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:18:06] [INFO ] Invariant cache hit.
[2023-03-24 04:18:08] [INFO ] Dead Transitions using invariants and state equation in 2129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24731 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 592 ms :[(NOT p3), true, (AND (NOT p1) p3), p3, p3, (AND (NOT p2) p3), true, (AND (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) p3), (NOT p2), (AND (NOT p1) (NOT p2) p3), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=p3, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 10}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=10 dest: 13}], [{ cond=(NOT p2), acceptance={0} source=11 dest: 11}], [{ cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 11}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 14}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p3:(OR (AND (GEQ s110 1) (GEQ s305 1) (GEQ s835 1)) (AND (GEQ s305 1) (GEQ s807 1) (GEQ s835 1)) (AND (GEQ s305 1) (GEQ s495 1) (GEQ s835 1)) (AND (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 81 steps with 5 reset in 6 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-05 finished in 25362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 840 transition count 1155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1091
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1091
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 773 transition count 1089
Applied a total of 262 rules in 151 ms. Remains 773 /905 variables (removed 132) and now considering 1089/1220 (removed 131) transitions.
[2023-03-24 04:18:09] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2023-03-24 04:18:09] [INFO ] Computed 137 place invariants in 18 ms
[2023-03-24 04:18:10] [INFO ] Dead Transitions using invariants and state equation in 1449 ms found 0 transitions.
[2023-03-24 04:18:10] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-24 04:18:10] [INFO ] Invariant cache hit.
[2023-03-24 04:18:12] [INFO ] Implicit Places using invariants in 1494 ms returned []
[2023-03-24 04:18:12] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-24 04:18:12] [INFO ] Invariant cache hit.
[2023-03-24 04:18:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:18:37] [INFO ] Implicit Places using invariants and state equation in 25611 ms returned []
Implicit Place search using SMT with State Equation took 27125 ms to find 0 implicit places.
[2023-03-24 04:18:37] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-24 04:18:37] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-24 04:18:37] [INFO ] Invariant cache hit.
[2023-03-24 04:18:38] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 773/905 places, 1089/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29999 ms. Remains : 773/905 places, 1089/1220 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s396 1) (GEQ s687 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-06 finished in 30051 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) U ((p1 U p2)||F(p1))))||G(F(p3))))'
Support contains 7 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 73 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 04:18:39] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-24 04:18:39] [INFO ] Computed 137 place invariants in 37 ms
[2023-03-24 04:18:41] [INFO ] Dead Transitions using invariants and state equation in 2180 ms found 0 transitions.
[2023-03-24 04:18:41] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:18:41] [INFO ] Invariant cache hit.
[2023-03-24 04:18:42] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2023-03-24 04:18:42] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:18:42] [INFO ] Invariant cache hit.
[2023-03-24 04:18:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:19:00] [INFO ] Implicit Places using invariants and state equation in 18021 ms returned []
Implicit Place search using SMT with State Equation took 19582 ms to find 0 implicit places.
[2023-03-24 04:19:00] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:19:00] [INFO ] Invariant cache hit.
[2023-03-24 04:19:02] [INFO ] Dead Transitions using invariants and state equation in 2050 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23902 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1) p2 p0), (AND (NOT p3) p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s158 1) (GEQ s835 1) (GEQ s866 1)), p3:(LT s689 1), p2:(AND (GEQ s90 1) (GEQ s345 1)), p0:(GEQ s208 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11661 reset in 566 ms.
Product exploration explored 100000 steps with 11499 reset in 530 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 p1) p3 (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (OR p1 p2))), (X (X p3)), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 691 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) p1)]
Incomplete random walk after 10001 steps, including 673 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 120 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 04:19:05] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:19:05] [INFO ] Invariant cache hit.
[2023-03-24 04:19:05] [INFO ] [Real]Absence check using 112 positive place invariants in 22 ms returned sat
[2023-03-24 04:19:05] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 38 ms returned sat
[2023-03-24 04:19:05] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (OR p1 p2))), (X (X p3)), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p1))), (G (NOT (AND (NOT p3) p1)))]
False Knowledge obtained : [(F p1), (F (NOT p3)), (F (AND p0 (NOT p1))), (F (AND (NOT p3) (NOT p1)))]
Knowledge based reduction with 12 factoid took 585 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 240 ms :[(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) p1)]
Support contains 5 out of 903 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Applied a total of 0 rules in 27 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2023-03-24 04:19:06] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:19:06] [INFO ] Invariant cache hit.
[2023-03-24 04:19:08] [INFO ] Dead Transitions using invariants and state equation in 2051 ms found 0 transitions.
[2023-03-24 04:19:08] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:19:08] [INFO ] Invariant cache hit.
[2023-03-24 04:19:10] [INFO ] Implicit Places using invariants in 1496 ms returned []
[2023-03-24 04:19:10] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:19:10] [INFO ] Invariant cache hit.
[2023-03-24 04:19:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:19:26] [INFO ] Implicit Places using invariants and state equation in 16009 ms returned []
Implicit Place search using SMT with State Equation took 17506 ms to find 0 implicit places.
[2023-03-24 04:19:26] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:19:26] [INFO ] Invariant cache hit.
[2023-03-24 04:19:28] [INFO ] Dead Transitions using invariants and state equation in 2130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21728 ms. Remains : 903/903 places, 1219/1219 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 p3 (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Finished random walk after 625 steps, including 41 resets, run visited all 2 properties in 8 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p3)), (F p1)]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Product exploration explored 100000 steps with 6995 reset in 376 ms.
Product exploration explored 100000 steps with 6960 reset in 409 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p3) p1), (AND (NOT p3) p1), (NOT p3), (NOT p3), (AND (NOT p3) p1)]
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 903 transition count 1219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 64 place count 903 transition count 1220
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 903 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 902 transition count 1219
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 902 transition count 1219
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 133 place count 902 transition count 1219
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 197 place count 838 transition count 1155
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 261 place count 838 transition count 1155
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 261 rules in 230 ms. Remains 838 /903 variables (removed 65) and now considering 1155/1219 (removed 64) transitions.
[2023-03-24 04:19:30] [INFO ] Flow matrix only has 1151 transitions (discarded 4 similar events)
// Phase 1: matrix 1151 rows 838 cols
[2023-03-24 04:19:30] [INFO ] Computed 137 place invariants in 25 ms
[2023-03-24 04:19:32] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
[2023-03-24 04:19:32] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-24 04:19:32] [INFO ] Flow matrix only has 1151 transitions (discarded 4 similar events)
[2023-03-24 04:19:32] [INFO ] Invariant cache hit.
[2023-03-24 04:19:33] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 838/903 places, 1155/1219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2795 ms. Remains : 838/903 places, 1155/1219 transitions.
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1219/1219 transitions.
Applied a total of 0 rules in 19 ms. Remains 903 /903 variables (removed 0) and now considering 1219/1219 (removed 0) transitions.
[2023-03-24 04:19:33] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-24 04:19:33] [INFO ] Computed 137 place invariants in 22 ms
[2023-03-24 04:19:35] [INFO ] Dead Transitions using invariants and state equation in 2109 ms found 0 transitions.
[2023-03-24 04:19:35] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:19:35] [INFO ] Invariant cache hit.
[2023-03-24 04:19:37] [INFO ] Implicit Places using invariants in 1600 ms returned []
[2023-03-24 04:19:37] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:19:37] [INFO ] Invariant cache hit.
[2023-03-24 04:19:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:20:00] [INFO ] Implicit Places using invariants and state equation in 23222 ms returned []
Implicit Place search using SMT with State Equation took 24824 ms to find 0 implicit places.
[2023-03-24 04:20:00] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:20:00] [INFO ] Invariant cache hit.
[2023-03-24 04:20:02] [INFO ] Dead Transitions using invariants and state equation in 2071 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29033 ms. Remains : 903/903 places, 1219/1219 transitions.
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-10 finished in 83739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F((G(p1)||(F(p3)&&p2)))) U (p4 U p1)))'
Support contains 10 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 905 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 842 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 841 transition count 1156
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 128 place count 841 transition count 1094
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 252 place count 779 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 253 place count 778 transition count 1093
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 778 transition count 1093
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 777 transition count 1092
Applied a total of 256 rules in 97 ms. Remains 777 /905 variables (removed 128) and now considering 1092/1220 (removed 128) transitions.
[2023-03-24 04:20:02] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
// Phase 1: matrix 1088 rows 777 cols
[2023-03-24 04:20:02] [INFO ] Computed 138 place invariants in 23 ms
[2023-03-24 04:20:04] [INFO ] Dead Transitions using invariants and state equation in 1259 ms found 0 transitions.
[2023-03-24 04:20:04] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-24 04:20:04] [INFO ] Invariant cache hit.
[2023-03-24 04:20:05] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2023-03-24 04:20:05] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-24 04:20:05] [INFO ] Invariant cache hit.
[2023-03-24 04:20:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:20:20] [INFO ] Implicit Places using invariants and state equation in 15348 ms returned []
Implicit Place search using SMT with State Equation took 16756 ms to find 0 implicit places.
[2023-03-24 04:20:20] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-24 04:20:20] [INFO ] Flow matrix only has 1088 transitions (discarded 4 similar events)
[2023-03-24 04:20:20] [INFO ] Invariant cache hit.
[2023-03-24 04:20:22] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 777/905 places, 1092/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19483 ms. Remains : 777/905 places, 1092/1220 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p4) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p4) p0 p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p4 p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p4 p0 p2 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p4) (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p4 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p4 (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p2) (NOT p3))), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p1) p4 (NOT p0) (NOT p3)) (AND (NOT p1) p4 (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s602 1), p4:(GEQ s691 1), p0:(AND (GEQ s57 1) (GEQ s70 1) (GEQ s612 1) (GEQ s636 1)), p2:(AND (GEQ s125 1) (GEQ s261 1)), p3:(AND (GEQ s80 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-11 finished in 19763 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&&X(G(p1))) U p2))))'
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 904 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 128 place count 841 transition count 1155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 130 place count 839 transition count 1092
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 256 place count 776 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 775 transition count 1091
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 775 transition count 1091
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 773 transition count 1089
Applied a total of 262 rules in 96 ms. Remains 773 /905 variables (removed 132) and now considering 1089/1220 (removed 131) transitions.
[2023-03-24 04:20:22] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2023-03-24 04:20:22] [INFO ] Computed 137 place invariants in 22 ms
[2023-03-24 04:20:23] [INFO ] Dead Transitions using invariants and state equation in 1211 ms found 0 transitions.
[2023-03-24 04:20:23] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-24 04:20:23] [INFO ] Invariant cache hit.
[2023-03-24 04:20:25] [INFO ] Implicit Places using invariants in 1463 ms returned []
[2023-03-24 04:20:25] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-24 04:20:25] [INFO ] Invariant cache hit.
[2023-03-24 04:20:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:20:47] [INFO ] Implicit Places using invariants and state equation in 22149 ms returned []
Implicit Place search using SMT with State Equation took 23619 ms to find 0 implicit places.
[2023-03-24 04:20:47] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-24 04:20:47] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
[2023-03-24 04:20:47] [INFO ] Invariant cache hit.
[2023-03-24 04:20:48] [INFO ] Dead Transitions using invariants and state equation in 1342 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 773/905 places, 1089/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26307 ms. Remains : 773/905 places, 1089/1220 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s599 1), p0:(GEQ s598 1), p1:(AND (GEQ s221 1) (GEQ s371 1))], nbAcceptance=2, 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 9 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-13 finished in 26483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1155
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1090
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1089
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1089
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1087
Applied a total of 266 rules in 91 ms. Remains 771 /905 variables (removed 134) and now considering 1087/1220 (removed 133) transitions.
[2023-03-24 04:20:49] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2023-03-24 04:20:49] [INFO ] Computed 137 place invariants in 22 ms
[2023-03-24 04:20:50] [INFO ] Dead Transitions using invariants and state equation in 1380 ms found 0 transitions.
[2023-03-24 04:20:50] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 04:20:50] [INFO ] Invariant cache hit.
[2023-03-24 04:20:51] [INFO ] Implicit Places using invariants in 1479 ms returned []
[2023-03-24 04:20:51] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 04:20:51] [INFO ] Invariant cache hit.
[2023-03-24 04:20:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:21:05] [INFO ] Implicit Places using invariants and state equation in 13498 ms returned []
Implicit Place search using SMT with State Equation took 14979 ms to find 0 implicit places.
[2023-03-24 04:21:05] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-24 04:21:05] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
[2023-03-24 04:21:05] [INFO ] Invariant cache hit.
[2023-03-24 04:21:06] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 771/905 places, 1087/1220 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17771 ms. Remains : 771/905 places, 1087/1220 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s75 1) (GEQ s707 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-14 finished in 17828 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)||(!p1&&X(X(F(p2)))))))'
Support contains 6 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1220/1220 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 903 transition count 1219
Applied a total of 3 rules in 41 ms. Remains 903 /905 variables (removed 2) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 04:21:06] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-24 04:21:06] [INFO ] Computed 137 place invariants in 27 ms
[2023-03-24 04:21:08] [INFO ] Dead Transitions using invariants and state equation in 1986 ms found 0 transitions.
[2023-03-24 04:21:08] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:21:08] [INFO ] Invariant cache hit.
[2023-03-24 04:21:10] [INFO ] Implicit Places using invariants in 1660 ms returned []
[2023-03-24 04:21:10] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:21:10] [INFO ] Invariant cache hit.
[2023-03-24 04:21:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 04:21:28] [INFO ] Implicit Places using invariants and state equation in 17542 ms returned []
Implicit Place search using SMT with State Equation took 19209 ms to find 0 implicit places.
[2023-03-24 04:21:28] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 04:21:28] [INFO ] Invariant cache hit.
[2023-03-24 04:21:30] [INFO ] Dead Transitions using invariants and state equation in 2215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/905 places, 1219/1220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23452 ms. Remains : 903/905 places, 1219/1220 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p2:(GEQ s379 1), p0:(AND (GEQ s305 1) (GEQ s664 1) (GEQ s835 1)), p1:(AND (GEQ s158 1) (GEQ s835 1) (GEQ s866 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]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLFireability-15 finished in 23780 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) U ((p1 U p2)||F(p1))))||G(F(p3))))'
[2023-03-24 04:21:30] [INFO ] Flatten gal took : 65 ms
[2023-03-24 04:21:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 04:21:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 905 places, 1220 transitions and 5836 arcs took 7 ms.
Total runtime 356610 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1306/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-PT-S05J60-LTLFireability-10
BK_STOP 1679631692700
--------------------
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
mcc2023
ltl formula name PolyORBNT-PT-S05J60-LTLFireability-10
ltl formula formula --ltl=/tmp/1306/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 905 places, 1220 transitions and 5836 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1306/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1306/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1306/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.440 real 0.060 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1306/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55bb661843f4]
1: pnml2lts-mc(+0xa2496) [0x55bb66184496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fcb0a027140]
3: pnml2lts-mc(+0x405be5) [0x55bb664e7be5]
4: pnml2lts-mc(+0x16b3f9) [0x55bb6624d3f9]
5: pnml2lts-mc(+0x164ac4) [0x55bb66246ac4]
6: pnml2lts-mc(+0x272e0a) [0x55bb66354e0a]
7: pnml2lts-mc(+0xb61f0) [0x55bb661981f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fcb09e7a4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fcb09e7a67a]
10: pnml2lts-mc(+0xa1581) [0x55bb66183581]
11: pnml2lts-mc(+0xa1910) [0x55bb66183910]
12: pnml2lts-mc(+0xa32a2) [0x55bb661852a2]
13: pnml2lts-mc(+0xa50f4) [0x55bb661870f4]
14: pnml2lts-mc(+0x3f34b3) [0x55bb664d54b3]
15: pnml2lts-mc(+0x7c63d) [0x55bb6615e63d]
16: pnml2lts-mc(+0x67d86) [0x55bb66149d86]
17: pnml2lts-mc(+0x60a8a) [0x55bb66142a8a]
18: pnml2lts-mc(+0x5eb15) [0x55bb66140b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fcb09e62d0a]
20: pnml2lts-mc(+0x6075e) [0x55bb6614275e]
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-PT-S05J60, 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 r297-tall-167873950900740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;